./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 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/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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-cde23df-m [2024-06-14 15:19:31,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:19:31,160 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:19:31,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:19:31,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:19:31,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:19:31,198 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:19:31,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:19:31,199 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:19:31,199 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:19:31,200 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:19:31,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:19:31,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:19:31,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:19:31,201 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:19:31,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:19:31,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:19:31,201 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:19:31,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:19:31,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:19:31,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:19:31,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:19:31,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:19:31,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:19:31,210 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:19:31,210 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:19:31,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:19:31,211 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:19:31,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:19:31,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:19:31,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:19:31,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:19:31,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:19:31,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:19:31,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:19:31,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:19:31,214 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:19:31,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:19:31,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:19:31,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:19:31,214 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:19:31,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:19:31,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:19:31,215 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-14 15:19:31,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:19:31,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:19:31,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:19:31,451 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:19:31,452 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:19:31,453 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/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.yml/witness.yml [2024-06-14 15:19:31,617 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:19:31,617 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:19:31,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-14 15:19:32,602 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:19:32,786 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:19:32,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-14 15:19:32,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/342a9066d/2da343788137428a99305c5c31a26664/FLAGdc864edf3 [2024-06-14 15:19:32,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/342a9066d/2da343788137428a99305c5c31a26664 [2024-06-14 15:19:32,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:19:32,819 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:19:32,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:19:32,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:19:32,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:19:32,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:19:31" (1/2) ... [2024-06-14 15:19:32,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22a5b4ca and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:32, skipping insertion in model container [2024-06-14 15:19:32,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:19:31" (1/2) ... [2024-06-14 15:19:32,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6855d7b3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:32, skipping insertion in model container [2024-06-14 15:19:32,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:19:32" (2/2) ... [2024-06-14 15:19:32,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22a5b4ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:19:32, skipping insertion in model container [2024-06-14 15:19:32,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:19:32" (2/2) ... [2024-06-14 15:19:32,831 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:19:32,883 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:19:32,884 INFO L97 edCorrectnessWitness]: Location invariant before [L806-L806] ((((((((((((((((! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 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) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$read_delayed >= 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 )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 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_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 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_thd1 >= 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_thd1 >= 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 )z >= 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_thd1 >= 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_thd1 >= 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 )z >= 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_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 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$r_buff1_thd2 + (long long )z >= 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$read_delayed + (long long )z >= 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_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd0 >= 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_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)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) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 15:19:32,885 INFO L97 edCorrectnessWitness]: Location invariant before [L805-L805] ((((((((((((((((! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 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) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$read_delayed >= 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 )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 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_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 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_thd1 >= 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_thd1 >= 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 )z >= 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_thd1 >= 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_thd1 >= 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 )z >= 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_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 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$r_buff1_thd2 + (long long )z >= 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$read_delayed + (long long )z >= 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_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd0 >= 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_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)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) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 15:19:32,885 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:19:32,885 INFO L106 edCorrectnessWitness]: ghost_update [L803-L803] multithreaded = 1; [2024-06-14 15:19:32,923 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:19:33,203 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:19:33,210 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 15:19:33,442 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:19:33,481 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:19:33,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:19:33 WrapperNode [2024-06-14 15:19:33,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:19:33,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:19:33,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:19:33,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:19:33,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:19:33" (1/1) ... [2024-06-14 15:19:33,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:19:33" (1/1) ... [2024-06-14 15:19:33,609 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 139 [2024-06-14 15:19:33,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:19:33,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:19:33,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:19:33,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:19:33,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:19:33" (1/1) ... [2024-06-14 15:19:33,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:19:33" (1/1) ... [2024-06-14 15:19:33,639 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:19:33" (1/1) ... [2024-06-14 15:19:33,666 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-14 15:19:33,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:19:33" (1/1) ... [2024-06-14 15:19:33,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:19:33" (1/1) ... [2024-06-14 15:19:33,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:19:33" (1/1) ... [2024-06-14 15:19:33,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:19:33" (1/1) ... [2024-06-14 15:19:33,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:19:33" (1/1) ... [2024-06-14 15:19:33,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:19:33" (1/1) ... [2024-06-14 15:19:33,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:19:33,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:19:33,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:19:33,716 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:19:33,717 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:19:33" (1/1) ... [2024-06-14 15:19:33,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:19:33,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:19:33,743 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-14 15:19:33,763 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-14 15:19:33,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:19:33,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:19:33,774 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:19:33,774 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:19:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:19:33,775 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:19:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:19:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:19:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:19:33,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:19:33,777 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 15:19:33,884 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:19:33,885 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:19:34,495 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:19:34,495 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:19:34,698 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:19:34,698 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:19:34,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:19:34 BoogieIcfgContainer [2024-06-14 15:19:34,700 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:19:34,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:19:34,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:19:34,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:19:34,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:19:31" (1/4) ... [2024-06-14 15:19:34,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b25de57 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:19:34, skipping insertion in model container [2024-06-14 15:19:34,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:19:32" (2/4) ... [2024-06-14 15:19:34,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b25de57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:19:34, skipping insertion in model container [2024-06-14 15:19:34,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:19:33" (3/4) ... [2024-06-14 15:19:34,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b25de57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:19:34, skipping insertion in model container [2024-06-14 15:19:34,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:19:34" (4/4) ... [2024-06-14 15:19:34,712 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-14 15:19:34,725 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:19:34,726 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 15:19:34,726 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:19:34,798 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:19:34,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 72 flow [2024-06-14 15:19:34,850 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-06-14 15:19:34,850 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:19:34,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 15:19:34,852 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 72 flow [2024-06-14 15:19:34,854 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 54 flow [2024-06-14 15:19:34,860 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:19:34,895 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;@7aee7606, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:19:34,895 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 15:19:34,902 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:19:34,903 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 15:19:34,903 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:19:34,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:34,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:19:34,904 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-14 15:19:34,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:34,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1639526218, now seen corresponding path program 1 times [2024-06-14 15:19:34,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:34,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008993393] [2024-06-14 15:19:34,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:34,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:19:38,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:38,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008993393] [2024-06-14 15:19:38,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008993393] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:38,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:38,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:19:38,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395486835] [2024-06-14 15:19:38,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:38,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:19:38,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:38,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:19:38,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:19:38,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:19:38,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:19:38,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:38,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:19:38,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:39,061 INFO L124 PetriNetUnfolderBase]: 162/321 cut-off events. [2024-06-14 15:19:39,061 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-14 15:19:39,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 321 events. 162/321 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1193 event pairs, 97 based on Foata normal form. 1/310 useless extension candidates. Maximal degree in co-relation 620. Up to 288 conditions per place. [2024-06-14 15:19:39,067 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 23 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-14 15:19:39,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 121 flow [2024-06-14 15:19:39,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:19:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:19:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-06-14 15:19:39,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-06-14 15:19:39,081 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 52 transitions. [2024-06-14 15:19:39,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 121 flow [2024-06-14 15:19:39,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 15:19:39,084 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 73 flow [2024-06-14 15:19:39,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-06-14 15:19:39,089 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-14 15:19:39,090 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 73 flow [2024-06-14 15:19:39,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:19:39,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:39,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:19:39,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:19:39,093 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-14 15:19:39,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:39,095 INFO L85 PathProgramCache]: Analyzing trace with hash -668275543, now seen corresponding path program 1 times [2024-06-14 15:19:39,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:39,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796177229] [2024-06-14 15:19:39,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:39,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:19:41,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:41,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796177229] [2024-06-14 15:19:41,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796177229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:41,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:41,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:19:41,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255872499] [2024-06-14 15:19:41,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:41,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:19:41,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:41,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:19:41,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:19:41,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:19:41,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:19:41,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:41,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:19:41,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:42,093 INFO L124 PetriNetUnfolderBase]: 186/349 cut-off events. [2024-06-14 15:19:42,093 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-06-14 15:19:42,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 349 events. 186/349 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1264 event pairs, 94 based on Foata normal form. 2/344 useless extension candidates. Maximal degree in co-relation 778. Up to 319 conditions per place. [2024-06-14 15:19:42,099 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 28 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-14 15:19:42,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 165 flow [2024-06-14 15:19:42,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:19:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:19:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2024-06-14 15:19:42,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4921875 [2024-06-14 15:19:42,103 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 73 flow. Second operand 4 states and 63 transitions. [2024-06-14 15:19:42,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 165 flow [2024-06-14 15:19:42,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 162 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:19:42,107 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 97 flow [2024-06-14 15:19:42,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-14 15:19:42,108 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-14 15:19:42,108 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 97 flow [2024-06-14 15:19:42,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:19:42,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:42,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:19:42,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:19:42,110 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-14 15:19:42,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:42,114 INFO L85 PathProgramCache]: Analyzing trace with hash 758295539, now seen corresponding path program 1 times [2024-06-14 15:19:42,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:42,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621715802] [2024-06-14 15:19:42,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:42,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:19:44,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:44,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621715802] [2024-06-14 15:19:44,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621715802] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:44,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:44,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:19:44,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989487346] [2024-06-14 15:19:44,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:44,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 15:19:44,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:44,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 15:19:44,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 15:19:44,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:19:44,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:19:44,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:44,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:19:44,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:44,700 INFO L124 PetriNetUnfolderBase]: 180/341 cut-off events. [2024-06-14 15:19:44,701 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2024-06-14 15:19:44,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 341 events. 180/341 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1220 event pairs, 52 based on Foata normal form. 4/340 useless extension candidates. Maximal degree in co-relation 836. Up to 291 conditions per place. [2024-06-14 15:19:44,703 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 33 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-14 15:19:44,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 217 flow [2024-06-14 15:19:44,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:19:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:19:44,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2024-06-14 15:19:44,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48125 [2024-06-14 15:19:44,707 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 97 flow. Second operand 5 states and 77 transitions. [2024-06-14 15:19:44,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 217 flow [2024-06-14 15:19:44,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 208 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 15:19:44,710 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 121 flow [2024-06-14 15:19:44,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-06-14 15:19:44,711 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-06-14 15:19:44,712 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 121 flow [2024-06-14 15:19:44,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:19:44,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:44,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:19:44,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:19:44,712 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-14 15:19:44,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:44,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1422397774, now seen corresponding path program 1 times [2024-06-14 15:19:44,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:44,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103506150] [2024-06-14 15:19:44,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:44,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:47,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:19:47,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:47,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103506150] [2024-06-14 15:19:47,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103506150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:47,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:47,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:19:47,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654066539] [2024-06-14 15:19:47,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:47,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:19:47,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:47,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:19:47,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:19:47,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:19:47,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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-14 15:19:47,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:47,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:19:47,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:47,901 INFO L124 PetriNetUnfolderBase]: 176/331 cut-off events. [2024-06-14 15:19:47,902 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2024-06-14 15:19:47,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 331 events. 176/331 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1158 event pairs, 30 based on Foata normal form. 4/328 useless extension candidates. Maximal degree in co-relation 885. Up to 265 conditions per place. [2024-06-14 15:19:47,906 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 33 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2024-06-14 15:19:47,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 231 flow [2024-06-14 15:19:47,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:19:47,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:19:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2024-06-14 15:19:47,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4427083333333333 [2024-06-14 15:19:47,910 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 121 flow. Second operand 6 states and 85 transitions. [2024-06-14 15:19:47,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 231 flow [2024-06-14 15:19:47,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 216 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 15:19:47,913 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 118 flow [2024-06-14 15:19:47,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2024-06-14 15:19:47,915 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-06-14 15:19:47,915 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 118 flow [2024-06-14 15:19:47,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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-14 15:19:47,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:47,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:19:47,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:19:47,916 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:19:47,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:47,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1867651097, now seen corresponding path program 1 times [2024-06-14 15:19:47,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:47,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157009912] [2024-06-14 15:19:47,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:47,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:52,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:19:52,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:52,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157009912] [2024-06-14 15:19:52,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157009912] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:52,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:52,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:19:52,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962416182] [2024-06-14 15:19:52,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:52,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:19:52,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:52,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:19:52,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:19:52,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:19:52,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 118 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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-14 15:19:52,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:52,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:19:52,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:52,946 INFO L124 PetriNetUnfolderBase]: 147/295 cut-off events. [2024-06-14 15:19:52,946 INFO L125 PetriNetUnfolderBase]: For 377/377 co-relation queries the response was YES. [2024-06-14 15:19:52,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 295 events. 147/295 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1057 event pairs, 53 based on Foata normal form. 1/289 useless extension candidates. Maximal degree in co-relation 804. Up to 259 conditions per place. [2024-06-14 15:19:52,948 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 26 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2024-06-14 15:19:52,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 200 flow [2024-06-14 15:19:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:19:52,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:19:52,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2024-06-14 15:19:52,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 15:19:52,949 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 118 flow. Second operand 5 states and 64 transitions. [2024-06-14 15:19:52,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 200 flow [2024-06-14 15:19:52,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 180 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 15:19:52,954 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 125 flow [2024-06-14 15:19:52,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2024-06-14 15:19:52,958 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2024-06-14 15:19:52,958 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 125 flow [2024-06-14 15:19:52,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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-14 15:19:52,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:52,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:19:52,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:19:52,963 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-14 15:19:52,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:52,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2062607691, now seen corresponding path program 1 times [2024-06-14 15:19:52,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:52,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196056270] [2024-06-14 15:19:52,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:52,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:19:58,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-14 15:19:58,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:19:58,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196056270] [2024-06-14 15:19:58,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196056270] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:19:58,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:19:58,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:19:58,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272291500] [2024-06-14 15:19:58,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:19:58,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:19:58,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:19:58,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:19:58,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:19:58,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:19:58,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 125 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:19:58,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:19:58,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:19:58,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:19:58,285 INFO L124 PetriNetUnfolderBase]: 172/330 cut-off events. [2024-06-14 15:19:58,285 INFO L125 PetriNetUnfolderBase]: For 581/581 co-relation queries the response was YES. [2024-06-14 15:19:58,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 330 events. 172/330 cut-off events. For 581/581 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1172 event pairs, 64 based on Foata normal form. 1/330 useless extension candidates. Maximal degree in co-relation 953. Up to 298 conditions per place. [2024-06-14 15:19:58,287 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 28 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2024-06-14 15:19:58,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 219 flow [2024-06-14 15:19:58,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:19:58,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:19:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2024-06-14 15:19:58,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-14 15:19:58,288 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 125 flow. Second operand 6 states and 69 transitions. [2024-06-14 15:19:58,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 219 flow [2024-06-14 15:19:58,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 208 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 15:19:58,290 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 147 flow [2024-06-14 15:19:58,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2024-06-14 15:19:58,291 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2024-06-14 15:19:58,291 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 147 flow [2024-06-14 15:19:58,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:19:58,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:19:58,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:19:58,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:19:58,291 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-14 15:19:58,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:19:58,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1868618978, now seen corresponding path program 1 times [2024-06-14 15:19:58,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:19:58,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737758915] [2024-06-14 15:19:58,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:19:58,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:19:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:03,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:20:03,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:03,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737758915] [2024-06-14 15:20:03,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737758915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:03,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:03,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:20:03,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143682258] [2024-06-14 15:20:03,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:03,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:20:03,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:03,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:20:03,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:20:03,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:20:03,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 147 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:03,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:03,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:20:03,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:03,429 INFO L124 PetriNetUnfolderBase]: 188/349 cut-off events. [2024-06-14 15:20:03,429 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2024-06-14 15:20:03,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 349 events. 188/349 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1225 event pairs, 71 based on Foata normal form. 1/349 useless extension candidates. Maximal degree in co-relation 1111. Up to 311 conditions per place. [2024-06-14 15:20:03,431 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 32 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2024-06-14 15:20:03,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 257 flow [2024-06-14 15:20:03,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:20:03,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:20:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2024-06-14 15:20:03,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:20:03,433 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 147 flow. Second operand 6 states and 72 transitions. [2024-06-14 15:20:03,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 257 flow [2024-06-14 15:20:03,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 240 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 15:20:03,435 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 163 flow [2024-06-14 15:20:03,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2024-06-14 15:20:03,435 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2024-06-14 15:20:03,435 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 163 flow [2024-06-14 15:20:03,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:03,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:03,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:03,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:20:03,436 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-14 15:20:03,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:03,437 INFO L85 PathProgramCache]: Analyzing trace with hash 705309622, now seen corresponding path program 2 times [2024-06-14 15:20:03,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:03,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693048894] [2024-06-14 15:20:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:03,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:20:08,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:08,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693048894] [2024-06-14 15:20:08,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693048894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:08,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:08,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:20:08,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655962193] [2024-06-14 15:20:08,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:08,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:20:08,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:08,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:20:08,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:20:08,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:20:08,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 163 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:08,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:08,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:20:08,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:08,405 INFO L124 PetriNetUnfolderBase]: 186/347 cut-off events. [2024-06-14 15:20:08,405 INFO L125 PetriNetUnfolderBase]: For 1247/1250 co-relation queries the response was YES. [2024-06-14 15:20:08,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 347 events. 186/347 cut-off events. For 1247/1250 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1234 event pairs, 75 based on Foata normal form. 3/348 useless extension candidates. Maximal degree in co-relation 1174. Up to 302 conditions per place. [2024-06-14 15:20:08,408 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 28 selfloop transitions, 11 changer transitions 0/43 dead transitions. [2024-06-14 15:20:08,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 267 flow [2024-06-14 15:20:08,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:20:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:20:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2024-06-14 15:20:08,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3697916666666667 [2024-06-14 15:20:08,409 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 163 flow. Second operand 6 states and 71 transitions. [2024-06-14 15:20:08,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 267 flow [2024-06-14 15:20:08,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 43 transitions, 250 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 15:20:08,412 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 189 flow [2024-06-14 15:20:08,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=189, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2024-06-14 15:20:08,413 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2024-06-14 15:20:08,414 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 189 flow [2024-06-14 15:20:08,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:08,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:08,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:08,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:20:08,414 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-14 15:20:08,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:08,415 INFO L85 PathProgramCache]: Analyzing trace with hash 483672518, now seen corresponding path program 1 times [2024-06-14 15:20:08,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:08,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345639950] [2024-06-14 15:20:08,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:08,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:13,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-14 15:20:13,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:13,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345639950] [2024-06-14 15:20:13,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345639950] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:13,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:13,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:20:13,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145240321] [2024-06-14 15:20:13,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:13,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:20:13,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:13,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:20:13,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:20:13,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:20:13,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 189 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-14 15:20:13,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:13,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:20:13,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:13,525 INFO L124 PetriNetUnfolderBase]: 171/324 cut-off events. [2024-06-14 15:20:13,525 INFO L125 PetriNetUnfolderBase]: For 1225/1225 co-relation queries the response was YES. [2024-06-14 15:20:13,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 324 events. 171/324 cut-off events. For 1225/1225 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1138 event pairs, 62 based on Foata normal form. 1/324 useless extension candidates. Maximal degree in co-relation 1134. Up to 294 conditions per place. [2024-06-14 15:20:13,527 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 33 selfloop transitions, 10 changer transitions 0/46 dead transitions. [2024-06-14 15:20:13,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 46 transitions, 301 flow [2024-06-14 15:20:13,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:20:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:20:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2024-06-14 15:20:13,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2024-06-14 15:20:13,528 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 189 flow. Second operand 7 states and 78 transitions. [2024-06-14 15:20:13,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 46 transitions, 301 flow [2024-06-14 15:20:13,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 46 transitions, 274 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-14 15:20:13,534 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 201 flow [2024-06-14 15:20:13,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=201, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2024-06-14 15:20:13,534 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2024-06-14 15:20:13,535 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 201 flow [2024-06-14 15:20:13,535 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-14 15:20:13,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:13,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:13,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:20:13,535 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-14 15:20:13,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:13,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1931449946, now seen corresponding path program 1 times [2024-06-14 15:20:13,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:13,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082911893] [2024-06-14 15:20:13,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:13,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:18,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:20:18,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:18,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082911893] [2024-06-14 15:20:18,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082911893] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:18,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:18,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:20:18,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418065833] [2024-06-14 15:20:18,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:18,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:20:18,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:18,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:20:18,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:20:18,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:20:18,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 201 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-14 15:20:18,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:18,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:20:18,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:18,825 INFO L124 PetriNetUnfolderBase]: 188/350 cut-off events. [2024-06-14 15:20:18,825 INFO L125 PetriNetUnfolderBase]: For 1837/1837 co-relation queries the response was YES. [2024-06-14 15:20:18,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 350 events. 188/350 cut-off events. For 1837/1837 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1226 event pairs, 49 based on Foata normal form. 2/351 useless extension candidates. Maximal degree in co-relation 1306. Up to 291 conditions per place. [2024-06-14 15:20:18,827 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 45 selfloop transitions, 12 changer transitions 0/61 dead transitions. [2024-06-14 15:20:18,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 377 flow [2024-06-14 15:20:18,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:20:18,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:20:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-14 15:20:18,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37890625 [2024-06-14 15:20:18,829 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 201 flow. Second operand 8 states and 97 transitions. [2024-06-14 15:20:18,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 377 flow [2024-06-14 15:20:18,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 354 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:20:18,831 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 234 flow [2024-06-14 15:20:18,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=234, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-06-14 15:20:18,832 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2024-06-14 15:20:18,832 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 234 flow [2024-06-14 15:20:18,832 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-14 15:20:18,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:18,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:18,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:20:18,833 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-14 15:20:18,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2102272532, now seen corresponding path program 1 times [2024-06-14 15:20:18,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:18,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414043049] [2024-06-14 15:20:18,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:18,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:23,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:20:23,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:23,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414043049] [2024-06-14 15:20:23,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414043049] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:23,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:23,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:20:23,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751783773] [2024-06-14 15:20:23,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:23,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:20:23,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:23,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:20:23,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:20:23,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:20:23,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 234 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:23,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:23,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:20:23,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:23,853 INFO L124 PetriNetUnfolderBase]: 205/369 cut-off events. [2024-06-14 15:20:23,853 INFO L125 PetriNetUnfolderBase]: For 2148/2148 co-relation queries the response was YES. [2024-06-14 15:20:23,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 369 events. 205/369 cut-off events. For 2148/2148 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1254 event pairs, 50 based on Foata normal form. 1/369 useless extension candidates. Maximal degree in co-relation 1486. Up to 345 conditions per place. [2024-06-14 15:20:23,856 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 43 selfloop transitions, 10 changer transitions 0/55 dead transitions. [2024-06-14 15:20:23,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 55 transitions, 376 flow [2024-06-14 15:20:23,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:20:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:20:23,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2024-06-14 15:20:23,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33482142857142855 [2024-06-14 15:20:23,857 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 234 flow. Second operand 7 states and 75 transitions. [2024-06-14 15:20:23,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 55 transitions, 376 flow [2024-06-14 15:20:23,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 349 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 15:20:23,859 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 248 flow [2024-06-14 15:20:23,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-06-14 15:20:23,860 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2024-06-14 15:20:23,860 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 248 flow [2024-06-14 15:20:23,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:23,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:23,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:23,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:20:23,862 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-14 15:20:23,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:23,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1931569916, now seen corresponding path program 2 times [2024-06-14 15:20:23,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:23,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831447879] [2024-06-14 15:20:23,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:23,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:20:28,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:28,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831447879] [2024-06-14 15:20:28,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831447879] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:28,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:28,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:20:28,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101790541] [2024-06-14 15:20:28,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:28,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:20:28,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:28,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:20:28,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:20:28,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:20:28,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 248 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-14 15:20:28,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:28,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:20:28,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:29,254 INFO L124 PetriNetUnfolderBase]: 204/375 cut-off events. [2024-06-14 15:20:29,254 INFO L125 PetriNetUnfolderBase]: For 2777/2777 co-relation queries the response was YES. [2024-06-14 15:20:29,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1607 conditions, 375 events. 204/375 cut-off events. For 2777/2777 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1312 event pairs, 48 based on Foata normal form. 2/376 useless extension candidates. Maximal degree in co-relation 1579. Up to 301 conditions per place. [2024-06-14 15:20:29,256 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 44 selfloop transitions, 17 changer transitions 0/66 dead transitions. [2024-06-14 15:20:29,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 468 flow [2024-06-14 15:20:29,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:20:29,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:20:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-14 15:20:29,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3828125 [2024-06-14 15:20:29,258 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 248 flow. Second operand 8 states and 98 transitions. [2024-06-14 15:20:29,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 468 flow [2024-06-14 15:20:29,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 66 transitions, 443 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 15:20:29,260 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 298 flow [2024-06-14 15:20:29,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=298, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2024-06-14 15:20:29,261 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 29 predicate places. [2024-06-14 15:20:29,261 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 298 flow [2024-06-14 15:20:29,261 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-14 15:20:29,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:29,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:29,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:20:29,262 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-14 15:20:29,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:29,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2108938772, now seen corresponding path program 2 times [2024-06-14 15:20:29,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:29,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331828989] [2024-06-14 15:20:29,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:29,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:33,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-14 15:20:33,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:33,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331828989] [2024-06-14 15:20:33,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331828989] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:33,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:33,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:20:33,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784701555] [2024-06-14 15:20:33,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:33,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:20:33,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:33,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:20:33,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:20:34,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:20:34,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 298 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:34,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:34,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:20:34,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:34,266 INFO L124 PetriNetUnfolderBase]: 219/393 cut-off events. [2024-06-14 15:20:34,267 INFO L125 PetriNetUnfolderBase]: For 3279/3282 co-relation queries the response was YES. [2024-06-14 15:20:34,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1774 conditions, 393 events. 219/393 cut-off events. For 3279/3282 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1365 event pairs, 55 based on Foata normal form. 3/394 useless extension candidates. Maximal degree in co-relation 1745. Up to 352 conditions per place. [2024-06-14 15:20:34,271 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 41 selfloop transitions, 18 changer transitions 0/61 dead transitions. [2024-06-14 15:20:34,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 490 flow [2024-06-14 15:20:34,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:20:34,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:20:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2024-06-14 15:20:34,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3392857142857143 [2024-06-14 15:20:34,273 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 298 flow. Second operand 7 states and 76 transitions. [2024-06-14 15:20:34,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 490 flow [2024-06-14 15:20:34,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 466 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-14 15:20:34,278 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 351 flow [2024-06-14 15:20:34,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=351, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2024-06-14 15:20:34,279 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 32 predicate places. [2024-06-14 15:20:34,279 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 351 flow [2024-06-14 15:20:34,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:34,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:34,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:34,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:20:34,280 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-14 15:20:34,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:34,280 INFO L85 PathProgramCache]: Analyzing trace with hash 389763084, now seen corresponding path program 3 times [2024-06-14 15:20:34,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:34,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409521970] [2024-06-14 15:20:34,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:34,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:39,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:20:39,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:39,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409521970] [2024-06-14 15:20:39,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409521970] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:39,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:39,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:20:39,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255620761] [2024-06-14 15:20:39,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:39,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:20:39,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:39,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:20:39,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:20:39,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:20:39,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 351 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-14 15:20:39,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:39,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:20:39,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:39,775 INFO L124 PetriNetUnfolderBase]: 202/374 cut-off events. [2024-06-14 15:20:39,776 INFO L125 PetriNetUnfolderBase]: For 3747/3750 co-relation queries the response was YES. [2024-06-14 15:20:39,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1745 conditions, 374 events. 202/374 cut-off events. For 3747/3750 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1341 event pairs, 50 based on Foata normal form. 4/376 useless extension candidates. Maximal degree in co-relation 1714. Up to 285 conditions per place. [2024-06-14 15:20:39,778 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 41 selfloop transitions, 21 changer transitions 0/69 dead transitions. [2024-06-14 15:20:39,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 557 flow [2024-06-14 15:20:39,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:20:39,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:20:39,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-14 15:20:39,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37890625 [2024-06-14 15:20:39,780 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 351 flow. Second operand 8 states and 97 transitions. [2024-06-14 15:20:39,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 557 flow [2024-06-14 15:20:39,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 69 transitions, 532 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-14 15:20:39,783 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 397 flow [2024-06-14 15:20:39,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=397, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2024-06-14 15:20:39,784 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 37 predicate places. [2024-06-14 15:20:39,784 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 397 flow [2024-06-14 15:20:39,785 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-14 15:20:39,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:39,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:39,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:20:39,785 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-14 15:20:39,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:39,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2108701622, now seen corresponding path program 3 times [2024-06-14 15:20:39,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:39,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366697340] [2024-06-14 15:20:39,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:39,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:44,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-14 15:20:44,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:44,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366697340] [2024-06-14 15:20:44,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366697340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:44,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:44,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:20:44,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690817761] [2024-06-14 15:20:44,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:44,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:20:44,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:44,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:20:44,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:20:44,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:20:44,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 397 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:44,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:44,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:20:44,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:44,872 INFO L124 PetriNetUnfolderBase]: 213/384 cut-off events. [2024-06-14 15:20:44,872 INFO L125 PetriNetUnfolderBase]: For 4071/4074 co-relation queries the response was YES. [2024-06-14 15:20:44,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 384 events. 213/384 cut-off events. For 4071/4074 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1339 event pairs, 54 based on Foata normal form. 3/385 useless extension candidates. Maximal degree in co-relation 1843. Up to 344 conditions per place. [2024-06-14 15:20:44,874 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 43 selfloop transitions, 17 changer transitions 0/62 dead transitions. [2024-06-14 15:20:44,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 62 transitions, 533 flow [2024-06-14 15:20:44,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:20:44,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:20:44,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2024-06-14 15:20:44,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3392857142857143 [2024-06-14 15:20:44,875 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 397 flow. Second operand 7 states and 76 transitions. [2024-06-14 15:20:44,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 62 transitions, 533 flow [2024-06-14 15:20:44,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 62 transitions, 472 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-14 15:20:44,882 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 375 flow [2024-06-14 15:20:44,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=375, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2024-06-14 15:20:44,883 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 38 predicate places. [2024-06-14 15:20:44,884 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 375 flow [2024-06-14 15:20:44,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:44,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:44,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:44,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:20:44,884 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-14 15:20:44,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:44,885 INFO L85 PathProgramCache]: Analyzing trace with hash -404633819, now seen corresponding path program 1 times [2024-06-14 15:20:44,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:44,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464657010] [2024-06-14 15:20:44,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:44,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:49,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-14 15:20:49,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:49,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464657010] [2024-06-14 15:20:49,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464657010] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:49,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:49,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:20:49,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828011295] [2024-06-14 15:20:49,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:49,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:20:49,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:49,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:20:49,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:20:49,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:20:49,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 375 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-14 15:20:49,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:49,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:20:49,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:49,897 INFO L124 PetriNetUnfolderBase]: 221/407 cut-off events. [2024-06-14 15:20:49,897 INFO L125 PetriNetUnfolderBase]: For 4559/4559 co-relation queries the response was YES. [2024-06-14 15:20:49,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1966 conditions, 407 events. 221/407 cut-off events. For 4559/4559 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1501 event pairs, 47 based on Foata normal form. 1/407 useless extension candidates. Maximal degree in co-relation 1932. Up to 347 conditions per place. [2024-06-14 15:20:49,900 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 56 selfloop transitions, 16 changer transitions 0/79 dead transitions. [2024-06-14 15:20:49,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 79 transitions, 633 flow [2024-06-14 15:20:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:20:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:20:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-14 15:20:49,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-14 15:20:49,901 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 375 flow. Second operand 8 states and 94 transitions. [2024-06-14 15:20:49,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 79 transitions, 633 flow [2024-06-14 15:20:49,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 79 transitions, 583 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 15:20:49,905 INFO L231 Difference]: Finished difference. Result has 73 places, 65 transitions, 462 flow [2024-06-14 15:20:49,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=462, PETRI_PLACES=73, PETRI_TRANSITIONS=65} [2024-06-14 15:20:49,906 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 42 predicate places. [2024-06-14 15:20:49,906 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 65 transitions, 462 flow [2024-06-14 15:20:49,906 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-14 15:20:49,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:49,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:49,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:20:49,907 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-14 15:20:49,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:49,907 INFO L85 PathProgramCache]: Analyzing trace with hash -450276355, now seen corresponding path program 2 times [2024-06-14 15:20:49,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:49,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065656534] [2024-06-14 15:20:49,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:49,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:20:54,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:54,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065656534] [2024-06-14 15:20:54,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065656534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:54,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:54,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:20:54,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095900300] [2024-06-14 15:20:54,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:54,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:20:54,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:54,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:20:54,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:20:54,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:20:54,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 65 transitions, 462 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-14 15:20:54,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:54,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:20:54,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:20:55,282 INFO L124 PetriNetUnfolderBase]: 220/405 cut-off events. [2024-06-14 15:20:55,282 INFO L125 PetriNetUnfolderBase]: For 5027/5027 co-relation queries the response was YES. [2024-06-14 15:20:55,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2014 conditions, 405 events. 220/405 cut-off events. For 5027/5027 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1475 event pairs, 47 based on Foata normal form. 1/405 useless extension candidates. Maximal degree in co-relation 1977. Up to 318 conditions per place. [2024-06-14 15:20:55,286 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 49 selfloop transitions, 22 changer transitions 0/78 dead transitions. [2024-06-14 15:20:55,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 78 transitions, 642 flow [2024-06-14 15:20:55,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:20:55,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:20:55,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2024-06-14 15:20:55,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38392857142857145 [2024-06-14 15:20:55,287 INFO L175 Difference]: Start difference. First operand has 73 places, 65 transitions, 462 flow. Second operand 7 states and 86 transitions. [2024-06-14 15:20:55,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 78 transitions, 642 flow [2024-06-14 15:20:55,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 78 transitions, 608 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 15:20:55,292 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 486 flow [2024-06-14 15:20:55,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=486, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2024-06-14 15:20:55,293 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 45 predicate places. [2024-06-14 15:20:55,293 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 486 flow [2024-06-14 15:20:55,293 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-14 15:20:55,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:20:55,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:20:55,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:20:55,293 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-14 15:20:55,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:20:55,294 INFO L85 PathProgramCache]: Analyzing trace with hash -450185990, now seen corresponding path program 1 times [2024-06-14 15:20:55,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:20:55,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270590919] [2024-06-14 15:20:55,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:20:55,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:20:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:20:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:20:59,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:20:59,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270590919] [2024-06-14 15:20:59,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270590919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:20:59,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:20:59,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:20:59,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998321932] [2024-06-14 15:20:59,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:20:59,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:20:59,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:20:59,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:20:59,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:20:59,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:20:59,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 486 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:20:59,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:20:59,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:20:59,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:00,171 INFO L124 PetriNetUnfolderBase]: 238/427 cut-off events. [2024-06-14 15:21:00,171 INFO L125 PetriNetUnfolderBase]: For 5694/5694 co-relation queries the response was YES. [2024-06-14 15:21:00,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2177 conditions, 427 events. 238/427 cut-off events. For 5694/5694 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1542 event pairs, 48 based on Foata normal form. 2/428 useless extension candidates. Maximal degree in co-relation 2139. Up to 354 conditions per place. [2024-06-14 15:21:00,174 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 63 selfloop transitions, 21 changer transitions 0/86 dead transitions. [2024-06-14 15:21:00,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 86 transitions, 728 flow [2024-06-14 15:21:00,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:21:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:21:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-14 15:21:00,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:21:00,176 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 486 flow. Second operand 9 states and 99 transitions. [2024-06-14 15:21:00,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 86 transitions, 728 flow [2024-06-14 15:21:00,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 86 transitions, 676 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 15:21:00,181 INFO L231 Difference]: Finished difference. Result has 79 places, 67 transitions, 504 flow [2024-06-14 15:21:00,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=504, PETRI_PLACES=79, PETRI_TRANSITIONS=67} [2024-06-14 15:21:00,182 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 48 predicate places. [2024-06-14 15:21:00,182 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 67 transitions, 504 flow [2024-06-14 15:21:00,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:00,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:00,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:00,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:21:00,183 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-14 15:21:00,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:00,183 INFO L85 PathProgramCache]: Analyzing trace with hash -446461123, now seen corresponding path program 1 times [2024-06-14 15:21:00,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:00,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389006053] [2024-06-14 15:21:00,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:00,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:05,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:21:05,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:05,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389006053] [2024-06-14 15:21:05,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389006053] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:05,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:05,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:21:05,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851914277] [2024-06-14 15:21:05,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:05,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:21:05,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:05,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:21:05,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:21:05,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:21:05,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 67 transitions, 504 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:05,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:05,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:21:05,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:05,455 INFO L124 PetriNetUnfolderBase]: 241/432 cut-off events. [2024-06-14 15:21:05,456 INFO L125 PetriNetUnfolderBase]: For 5708/5708 co-relation queries the response was YES. [2024-06-14 15:21:05,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2234 conditions, 432 events. 241/432 cut-off events. For 5708/5708 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1564 event pairs, 49 based on Foata normal form. 1/432 useless extension candidates. Maximal degree in co-relation 2195. Up to 400 conditions per place. [2024-06-14 15:21:05,459 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 63 selfloop transitions, 14 changer transitions 0/79 dead transitions. [2024-06-14 15:21:05,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 79 transitions, 698 flow [2024-06-14 15:21:05,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:21:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:21:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2024-06-14 15:21:05,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32421875 [2024-06-14 15:21:05,460 INFO L175 Difference]: Start difference. First operand has 79 places, 67 transitions, 504 flow. Second operand 8 states and 83 transitions. [2024-06-14 15:21:05,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 79 transitions, 698 flow [2024-06-14 15:21:05,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 79 transitions, 646 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 15:21:05,465 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 503 flow [2024-06-14 15:21:05,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=503, PETRI_PLACES=80, PETRI_TRANSITIONS=69} [2024-06-14 15:21:05,466 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 49 predicate places. [2024-06-14 15:21:05,466 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 503 flow [2024-06-14 15:21:05,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:05,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:05,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:05,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:21:05,467 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-14 15:21:05,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:05,468 INFO L85 PathProgramCache]: Analyzing trace with hash -446461340, now seen corresponding path program 2 times [2024-06-14 15:21:05,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:05,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121736321] [2024-06-14 15:21:05,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:05,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:09,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:21:09,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:09,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121736321] [2024-06-14 15:21:09,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121736321] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:09,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:09,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:21:09,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484565846] [2024-06-14 15:21:09,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:09,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:21:09,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:09,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:21:09,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:21:09,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:21:09,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 69 transitions, 503 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:09,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:09,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:21:09,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:10,105 INFO L124 PetriNetUnfolderBase]: 257/458 cut-off events. [2024-06-14 15:21:10,105 INFO L125 PetriNetUnfolderBase]: For 6820/6820 co-relation queries the response was YES. [2024-06-14 15:21:10,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2421 conditions, 458 events. 257/458 cut-off events. For 6820/6820 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1690 event pairs, 43 based on Foata normal form. 2/459 useless extension candidates. Maximal degree in co-relation 2381. Up to 344 conditions per place. [2024-06-14 15:21:10,109 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 56 selfloop transitions, 33 changer transitions 0/91 dead transitions. [2024-06-14 15:21:10,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 91 transitions, 813 flow [2024-06-14 15:21:10,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:21:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:21:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-14 15:21:10,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3506944444444444 [2024-06-14 15:21:10,111 INFO L175 Difference]: Start difference. First operand has 80 places, 69 transitions, 503 flow. Second operand 9 states and 101 transitions. [2024-06-14 15:21:10,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 91 transitions, 813 flow [2024-06-14 15:21:10,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 91 transitions, 778 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 15:21:10,117 INFO L231 Difference]: Finished difference. Result has 83 places, 73 transitions, 587 flow [2024-06-14 15:21:10,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=587, PETRI_PLACES=83, PETRI_TRANSITIONS=73} [2024-06-14 15:21:10,117 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 52 predicate places. [2024-06-14 15:21:10,118 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 73 transitions, 587 flow [2024-06-14 15:21:10,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:10,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:10,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:10,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:21:10,118 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-14 15:21:10,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:10,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1120862850, now seen corresponding path program 3 times [2024-06-14 15:21:10,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:10,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950523857] [2024-06-14 15:21:10,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:10,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:15,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:21:15,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:15,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950523857] [2024-06-14 15:21:15,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950523857] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:15,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:15,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:21:15,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851160265] [2024-06-14 15:21:15,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:15,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:21:15,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:15,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:21:15,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:21:15,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:21:15,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 73 transitions, 587 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:15,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:15,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:21:15,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:15,398 INFO L124 PetriNetUnfolderBase]: 258/460 cut-off events. [2024-06-14 15:21:15,398 INFO L125 PetriNetUnfolderBase]: For 7500/7500 co-relation queries the response was YES. [2024-06-14 15:21:15,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2544 conditions, 460 events. 258/460 cut-off events. For 7500/7500 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1690 event pairs, 49 based on Foata normal form. 2/461 useless extension candidates. Maximal degree in co-relation 2503. Up to 347 conditions per place. [2024-06-14 15:21:15,402 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 60 selfloop transitions, 31 changer transitions 0/93 dead transitions. [2024-06-14 15:21:15,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 93 transitions, 885 flow [2024-06-14 15:21:15,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:21:15,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:21:15,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-14 15:21:15,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2024-06-14 15:21:15,403 INFO L175 Difference]: Start difference. First operand has 83 places, 73 transitions, 587 flow. Second operand 9 states and 102 transitions. [2024-06-14 15:21:15,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 93 transitions, 885 flow [2024-06-14 15:21:15,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 93 transitions, 828 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-14 15:21:15,410 INFO L231 Difference]: Finished difference. Result has 87 places, 75 transitions, 623 flow [2024-06-14 15:21:15,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=623, PETRI_PLACES=87, PETRI_TRANSITIONS=75} [2024-06-14 15:21:15,411 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 56 predicate places. [2024-06-14 15:21:15,411 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 75 transitions, 623 flow [2024-06-14 15:21:15,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:15,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:15,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:15,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 15:21:15,412 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-14 15:21:15,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:15,412 INFO L85 PathProgramCache]: Analyzing trace with hash 952593991, now seen corresponding path program 2 times [2024-06-14 15:21:15,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:15,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805273381] [2024-06-14 15:21:15,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:15,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:20,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:21:20,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:20,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805273381] [2024-06-14 15:21:20,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805273381] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:20,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:20,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:21:20,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32936466] [2024-06-14 15:21:20,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:20,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:21:20,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:20,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:21:20,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:21:20,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:21:20,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 75 transitions, 623 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:20,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:20,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:21:20,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:20,983 INFO L124 PetriNetUnfolderBase]: 266/474 cut-off events. [2024-06-14 15:21:20,983 INFO L125 PetriNetUnfolderBase]: For 8274/8277 co-relation queries the response was YES. [2024-06-14 15:21:20,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2692 conditions, 474 events. 266/474 cut-off events. For 8274/8277 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1746 event pairs, 55 based on Foata normal form. 3/474 useless extension candidates. Maximal degree in co-relation 2649. Up to 412 conditions per place. [2024-06-14 15:21:20,987 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 64 selfloop transitions, 26 changer transitions 0/92 dead transitions. [2024-06-14 15:21:20,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 92 transitions, 965 flow [2024-06-14 15:21:20,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:21:20,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:21:20,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-14 15:21:20,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33984375 [2024-06-14 15:21:20,988 INFO L175 Difference]: Start difference. First operand has 87 places, 75 transitions, 623 flow. Second operand 8 states and 87 transitions. [2024-06-14 15:21:20,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 92 transitions, 965 flow [2024-06-14 15:21:20,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 92 transitions, 907 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-14 15:21:20,997 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 697 flow [2024-06-14 15:21:20,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=697, PETRI_PLACES=90, PETRI_TRANSITIONS=82} [2024-06-14 15:21:20,999 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 59 predicate places. [2024-06-14 15:21:20,999 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 697 flow [2024-06-14 15:21:20,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:20,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:20,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:20,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 15:21:20,999 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-14 15:21:21,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:21,000 INFO L85 PathProgramCache]: Analyzing trace with hash 952593774, now seen corresponding path program 4 times [2024-06-14 15:21:21,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:21,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690539837] [2024-06-14 15:21:21,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:21,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:21:25,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:25,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690539837] [2024-06-14 15:21:25,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690539837] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:25,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:25,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:21:25,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162958894] [2024-06-14 15:21:25,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:25,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:21:25,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:25,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:21:25,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:21:26,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:21:26,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 697 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:26,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:26,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:21:26,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:26,312 INFO L124 PetriNetUnfolderBase]: 272/484 cut-off events. [2024-06-14 15:21:26,313 INFO L125 PetriNetUnfolderBase]: For 9342/9345 co-relation queries the response was YES. [2024-06-14 15:21:26,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2805 conditions, 484 events. 272/484 cut-off events. For 9342/9345 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1825 event pairs, 45 based on Foata normal form. 4/485 useless extension candidates. Maximal degree in co-relation 2760. Up to 330 conditions per place. [2024-06-14 15:21:26,316 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 54 selfloop transitions, 46 changer transitions 0/102 dead transitions. [2024-06-14 15:21:26,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 102 transitions, 1037 flow [2024-06-14 15:21:26,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:21:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:21:26,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-14 15:21:26,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3506944444444444 [2024-06-14 15:21:26,325 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 697 flow. Second operand 9 states and 101 transitions. [2024-06-14 15:21:26,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 102 transitions, 1037 flow [2024-06-14 15:21:26,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 102 transitions, 1007 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-14 15:21:26,336 INFO L231 Difference]: Finished difference. Result has 96 places, 86 transitions, 820 flow [2024-06-14 15:21:26,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=820, PETRI_PLACES=96, PETRI_TRANSITIONS=86} [2024-06-14 15:21:26,337 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 65 predicate places. [2024-06-14 15:21:26,337 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 86 transitions, 820 flow [2024-06-14 15:21:26,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:26,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:26,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:26,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 15:21:26,337 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-14 15:21:26,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:26,337 INFO L85 PathProgramCache]: Analyzing trace with hash 945236544, now seen corresponding path program 5 times [2024-06-14 15:21:26,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:26,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061800469] [2024-06-14 15:21:26,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:26,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:31,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:21:31,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:31,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061800469] [2024-06-14 15:21:31,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061800469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:31,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:31,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:21:31,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374478994] [2024-06-14 15:21:31,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:31,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:21:31,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:31,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:21:31,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:21:31,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:21:31,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 86 transitions, 820 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:31,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:31,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:21:31,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:31,750 INFO L124 PetriNetUnfolderBase]: 278/494 cut-off events. [2024-06-14 15:21:31,751 INFO L125 PetriNetUnfolderBase]: For 10429/10432 co-relation queries the response was YES. [2024-06-14 15:21:31,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3029 conditions, 494 events. 278/494 cut-off events. For 10429/10432 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1865 event pairs, 54 based on Foata normal form. 4/495 useless extension candidates. Maximal degree in co-relation 2982. Up to 336 conditions per place. [2024-06-14 15:21:31,754 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 60 selfloop transitions, 43 changer transitions 0/105 dead transitions. [2024-06-14 15:21:31,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 105 transitions, 1192 flow [2024-06-14 15:21:31,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:21:31,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:21:31,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-14 15:21:31,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3576388888888889 [2024-06-14 15:21:31,756 INFO L175 Difference]: Start difference. First operand has 96 places, 86 transitions, 820 flow. Second operand 9 states and 103 transitions. [2024-06-14 15:21:31,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 105 transitions, 1192 flow [2024-06-14 15:21:31,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 105 transitions, 1121 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-14 15:21:31,767 INFO L231 Difference]: Finished difference. Result has 100 places, 88 transitions, 870 flow [2024-06-14 15:21:31,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=870, PETRI_PLACES=100, PETRI_TRANSITIONS=88} [2024-06-14 15:21:31,768 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 69 predicate places. [2024-06-14 15:21:31,768 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 88 transitions, 870 flow [2024-06-14 15:21:31,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:31,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:31,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:31,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 15:21:31,768 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-14 15:21:31,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:31,769 INFO L85 PathProgramCache]: Analyzing trace with hash 952860901, now seen corresponding path program 3 times [2024-06-14 15:21:31,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:31,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535138712] [2024-06-14 15:21:31,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:31,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:21:37,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:37,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535138712] [2024-06-14 15:21:37,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535138712] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:37,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:37,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:21:37,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618685860] [2024-06-14 15:21:37,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:37,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:21:37,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:37,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:21:37,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:21:37,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:21:37,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 88 transitions, 870 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:37,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:37,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:21:37,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:37,331 INFO L124 PetriNetUnfolderBase]: 276/491 cut-off events. [2024-06-14 15:21:37,331 INFO L125 PetriNetUnfolderBase]: For 10615/10618 co-relation queries the response was YES. [2024-06-14 15:21:37,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3062 conditions, 491 events. 276/491 cut-off events. For 10615/10618 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1847 event pairs, 57 based on Foata normal form. 3/491 useless extension candidates. Maximal degree in co-relation 3013. Up to 430 conditions per place. [2024-06-14 15:21:37,335 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 67 selfloop transitions, 28 changer transitions 0/97 dead transitions. [2024-06-14 15:21:37,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 97 transitions, 1128 flow [2024-06-14 15:21:37,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:21:37,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:21:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2024-06-14 15:21:37,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33203125 [2024-06-14 15:21:37,337 INFO L175 Difference]: Start difference. First operand has 100 places, 88 transitions, 870 flow. Second operand 8 states and 85 transitions. [2024-06-14 15:21:37,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 97 transitions, 1128 flow [2024-06-14 15:21:37,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 97 transitions, 998 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-14 15:21:37,351 INFO L231 Difference]: Finished difference. Result has 101 places, 88 transitions, 801 flow [2024-06-14 15:21:37,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=801, PETRI_PLACES=101, PETRI_TRANSITIONS=88} [2024-06-14 15:21:37,351 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 70 predicate places. [2024-06-14 15:21:37,351 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 88 transitions, 801 flow [2024-06-14 15:21:37,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:37,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:37,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:37,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 15:21:37,352 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-14 15:21:37,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:37,353 INFO L85 PathProgramCache]: Analyzing trace with hash -302570810, now seen corresponding path program 6 times [2024-06-14 15:21:37,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:37,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81288433] [2024-06-14 15:21:37,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:37,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:21:41,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:41,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81288433] [2024-06-14 15:21:41,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81288433] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:41,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:41,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:21:41,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239044921] [2024-06-14 15:21:41,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:41,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:21:41,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:41,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:21:41,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:21:42,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:21:42,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 88 transitions, 801 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:42,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:42,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:21:42,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:42,254 INFO L124 PetriNetUnfolderBase]: 272/485 cut-off events. [2024-06-14 15:21:42,255 INFO L125 PetriNetUnfolderBase]: For 10891/10894 co-relation queries the response was YES. [2024-06-14 15:21:42,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2885 conditions, 485 events. 272/485 cut-off events. For 10891/10894 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1813 event pairs, 53 based on Foata normal form. 4/486 useless extension candidates. Maximal degree in co-relation 2836. Up to 330 conditions per place. [2024-06-14 15:21:42,262 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 61 selfloop transitions, 42 changer transitions 0/105 dead transitions. [2024-06-14 15:21:42,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 105 transitions, 1105 flow [2024-06-14 15:21:42,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:21:42,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:21:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-14 15:21:42,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2024-06-14 15:21:42,264 INFO L175 Difference]: Start difference. First operand has 101 places, 88 transitions, 801 flow. Second operand 9 states and 104 transitions. [2024-06-14 15:21:42,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 105 transitions, 1105 flow [2024-06-14 15:21:42,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 105 transitions, 1041 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-14 15:21:42,276 INFO L231 Difference]: Finished difference. Result has 104 places, 88 transitions, 826 flow [2024-06-14 15:21:42,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=826, PETRI_PLACES=104, PETRI_TRANSITIONS=88} [2024-06-14 15:21:42,277 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 73 predicate places. [2024-06-14 15:21:42,277 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 88 transitions, 826 flow [2024-06-14 15:21:42,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:42,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:42,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:42,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 15:21:42,278 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-14 15:21:42,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:42,278 INFO L85 PathProgramCache]: Analyzing trace with hash -302570593, now seen corresponding path program 4 times [2024-06-14 15:21:42,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:42,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727057658] [2024-06-14 15:21:42,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:42,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:47,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:21:47,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:47,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727057658] [2024-06-14 15:21:47,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727057658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:47,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:47,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:21:47,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830947392] [2024-06-14 15:21:47,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:47,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:21:47,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:47,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:21:47,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:21:47,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:21:47,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 88 transitions, 826 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:47,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:47,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:21:47,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:47,842 INFO L124 PetriNetUnfolderBase]: 270/482 cut-off events. [2024-06-14 15:21:47,842 INFO L125 PetriNetUnfolderBase]: For 11185/11188 co-relation queries the response was YES. [2024-06-14 15:21:47,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2911 conditions, 482 events. 270/482 cut-off events. For 11185/11188 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1811 event pairs, 56 based on Foata normal form. 3/482 useless extension candidates. Maximal degree in co-relation 2861. Up to 422 conditions per place. [2024-06-14 15:21:47,845 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 69 selfloop transitions, 26 changer transitions 0/97 dead transitions. [2024-06-14 15:21:47,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 97 transitions, 1044 flow [2024-06-14 15:21:47,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:21:47,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:21:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-14 15:21:47,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3359375 [2024-06-14 15:21:47,846 INFO L175 Difference]: Start difference. First operand has 104 places, 88 transitions, 826 flow. Second operand 8 states and 86 transitions. [2024-06-14 15:21:47,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 97 transitions, 1044 flow [2024-06-14 15:21:47,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 97 transitions, 919 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-14 15:21:47,859 INFO L231 Difference]: Finished difference. Result has 103 places, 89 transitions, 766 flow [2024-06-14 15:21:47,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=766, PETRI_PLACES=103, PETRI_TRANSITIONS=89} [2024-06-14 15:21:47,860 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 72 predicate places. [2024-06-14 15:21:47,860 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 89 transitions, 766 flow [2024-06-14 15:21:47,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:47,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:47,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:47,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 15:21:47,861 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-14 15:21:47,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:47,861 INFO L85 PathProgramCache]: Analyzing trace with hash 952870821, now seen corresponding path program 1 times [2024-06-14 15:21:47,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:47,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394783220] [2024-06-14 15:21:47,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:47,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:53,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:21:53,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:53,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394783220] [2024-06-14 15:21:53,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394783220] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:53,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:53,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:21:53,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099254925] [2024-06-14 15:21:53,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:53,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:21:53,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:53,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:21:53,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:21:53,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:21:53,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 89 transitions, 766 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:53,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:53,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:21:53,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:53,968 INFO L124 PetriNetUnfolderBase]: 268/478 cut-off events. [2024-06-14 15:21:53,968 INFO L125 PetriNetUnfolderBase]: For 11471/11471 co-relation queries the response was YES. [2024-06-14 15:21:53,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2819 conditions, 478 events. 268/478 cut-off events. For 11471/11471 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1776 event pairs, 59 based on Foata normal form. 1/478 useless extension candidates. Maximal degree in co-relation 2768. Up to 453 conditions per place. [2024-06-14 15:21:53,972 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 84 selfloop transitions, 14 changer transitions 0/100 dead transitions. [2024-06-14 15:21:53,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 100 transitions, 996 flow [2024-06-14 15:21:53,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:21:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:21:53,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2024-06-14 15:21:53,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3055555555555556 [2024-06-14 15:21:53,973 INFO L175 Difference]: Start difference. First operand has 103 places, 89 transitions, 766 flow. Second operand 9 states and 88 transitions. [2024-06-14 15:21:53,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 100 transitions, 996 flow [2024-06-14 15:21:53,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 100 transitions, 954 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-14 15:21:53,988 INFO L231 Difference]: Finished difference. Result has 107 places, 91 transitions, 773 flow [2024-06-14 15:21:53,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=773, PETRI_PLACES=107, PETRI_TRANSITIONS=91} [2024-06-14 15:21:53,992 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 76 predicate places. [2024-06-14 15:21:53,993 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 91 transitions, 773 flow [2024-06-14 15:21:53,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:21:53,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:53,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:53,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 15:21:53,993 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:21:53,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:53,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1073724223, now seen corresponding path program 1 times [2024-06-14 15:21:53,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:53,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686144580] [2024-06-14 15:21:53,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:53,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:21:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:21:58,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:21:58,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686144580] [2024-06-14 15:21:58,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686144580] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:21:58,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:21:58,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:21:58,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19397682] [2024-06-14 15:21:58,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:21:58,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:21:58,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:21:58,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:21:58,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:21:59,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:21:59,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 91 transitions, 773 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-14 15:21:59,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:21:59,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:21:59,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:21:59,478 INFO L124 PetriNetUnfolderBase]: 256/470 cut-off events. [2024-06-14 15:21:59,479 INFO L125 PetriNetUnfolderBase]: For 13092/13094 co-relation queries the response was YES. [2024-06-14 15:21:59,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2855 conditions, 470 events. 256/470 cut-off events. For 13092/13094 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1846 event pairs, 30 based on Foata normal form. 2/468 useless extension candidates. Maximal degree in co-relation 2803. Up to 359 conditions per place. [2024-06-14 15:21:59,482 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 77 selfloop transitions, 16 changer transitions 0/107 dead transitions. [2024-06-14 15:21:59,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 107 transitions, 1013 flow [2024-06-14 15:21:59,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:21:59,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:21:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-14 15:21:59,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36328125 [2024-06-14 15:21:59,484 INFO L175 Difference]: Start difference. First operand has 107 places, 91 transitions, 773 flow. Second operand 8 states and 93 transitions. [2024-06-14 15:21:59,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 107 transitions, 1013 flow [2024-06-14 15:21:59,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 107 transitions, 931 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-14 15:21:59,497 INFO L231 Difference]: Finished difference. Result has 105 places, 92 transitions, 743 flow [2024-06-14 15:21:59,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=743, PETRI_PLACES=105, PETRI_TRANSITIONS=92} [2024-06-14 15:21:59,498 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 74 predicate places. [2024-06-14 15:21:59,498 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 92 transitions, 743 flow [2024-06-14 15:21:59,498 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-14 15:21:59,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:21:59,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:21:59,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 15:21:59,498 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-14 15:21:59,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:21:59,499 INFO L85 PathProgramCache]: Analyzing trace with hash -505101123, now seen corresponding path program 2 times [2024-06-14 15:21:59,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:21:59,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697366920] [2024-06-14 15:21:59,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:21:59,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:21:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:22:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:22:04,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:22:04,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697366920] [2024-06-14 15:22:04,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697366920] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:22:04,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:22:04,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:22:04,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334860033] [2024-06-14 15:22:04,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:22:04,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:22:04,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:22:04,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:22:04,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:22:04,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:22:04,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 92 transitions, 743 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-14 15:22:04,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:22:04,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:22:04,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:22:05,083 INFO L124 PetriNetUnfolderBase]: 257/475 cut-off events. [2024-06-14 15:22:05,084 INFO L125 PetriNetUnfolderBase]: For 13632/13632 co-relation queries the response was YES. [2024-06-14 15:22:05,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2863 conditions, 475 events. 257/475 cut-off events. For 13632/13632 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1872 event pairs, 45 based on Foata normal form. 2/476 useless extension candidates. Maximal degree in co-relation 2811. Up to 361 conditions per place. [2024-06-14 15:22:05,087 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 71 selfloop transitions, 23 changer transitions 0/108 dead transitions. [2024-06-14 15:22:05,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 108 transitions, 989 flow [2024-06-14 15:22:05,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:22:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:22:05,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-14 15:22:05,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37109375 [2024-06-14 15:22:05,088 INFO L175 Difference]: Start difference. First operand has 105 places, 92 transitions, 743 flow. Second operand 8 states and 95 transitions. [2024-06-14 15:22:05,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 108 transitions, 989 flow [2024-06-14 15:22:05,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 108 transitions, 947 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 15:22:05,099 INFO L231 Difference]: Finished difference. Result has 107 places, 93 transitions, 772 flow [2024-06-14 15:22:05,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=772, PETRI_PLACES=107, PETRI_TRANSITIONS=93} [2024-06-14 15:22:05,100 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 76 predicate places. [2024-06-14 15:22:05,100 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 93 transitions, 772 flow [2024-06-14 15:22:05,100 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-14 15:22:05,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:22:05,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:22:05,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 15:22:05,100 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-14 15:22:05,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:22:05,101 INFO L85 PathProgramCache]: Analyzing trace with hash 722852287, now seen corresponding path program 1 times [2024-06-14 15:22:05,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:22:05,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978427515] [2024-06-14 15:22:05,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:22:05,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:22:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:22:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:22:10,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:22:10,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978427515] [2024-06-14 15:22:10,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978427515] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:22:10,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:22:10,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:22:10,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601638116] [2024-06-14 15:22:10,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:22:10,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:22:10,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:22:10,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:22:10,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:22:10,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:22:10,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 93 transitions, 772 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:10,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:22:10,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:22:10,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:22:10,507 INFO L124 PetriNetUnfolderBase]: 274/491 cut-off events. [2024-06-14 15:22:10,508 INFO L125 PetriNetUnfolderBase]: For 13892/13892 co-relation queries the response was YES. [2024-06-14 15:22:10,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2943 conditions, 491 events. 274/491 cut-off events. For 13892/13892 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1871 event pairs, 47 based on Foata normal form. 1/491 useless extension candidates. Maximal degree in co-relation 2890. Up to 407 conditions per place. [2024-06-14 15:22:10,511 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 80 selfloop transitions, 26 changer transitions 0/108 dead transitions. [2024-06-14 15:22:10,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 108 transitions, 1028 flow [2024-06-14 15:22:10,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:22:10,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:22:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-14 15:22:10,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34765625 [2024-06-14 15:22:10,516 INFO L175 Difference]: Start difference. First operand has 107 places, 93 transitions, 772 flow. Second operand 8 states and 89 transitions. [2024-06-14 15:22:10,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 108 transitions, 1028 flow [2024-06-14 15:22:10,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 108 transitions, 965 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-14 15:22:10,532 INFO L231 Difference]: Finished difference. Result has 109 places, 93 transitions, 771 flow [2024-06-14 15:22:10,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=771, PETRI_PLACES=109, PETRI_TRANSITIONS=93} [2024-06-14 15:22:10,532 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 78 predicate places. [2024-06-14 15:22:10,532 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 93 transitions, 771 flow [2024-06-14 15:22:10,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:10,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:22:10,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:22:10,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 15:22:10,533 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-14 15:22:10,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:22:10,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1070862303, now seen corresponding path program 1 times [2024-06-14 15:22:10,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:22:10,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574051215] [2024-06-14 15:22:10,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:22:10,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:22:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:22: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-14 15:22:15,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:22:15,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574051215] [2024-06-14 15:22:15,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574051215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:22:15,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:22:15,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:22:15,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795594948] [2024-06-14 15:22:15,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:22:15,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:22:15,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:22:15,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:22:15,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:22:15,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:22:15,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 93 transitions, 771 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:15,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:22:15,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:22:15,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:22:15,969 INFO L124 PetriNetUnfolderBase]: 280/501 cut-off events. [2024-06-14 15:22:15,969 INFO L125 PetriNetUnfolderBase]: For 15133/15133 co-relation queries the response was YES. [2024-06-14 15:22:15,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3004 conditions, 501 events. 280/501 cut-off events. For 15133/15133 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1936 event pairs, 46 based on Foata normal form. 2/502 useless extension candidates. Maximal degree in co-relation 2950. Up to 420 conditions per place. [2024-06-14 15:22:15,972 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 91 selfloop transitions, 23 changer transitions 0/116 dead transitions. [2024-06-14 15:22:15,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 116 transitions, 1081 flow [2024-06-14 15:22:15,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:22:15,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:22:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-14 15:22:15,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-14 15:22:15,975 INFO L175 Difference]: Start difference. First operand has 109 places, 93 transitions, 771 flow. Second operand 10 states and 108 transitions. [2024-06-14 15:22:15,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 116 transitions, 1081 flow [2024-06-14 15:22:15,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 116 transitions, 1002 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 15:22:15,990 INFO L231 Difference]: Finished difference. Result has 111 places, 95 transitions, 767 flow [2024-06-14 15:22:15,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=767, PETRI_PLACES=111, PETRI_TRANSITIONS=95} [2024-06-14 15:22:15,990 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 80 predicate places. [2024-06-14 15:22:15,991 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 95 transitions, 767 flow [2024-06-14 15:22:15,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:15,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:22:15,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:22:15,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 15:22:15,991 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-14 15:22:15,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:22:15,992 INFO L85 PathProgramCache]: Analyzing trace with hash -955391643, now seen corresponding path program 2 times [2024-06-14 15:22:15,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:22:15,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842516834] [2024-06-14 15:22:15,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:22:15,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:22:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:22:21,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:22:21,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:22:21,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842516834] [2024-06-14 15:22:21,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842516834] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:22:21,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:22:21,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:22:21,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233384909] [2024-06-14 15:22:21,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:22:21,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:22:21,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:22:21,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:22:21,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:22:21,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:22:21,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 95 transitions, 767 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:21,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:22:21,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:22:21,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:22:21,836 INFO L124 PetriNetUnfolderBase]: 296/527 cut-off events. [2024-06-14 15:22:21,836 INFO L125 PetriNetUnfolderBase]: For 17187/17187 co-relation queries the response was YES. [2024-06-14 15:22:21,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3232 conditions, 527 events. 296/527 cut-off events. For 17187/17187 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2051 event pairs, 44 based on Foata normal form. 2/528 useless extension candidates. Maximal degree in co-relation 3177. Up to 381 conditions per place. [2024-06-14 15:22:21,839 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 75 selfloop transitions, 42 changer transitions 0/119 dead transitions. [2024-06-14 15:22:21,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 119 transitions, 1169 flow [2024-06-14 15:22:21,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:22:21,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:22:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-14 15:22:21,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.346875 [2024-06-14 15:22:21,840 INFO L175 Difference]: Start difference. First operand has 111 places, 95 transitions, 767 flow. Second operand 10 states and 111 transitions. [2024-06-14 15:22:21,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 119 transitions, 1169 flow [2024-06-14 15:22:21,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 119 transitions, 1110 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-14 15:22:21,856 INFO L231 Difference]: Finished difference. Result has 113 places, 99 transitions, 849 flow [2024-06-14 15:22:21,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=849, PETRI_PLACES=113, PETRI_TRANSITIONS=99} [2024-06-14 15:22:21,856 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 82 predicate places. [2024-06-14 15:22:21,856 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 99 transitions, 849 flow [2024-06-14 15:22:21,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:21,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:22:21,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:22:21,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 15:22:21,857 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-14 15:22:21,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:22:21,857 INFO L85 PathProgramCache]: Analyzing trace with hash -386828745, now seen corresponding path program 1 times [2024-06-14 15:22:21,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:22:21,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218551709] [2024-06-14 15:22:21,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:22:21,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:22:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:22:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:22:27,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:22:27,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218551709] [2024-06-14 15:22:27,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218551709] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:22:27,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:22:27,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:22:27,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265240650] [2024-06-14 15:22:27,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:22:27,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:22:27,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:22:27,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:22:27,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:22:27,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:22:27,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 99 transitions, 849 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:27,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:22:27,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:22:27,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:22:27,598 INFO L124 PetriNetUnfolderBase]: 299/532 cut-off events. [2024-06-14 15:22:27,598 INFO L125 PetriNetUnfolderBase]: For 17964/17964 co-relation queries the response was YES. [2024-06-14 15:22:27,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3353 conditions, 532 events. 299/532 cut-off events. For 17964/17964 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2088 event pairs, 50 based on Foata normal form. 1/532 useless extension candidates. Maximal degree in co-relation 3297. Up to 497 conditions per place. [2024-06-14 15:22:27,601 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 94 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2024-06-14 15:22:27,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 112 transitions, 1117 flow [2024-06-14 15:22:27,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:22:27,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:22:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2024-06-14 15:22:27,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3159722222222222 [2024-06-14 15:22:27,603 INFO L175 Difference]: Start difference. First operand has 113 places, 99 transitions, 849 flow. Second operand 9 states and 91 transitions. [2024-06-14 15:22:27,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 112 transitions, 1117 flow [2024-06-14 15:22:27,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 112 transitions, 1043 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-14 15:22:27,622 INFO L231 Difference]: Finished difference. Result has 116 places, 101 transitions, 836 flow [2024-06-14 15:22:27,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=836, PETRI_PLACES=116, PETRI_TRANSITIONS=101} [2024-06-14 15:22:27,623 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 85 predicate places. [2024-06-14 15:22:27,623 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 101 transitions, 836 flow [2024-06-14 15:22:27,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:27,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:22:27,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:22:27,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 15:22:27,623 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-14 15:22:27,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:22:27,624 INFO L85 PathProgramCache]: Analyzing trace with hash -386835503, now seen corresponding path program 3 times [2024-06-14 15:22:27,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:22:27,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031874244] [2024-06-14 15:22:27,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:22:27,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:22:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:22:32,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:22:32,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:22:32,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031874244] [2024-06-14 15:22:32,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031874244] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:22:32,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:22:32,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:22:32,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436249576] [2024-06-14 15:22:32,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:22:32,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:22:32,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:22:32,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:22:32,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:22:32,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:22:32,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 101 transitions, 836 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:32,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:22:32,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:22:32,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:22:33,209 INFO L124 PetriNetUnfolderBase]: 305/542 cut-off events. [2024-06-14 15:22:33,210 INFO L125 PetriNetUnfolderBase]: For 19323/19323 co-relation queries the response was YES. [2024-06-14 15:22:33,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3428 conditions, 542 events. 305/542 cut-off events. For 19323/19323 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2142 event pairs, 43 based on Foata normal form. 2/543 useless extension candidates. Maximal degree in co-relation 3370. Up to 392 conditions per place. [2024-06-14 15:22:33,213 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 80 selfloop transitions, 41 changer transitions 0/123 dead transitions. [2024-06-14 15:22:33,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 123 transitions, 1226 flow [2024-06-14 15:22:33,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:22:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:22:33,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-14 15:22:33,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-14 15:22:33,214 INFO L175 Difference]: Start difference. First operand has 116 places, 101 transitions, 836 flow. Second operand 10 states and 112 transitions. [2024-06-14 15:22:33,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 123 transitions, 1226 flow [2024-06-14 15:22:33,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 123 transitions, 1181 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:22:33,236 INFO L231 Difference]: Finished difference. Result has 119 places, 103 transitions, 902 flow [2024-06-14 15:22:33,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=902, PETRI_PLACES=119, PETRI_TRANSITIONS=103} [2024-06-14 15:22:33,237 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 88 predicate places. [2024-06-14 15:22:33,237 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 103 transitions, 902 flow [2024-06-14 15:22:33,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:33,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:22:33,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:22:33,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 15:22:33,237 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-14 15:22:33,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:22:33,237 INFO L85 PathProgramCache]: Analyzing trace with hash 812859451, now seen corresponding path program 3 times [2024-06-14 15:22:33,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:22:33,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831401050] [2024-06-14 15:22:33,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:22:33,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:22:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:22:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:22:38,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:22:38,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831401050] [2024-06-14 15:22:38,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831401050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:22:38,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:22:38,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:22:38,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721852357] [2024-06-14 15:22:38,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:22:38,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:22:38,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:22:38,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:22:38,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:22:38,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:22:38,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 103 transitions, 902 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-14 15:22:38,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:22:38,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:22:38,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:22:39,158 INFO L124 PetriNetUnfolderBase]: 285/524 cut-off events. [2024-06-14 15:22:39,158 INFO L125 PetriNetUnfolderBase]: For 20968/20970 co-relation queries the response was YES. [2024-06-14 15:22:39,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3466 conditions, 524 events. 285/524 cut-off events. For 20968/20970 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2154 event pairs, 42 based on Foata normal form. 2/523 useless extension candidates. Maximal degree in co-relation 3407. Up to 406 conditions per place. [2024-06-14 15:22:39,162 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 80 selfloop transitions, 27 changer transitions 0/121 dead transitions. [2024-06-14 15:22:39,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 121 transitions, 1182 flow [2024-06-14 15:22:39,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:22:39,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:22:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 15:22:39,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2024-06-14 15:22:39,163 INFO L175 Difference]: Start difference. First operand has 119 places, 103 transitions, 902 flow. Second operand 9 states and 106 transitions. [2024-06-14 15:22:39,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 121 transitions, 1182 flow [2024-06-14 15:22:39,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 121 transitions, 1103 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:22:39,186 INFO L231 Difference]: Finished difference. Result has 121 places, 104 transitions, 901 flow [2024-06-14 15:22:39,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=901, PETRI_PLACES=121, PETRI_TRANSITIONS=104} [2024-06-14 15:22:39,186 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 90 predicate places. [2024-06-14 15:22:39,187 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 104 transitions, 901 flow [2024-06-14 15:22:39,187 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-14 15:22:39,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:22:39,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:22:39,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 15:22:39,187 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-14 15:22:39,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:22:39,187 INFO L85 PathProgramCache]: Analyzing trace with hash 812864411, now seen corresponding path program 4 times [2024-06-14 15:22:39,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:22:39,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323651426] [2024-06-14 15:22:39,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:22:39,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:22:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:22:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:22:44,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:22:44,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323651426] [2024-06-14 15:22:44,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323651426] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:22:44,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:22:44,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:22:44,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820087421] [2024-06-14 15:22:44,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:22:44,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:22:44,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:22:44,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:22:44,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:22:44,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:22:44,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 104 transitions, 901 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:44,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:22:44,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:22:44,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:22:44,784 INFO L124 PetriNetUnfolderBase]: 310/552 cut-off events. [2024-06-14 15:22:44,784 INFO L125 PetriNetUnfolderBase]: For 21185/21185 co-relation queries the response was YES. [2024-06-14 15:22:44,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3562 conditions, 552 events. 310/552 cut-off events. For 21185/21185 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2186 event pairs, 49 based on Foata normal form. 2/553 useless extension candidates. Maximal degree in co-relation 3502. Up to 403 conditions per place. [2024-06-14 15:22:44,787 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 85 selfloop transitions, 39 changer transitions 0/126 dead transitions. [2024-06-14 15:22:44,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 126 transitions, 1303 flow [2024-06-14 15:22:44,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:22:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:22:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-14 15:22:44,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-14 15:22:44,790 INFO L175 Difference]: Start difference. First operand has 121 places, 104 transitions, 901 flow. Second operand 10 states and 113 transitions. [2024-06-14 15:22:44,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 126 transitions, 1303 flow [2024-06-14 15:22:44,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 126 transitions, 1235 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:22:44,815 INFO L231 Difference]: Finished difference. Result has 124 places, 106 transitions, 942 flow [2024-06-14 15:22:44,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=942, PETRI_PLACES=124, PETRI_TRANSITIONS=106} [2024-06-14 15:22:44,815 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 93 predicate places. [2024-06-14 15:22:44,815 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 106 transitions, 942 flow [2024-06-14 15:22:44,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:44,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:22:44,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:22:44,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 15:22:44,816 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-14 15:22:44,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:22:44,817 INFO L85 PathProgramCache]: Analyzing trace with hash -534356069, now seen corresponding path program 5 times [2024-06-14 15:22:44,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:22:44,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649095520] [2024-06-14 15:22:44,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:22:44,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:22:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:22:50,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:22:50,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:22:50,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649095520] [2024-06-14 15:22:50,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649095520] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:22:50,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:22:50,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:22:50,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666255288] [2024-06-14 15:22:50,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:22:50,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:22:50,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:22:50,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:22:50,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:22:50,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:22:50,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 106 transitions, 942 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:50,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:22:50,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:22:50,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:22:50,658 INFO L124 PetriNetUnfolderBase]: 336/595 cut-off events. [2024-06-14 15:22:50,658 INFO L125 PetriNetUnfolderBase]: For 25116/25119 co-relation queries the response was YES. [2024-06-14 15:22:50,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3965 conditions, 595 events. 336/595 cut-off events. For 25116/25119 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2423 event pairs, 49 based on Foata normal form. 4/596 useless extension candidates. Maximal degree in co-relation 3904. Up to 349 conditions per place. [2024-06-14 15:22:50,663 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 70 selfloop transitions, 63 changer transitions 0/135 dead transitions. [2024-06-14 15:22:50,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 135 transitions, 1596 flow [2024-06-14 15:22:50,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:22:50,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:22:50,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-14 15:22:50,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.365625 [2024-06-14 15:22:50,673 INFO L175 Difference]: Start difference. First operand has 124 places, 106 transitions, 942 flow. Second operand 10 states and 117 transitions. [2024-06-14 15:22:50,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 135 transitions, 1596 flow [2024-06-14 15:22:50,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 135 transitions, 1525 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:22:50,705 INFO L231 Difference]: Finished difference. Result has 127 places, 114 transitions, 1118 flow [2024-06-14 15:22:50,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1118, PETRI_PLACES=127, PETRI_TRANSITIONS=114} [2024-06-14 15:22:50,705 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 96 predicate places. [2024-06-14 15:22:50,705 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 114 transitions, 1118 flow [2024-06-14 15:22:50,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:50,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:22:50,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:22:50,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 15:22:50,706 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-14 15:22:50,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:22:50,706 INFO L85 PathProgramCache]: Analyzing trace with hash -534355821, now seen corresponding path program 2 times [2024-06-14 15:22:50,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:22:50,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335203814] [2024-06-14 15:22:50,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:22:50,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:22:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:22:56,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:22:56,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:22:56,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335203814] [2024-06-14 15:22:56,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335203814] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:22:56,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:22:56,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:22:56,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836830549] [2024-06-14 15:22:56,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:22:56,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:22:56,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:22:56,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:22:56,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:22:56,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:22:56,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 114 transitions, 1118 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:56,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:22:56,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:22:56,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:22:56,533 INFO L124 PetriNetUnfolderBase]: 344/608 cut-off events. [2024-06-14 15:22:56,533 INFO L125 PetriNetUnfolderBase]: For 26835/26838 co-relation queries the response was YES. [2024-06-14 15:22:56,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4200 conditions, 608 events. 344/608 cut-off events. For 26835/26838 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2486 event pairs, 63 based on Foata normal form. 3/608 useless extension candidates. Maximal degree in co-relation 4138. Up to 529 conditions per place. [2024-06-14 15:22:56,537 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 96 selfloop transitions, 33 changer transitions 0/131 dead transitions. [2024-06-14 15:22:56,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 131 transitions, 1622 flow [2024-06-14 15:22:56,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:22:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:22:56,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-14 15:22:56,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3368055555555556 [2024-06-14 15:22:56,540 INFO L175 Difference]: Start difference. First operand has 127 places, 114 transitions, 1118 flow. Second operand 9 states and 97 transitions. [2024-06-14 15:22:56,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 131 transitions, 1622 flow [2024-06-14 15:22:56,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 131 transitions, 1540 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-14 15:22:56,573 INFO L231 Difference]: Finished difference. Result has 132 places, 120 transitions, 1183 flow [2024-06-14 15:22:56,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1183, PETRI_PLACES=132, PETRI_TRANSITIONS=120} [2024-06-14 15:22:56,576 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 101 predicate places. [2024-06-14 15:22:56,576 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 120 transitions, 1183 flow [2024-06-14 15:22:56,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:22:56,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:22:56,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:22:56,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 15:22:56,576 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-14 15:22:56,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:22:56,577 INFO L85 PathProgramCache]: Analyzing trace with hash -534362579, now seen corresponding path program 6 times [2024-06-14 15:22:56,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:22:56,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852408865] [2024-06-14 15:22:56,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:22:56,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:22:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:23:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:23:01,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:23:01,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852408865] [2024-06-14 15:23:01,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852408865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:23:01,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:23:01,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:23:01,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204479041] [2024-06-14 15:23:01,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:23:01,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:23:01,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:23:01,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:23:01,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:23:01,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:23:01,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 120 transitions, 1183 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:23:01,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:23:01,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:23:01,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:23:02,205 INFO L124 PetriNetUnfolderBase]: 340/602 cut-off events. [2024-06-14 15:23:02,206 INFO L125 PetriNetUnfolderBase]: For 27135/27138 co-relation queries the response was YES. [2024-06-14 15:23:02,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4128 conditions, 602 events. 340/602 cut-off events. For 27135/27138 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2461 event pairs, 46 based on Foata normal form. 4/603 useless extension candidates. Maximal degree in co-relation 4064. Up to 359 conditions per place. [2024-06-14 15:23:02,210 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 73 selfloop transitions, 64 changer transitions 0/139 dead transitions. [2024-06-14 15:23:02,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 139 transitions, 1663 flow [2024-06-14 15:23:02,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:23:02,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:23:02,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-14 15:23:02,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35625 [2024-06-14 15:23:02,211 INFO L175 Difference]: Start difference. First operand has 132 places, 120 transitions, 1183 flow. Second operand 10 states and 114 transitions. [2024-06-14 15:23:02,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 139 transitions, 1663 flow [2024-06-14 15:23:02,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 139 transitions, 1610 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-14 15:23:02,243 INFO L231 Difference]: Finished difference. Result has 138 places, 120 transitions, 1263 flow [2024-06-14 15:23:02,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1263, PETRI_PLACES=138, PETRI_TRANSITIONS=120} [2024-06-14 15:23:02,244 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 107 predicate places. [2024-06-14 15:23:02,244 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 120 transitions, 1263 flow [2024-06-14 15:23:02,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:23:02,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:23:02,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:23:02,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 15:23:02,244 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-14 15:23:02,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:23:02,245 INFO L85 PathProgramCache]: Analyzing trace with hash -534116811, now seen corresponding path program 3 times [2024-06-14 15:23:02,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:23:02,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563853004] [2024-06-14 15:23:02,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:23:02,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:23:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:23:07,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:23:07,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:23:07,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563853004] [2024-06-14 15:23:07,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563853004] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:23:07,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:23:07,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:23:07,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971718438] [2024-06-14 15:23:07,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:23:07,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:23:07,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:23:07,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:23:07,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:23:07,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:23:07,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 120 transitions, 1263 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:23:07,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:23:07,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:23:07,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:23:07,710 INFO L124 PetriNetUnfolderBase]: 343/606 cut-off events. [2024-06-14 15:23:07,711 INFO L125 PetriNetUnfolderBase]: For 28068/28068 co-relation queries the response was YES. [2024-06-14 15:23:07,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4323 conditions, 606 events. 343/606 cut-off events. For 28068/28068 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2473 event pairs, 66 based on Foata normal form. 1/606 useless extension candidates. Maximal degree in co-relation 4257. Up to 581 conditions per place. [2024-06-14 15:23:07,715 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 115 selfloop transitions, 14 changer transitions 0/131 dead transitions. [2024-06-14 15:23:07,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 131 transitions, 1571 flow [2024-06-14 15:23:07,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:23:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:23:07,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2024-06-14 15:23:07,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3055555555555556 [2024-06-14 15:23:07,716 INFO L175 Difference]: Start difference. First operand has 138 places, 120 transitions, 1263 flow. Second operand 9 states and 88 transitions. [2024-06-14 15:23:07,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 131 transitions, 1571 flow [2024-06-14 15:23:07,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 131 transitions, 1445 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 15:23:07,756 INFO L231 Difference]: Finished difference. Result has 139 places, 122 transitions, 1202 flow [2024-06-14 15:23:07,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1202, PETRI_PLACES=139, PETRI_TRANSITIONS=122} [2024-06-14 15:23:07,756 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 108 predicate places. [2024-06-14 15:23:07,756 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 122 transitions, 1202 flow [2024-06-14 15:23:07,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:23:07,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:23:07,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:23:07,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 15:23:07,757 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-14 15:23:07,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:23:07,757 INFO L85 PathProgramCache]: Analyzing trace with hash -534125429, now seen corresponding path program 7 times [2024-06-14 15:23:07,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:23:07,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928863018] [2024-06-14 15:23:07,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:23:07,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:23:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:23:13,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-14 15:23:13,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:23:13,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928863018] [2024-06-14 15:23:13,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928863018] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:23:13,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:23:13,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:23:13,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474227342] [2024-06-14 15:23:13,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:23:13,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:23:13,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:23:13,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:23:13,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:23:13,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:23:13,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 122 transitions, 1202 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:23:13,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:23:13,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:23:13,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:23:13,595 INFO L124 PetriNetUnfolderBase]: 339/601 cut-off events. [2024-06-14 15:23:13,595 INFO L125 PetriNetUnfolderBase]: For 28396/28399 co-relation queries the response was YES. [2024-06-14 15:23:13,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4118 conditions, 601 events. 339/601 cut-off events. For 28396/28399 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2458 event pairs, 44 based on Foata normal form. 4/602 useless extension candidates. Maximal degree in co-relation 4051. Up to 361 conditions per place. [2024-06-14 15:23:13,600 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 67 selfloop transitions, 71 changer transitions 0/140 dead transitions. [2024-06-14 15:23:13,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 140 transitions, 1610 flow [2024-06-14 15:23:13,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:23:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:23:13,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-14 15:23:13,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-14 15:23:13,601 INFO L175 Difference]: Start difference. First operand has 139 places, 122 transitions, 1202 flow. Second operand 10 states and 112 transitions. [2024-06-14 15:23:13,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 140 transitions, 1610 flow [2024-06-14 15:23:13,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 140 transitions, 1551 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-14 15:23:13,635 INFO L231 Difference]: Finished difference. Result has 142 places, 122 transitions, 1290 flow [2024-06-14 15:23:13,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1290, PETRI_PLACES=142, PETRI_TRANSITIONS=122} [2024-06-14 15:23:13,636 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 111 predicate places. [2024-06-14 15:23:13,636 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 122 transitions, 1290 flow [2024-06-14 15:23:13,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:23:13,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:23:13,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:23:13,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 15:23:13,637 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-14 15:23:13,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:23:13,637 INFO L85 PathProgramCache]: Analyzing trace with hash -526081611, now seen corresponding path program 4 times [2024-06-14 15:23:13,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:23:13,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87911065] [2024-06-14 15:23:13,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:23:13,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:23:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:23:19,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:23:19,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:23:19,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87911065] [2024-06-14 15:23:19,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87911065] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:23:19,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:23:19,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:23:19,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809231470] [2024-06-14 15:23:19,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:23:19,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:23:19,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:23:19,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:23:19,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:23:19,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:23:19,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 122 transitions, 1290 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:23:19,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:23:19,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:23:19,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:23:19,451 INFO L124 PetriNetUnfolderBase]: 337/598 cut-off events. [2024-06-14 15:23:19,451 INFO L125 PetriNetUnfolderBase]: For 28175/28178 co-relation queries the response was YES. [2024-06-14 15:23:19,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4220 conditions, 598 events. 337/598 cut-off events. For 28175/28178 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2446 event pairs, 61 based on Foata normal form. 3/598 useless extension candidates. Maximal degree in co-relation 4152. Up to 519 conditions per place. [2024-06-14 15:23:19,455 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 93 selfloop transitions, 37 changer transitions 0/132 dead transitions. [2024-06-14 15:23:19,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 132 transitions, 1656 flow [2024-06-14 15:23:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:23:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:23:19,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2024-06-14 15:23:19,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3298611111111111 [2024-06-14 15:23:19,458 INFO L175 Difference]: Start difference. First operand has 142 places, 122 transitions, 1290 flow. Second operand 9 states and 95 transitions. [2024-06-14 15:23:19,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 132 transitions, 1656 flow [2024-06-14 15:23:19,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 132 transitions, 1512 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-14 15:23:19,500 INFO L231 Difference]: Finished difference. Result has 142 places, 122 transitions, 1225 flow [2024-06-14 15:23:19,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1225, PETRI_PLACES=142, PETRI_TRANSITIONS=122} [2024-06-14 15:23:19,501 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 111 predicate places. [2024-06-14 15:23:19,501 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 122 transitions, 1225 flow [2024-06-14 15:23:19,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:23:19,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:23:19,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:23:19,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 15:23:19,502 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-14 15:23:19,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:23:19,502 INFO L85 PathProgramCache]: Analyzing trace with hash -762263729, now seen corresponding path program 8 times [2024-06-14 15:23:19,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:23:19,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960566801] [2024-06-14 15:23:19,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:23:19,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:23:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:23:24,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-14 15:23:24,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:23:24,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960566801] [2024-06-14 15:23:24,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960566801] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:23:24,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:23:24,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:23:24,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824325591] [2024-06-14 15:23:24,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:23:24,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:23:24,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:23:24,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:23:24,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:23:24,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:23:24,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 122 transitions, 1225 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:23:24,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:23:24,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:23:24,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:23:25,160 INFO L124 PetriNetUnfolderBase]: 353/624 cut-off events. [2024-06-14 15:23:25,160 INFO L125 PetriNetUnfolderBase]: For 32095/32098 co-relation queries the response was YES. [2024-06-14 15:23:25,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4376 conditions, 624 events. 353/624 cut-off events. For 32095/32098 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2580 event pairs, 56 based on Foata normal form. 4/625 useless extension candidates. Maximal degree in co-relation 4307. Up to 373 conditions per place. [2024-06-14 15:23:25,165 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 84 selfloop transitions, 61 changer transitions 0/147 dead transitions. [2024-06-14 15:23:25,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 147 transitions, 1887 flow [2024-06-14 15:23:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:23:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:23:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-14 15:23:25,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371875 [2024-06-14 15:23:25,167 INFO L175 Difference]: Start difference. First operand has 142 places, 122 transitions, 1225 flow. Second operand 10 states and 119 transitions. [2024-06-14 15:23:25,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 147 transitions, 1887 flow [2024-06-14 15:23:25,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 147 transitions, 1812 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 15:23:25,207 INFO L231 Difference]: Finished difference. Result has 145 places, 126 transitions, 1337 flow [2024-06-14 15:23:25,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1337, PETRI_PLACES=145, PETRI_TRANSITIONS=126} [2024-06-14 15:23:25,207 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 114 predicate places. [2024-06-14 15:23:25,208 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 126 transitions, 1337 flow [2024-06-14 15:23:25,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:23:25,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:23:25,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:23:25,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 15:23:25,208 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-14 15:23:25,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:23:25,208 INFO L85 PathProgramCache]: Analyzing trace with hash -789936959, now seen corresponding path program 4 times [2024-06-14 15:23:25,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:23:25,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420996466] [2024-06-14 15:23:25,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:23:25,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:23:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:23:30,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:23:30,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:23:30,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420996466] [2024-06-14 15:23:30,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420996466] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:23:30,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:23:30,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:23:30,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093926599] [2024-06-14 15:23:30,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:23:30,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:23:30,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:23:30,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:23:30,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:23:30,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:23:30,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 126 transitions, 1337 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-14 15:23:30,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:23:30,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:23:30,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:23:31,007 INFO L124 PetriNetUnfolderBase]: 317/580 cut-off events. [2024-06-14 15:23:31,007 INFO L125 PetriNetUnfolderBase]: For 32501/32510 co-relation queries the response was YES. [2024-06-14 15:23:31,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4227 conditions, 580 events. 317/580 cut-off events. For 32501/32510 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2471 event pairs, 42 based on Foata normal form. 4/575 useless extension candidates. Maximal degree in co-relation 4157. Up to 449 conditions per place. [2024-06-14 15:23:31,011 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 96 selfloop transitions, 31 changer transitions 0/141 dead transitions. [2024-06-14 15:23:31,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 141 transitions, 1633 flow [2024-06-14 15:23:31,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:23:31,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:23:31,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-14 15:23:31,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-14 15:23:31,012 INFO L175 Difference]: Start difference. First operand has 145 places, 126 transitions, 1337 flow. Second operand 9 states and 105 transitions. [2024-06-14 15:23:31,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 141 transitions, 1633 flow [2024-06-14 15:23:31,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 141 transitions, 1438 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-14 15:23:31,056 INFO L231 Difference]: Finished difference. Result has 146 places, 126 transitions, 1208 flow [2024-06-14 15:23:31,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1208, PETRI_PLACES=146, PETRI_TRANSITIONS=126} [2024-06-14 15:23:31,057 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 115 predicate places. [2024-06-14 15:23:31,057 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 126 transitions, 1208 flow [2024-06-14 15:23:31,057 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-14 15:23:31,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:23:31,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:23:31,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 15:23:31,058 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-14 15:23:31,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:23:31,058 INFO L85 PathProgramCache]: Analyzing trace with hash -789931999, now seen corresponding path program 9 times [2024-06-14 15:23:31,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:23:31,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623436659] [2024-06-14 15:23:31,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:23:31,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:23:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:23:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:23:36,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:23:36,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623436659] [2024-06-14 15:23:36,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623436659] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:23:36,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:23:36,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:23:36,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322209138] [2024-06-14 15:23:36,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:23:36,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:23:36,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:23:36,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:23:36,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:23:36,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:23:36,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 126 transitions, 1208 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:23:36,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:23:36,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:23:36,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:23:36,697 INFO L124 PetriNetUnfolderBase]: 346/613 cut-off events. [2024-06-14 15:23:36,698 INFO L125 PetriNetUnfolderBase]: For 31006/31009 co-relation queries the response was YES. [2024-06-14 15:23:36,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4091 conditions, 613 events. 346/613 cut-off events. For 31006/31009 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2530 event pairs, 57 based on Foata normal form. 4/614 useless extension candidates. Maximal degree in co-relation 4021. Up to 365 conditions per place. [2024-06-14 15:23:36,702 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 79 selfloop transitions, 64 changer transitions 0/145 dead transitions. [2024-06-14 15:23:36,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 145 transitions, 1724 flow [2024-06-14 15:23:36,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:23:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:23:36,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-14 15:23:36,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-14 15:23:36,704 INFO L175 Difference]: Start difference. First operand has 146 places, 126 transitions, 1208 flow. Second operand 10 states and 115 transitions. [2024-06-14 15:23:36,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 145 transitions, 1724 flow [2024-06-14 15:23:36,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 145 transitions, 1611 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-14 15:23:36,748 INFO L231 Difference]: Finished difference. Result has 148 places, 126 transitions, 1228 flow [2024-06-14 15:23:36,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1228, PETRI_PLACES=148, PETRI_TRANSITIONS=126} [2024-06-14 15:23:36,749 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 117 predicate places. [2024-06-14 15:23:36,749 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 126 transitions, 1228 flow [2024-06-14 15:23:36,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:23:36,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:23:36,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:23:36,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 15:23:36,749 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-14 15:23:36,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:23:36,749 INFO L85 PathProgramCache]: Analyzing trace with hash -789752261, now seen corresponding path program 5 times [2024-06-14 15:23:36,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:23:36,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906079137] [2024-06-14 15:23:36,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:23:36,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:23:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:23:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:23:41,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:23:41,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906079137] [2024-06-14 15:23:41,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906079137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:23:41,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:23:41,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:23:41,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405293672] [2024-06-14 15:23:41,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:23:41,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:23:41,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:23:41,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:23:41,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:23:41,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:23:41,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 126 transitions, 1228 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:23:41,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:23:41,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:23:41,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:23:41,913 INFO L124 PetriNetUnfolderBase]: 344/612 cut-off events. [2024-06-14 15:23:41,914 INFO L125 PetriNetUnfolderBase]: For 30278/30278 co-relation queries the response was YES. [2024-06-14 15:23:41,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4082 conditions, 612 events. 344/612 cut-off events. For 30278/30278 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2533 event pairs, 104 based on Foata normal form. 1/611 useless extension candidates. Maximal degree in co-relation 4011. Up to 532 conditions per place. [2024-06-14 15:23:41,917 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 98 selfloop transitions, 37 changer transitions 0/137 dead transitions. [2024-06-14 15:23:41,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 137 transitions, 1540 flow [2024-06-14 15:23:41,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:23:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:23:41,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2024-06-14 15:23:41,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.321875 [2024-06-14 15:23:41,918 INFO L175 Difference]: Start difference. First operand has 148 places, 126 transitions, 1228 flow. Second operand 10 states and 103 transitions. [2024-06-14 15:23:41,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 137 transitions, 1540 flow [2024-06-14 15:23:41,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 137 transitions, 1378 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-14 15:23:41,963 INFO L231 Difference]: Finished difference. Result has 149 places, 128 transitions, 1168 flow [2024-06-14 15:23:41,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1168, PETRI_PLACES=149, PETRI_TRANSITIONS=128} [2024-06-14 15:23:41,963 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 118 predicate places. [2024-06-14 15:23:41,963 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 128 transitions, 1168 flow [2024-06-14 15:23:41,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:23:41,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:23:41,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:23:41,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 15:23:41,964 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-14 15:23:41,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:23:41,964 INFO L85 PathProgramCache]: Analyzing trace with hash -789752509, now seen corresponding path program 10 times [2024-06-14 15:23:41,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:23:41,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424374618] [2024-06-14 15:23:41,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:23:41,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:23:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:23:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:23:47,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:23:47,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424374618] [2024-06-14 15:23:47,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424374618] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:23:47,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:23:47,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:23:47,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567226970] [2024-06-14 15:23:47,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:23:47,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:23:47,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:23:47,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:23:47,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:23:47,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:23:47,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 128 transitions, 1168 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:23:47,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:23:47,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:23:47,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:23:47,838 INFO L124 PetriNetUnfolderBase]: 340/604 cut-off events. [2024-06-14 15:23:47,839 INFO L125 PetriNetUnfolderBase]: For 30153/30153 co-relation queries the response was YES. [2024-06-14 15:23:47,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3849 conditions, 604 events. 340/604 cut-off events. For 30153/30153 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2484 event pairs, 54 based on Foata normal form. 2/603 useless extension candidates. Maximal degree in co-relation 3777. Up to 359 conditions per place. [2024-06-14 15:23:47,842 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 81 selfloop transitions, 63 changer transitions 0/146 dead transitions. [2024-06-14 15:23:47,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 146 transitions, 1602 flow [2024-06-14 15:23:47,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:23:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:23:47,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-14 15:23:47,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-14 15:23:47,846 INFO L175 Difference]: Start difference. First operand has 149 places, 128 transitions, 1168 flow. Second operand 10 states and 116 transitions. [2024-06-14 15:23:47,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 146 transitions, 1602 flow [2024-06-14 15:23:47,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 146 transitions, 1487 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-14 15:23:47,891 INFO L231 Difference]: Finished difference. Result has 151 places, 128 transitions, 1184 flow [2024-06-14 15:23:47,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1184, PETRI_PLACES=151, PETRI_TRANSITIONS=128} [2024-06-14 15:23:47,891 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 120 predicate places. [2024-06-14 15:23:47,891 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 128 transitions, 1184 flow [2024-06-14 15:23:47,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:23:47,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:23:47,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:23:47,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 15:23:47,892 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-14 15:23:47,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:23:47,892 INFO L85 PathProgramCache]: Analyzing trace with hash -525774029, now seen corresponding path program 1 times [2024-06-14 15:23:47,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:23:47,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202450980] [2024-06-14 15:23:47,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:23:47,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:23:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:23:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:23:53,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:23:53,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202450980] [2024-06-14 15:23:53,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202450980] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:23:53,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:23:53,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:23:53,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916453587] [2024-06-14 15:23:53,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:23:53,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:23:53,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:23:53,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:23:53,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:23:53,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:23:53,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 128 transitions, 1184 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:23:53,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:23:53,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:23:53,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:23:54,145 INFO L124 PetriNetUnfolderBase]: 337/598 cut-off events. [2024-06-14 15:23:54,145 INFO L125 PetriNetUnfolderBase]: For 29368/29368 co-relation queries the response was YES. [2024-06-14 15:23:54,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3816 conditions, 598 events. 337/598 cut-off events. For 29368/29368 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2437 event pairs, 64 based on Foata normal form. 2/599 useless extension candidates. Maximal degree in co-relation 3742. Up to 567 conditions per place. [2024-06-14 15:23:54,149 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 121 selfloop transitions, 15 changer transitions 0/138 dead transitions. [2024-06-14 15:23:54,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 138 transitions, 1478 flow [2024-06-14 15:23:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:23:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:23:54,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2024-06-14 15:23:54,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.296875 [2024-06-14 15:23:54,150 INFO L175 Difference]: Start difference. First operand has 151 places, 128 transitions, 1184 flow. Second operand 10 states and 95 transitions. [2024-06-14 15:23:54,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 138 transitions, 1478 flow [2024-06-14 15:23:54,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 138 transitions, 1313 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-14 15:23:54,192 INFO L231 Difference]: Finished difference. Result has 151 places, 128 transitions, 1053 flow [2024-06-14 15:23:54,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1053, PETRI_PLACES=151, PETRI_TRANSITIONS=128} [2024-06-14 15:23:54,192 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 120 predicate places. [2024-06-14 15:23:54,192 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 128 transitions, 1053 flow [2024-06-14 15:23:54,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:23:54,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:23:54,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:23:54,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 15:23:54,193 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-14 15:23:54,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:23:54,193 INFO L85 PathProgramCache]: Analyzing trace with hash 61215939, now seen corresponding path program 1 times [2024-06-14 15:23:54,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:23:54,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683410573] [2024-06-14 15:23:54,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:23:54,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:23:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:23:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:23:59,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:23:59,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683410573] [2024-06-14 15:23:59,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683410573] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:23:59,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:23:59,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:23:59,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153281029] [2024-06-14 15:23:59,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:23:59,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:23:59,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:23:59,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:23:59,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:23:59,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:23:59,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 128 transitions, 1053 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:23:59,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:23:59,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:23:59,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:23:59,914 INFO L124 PetriNetUnfolderBase]: 341/606 cut-off events. [2024-06-14 15:23:59,914 INFO L125 PetriNetUnfolderBase]: For 30268/30268 co-relation queries the response was YES. [2024-06-14 15:23:59,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3720 conditions, 606 events. 341/606 cut-off events. For 30268/30268 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2495 event pairs, 38 based on Foata normal form. 2/607 useless extension candidates. Maximal degree in co-relation 3645. Up to 520 conditions per place. [2024-06-14 15:23:59,919 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 125 selfloop transitions, 18 changer transitions 0/145 dead transitions. [2024-06-14 15:23:59,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 145 transitions, 1393 flow [2024-06-14 15:23:59,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:23:59,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:23:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-14 15:23:59,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3263888888888889 [2024-06-14 15:23:59,921 INFO L175 Difference]: Start difference. First operand has 151 places, 128 transitions, 1053 flow. Second operand 9 states and 94 transitions. [2024-06-14 15:23:59,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 145 transitions, 1393 flow [2024-06-14 15:23:59,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 145 transitions, 1355 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 15:23:59,971 INFO L231 Difference]: Finished difference. Result has 152 places, 129 transitions, 1069 flow [2024-06-14 15:23:59,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1069, PETRI_PLACES=152, PETRI_TRANSITIONS=129} [2024-06-14 15:23:59,972 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 121 predicate places. [2024-06-14 15:23:59,972 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 129 transitions, 1069 flow [2024-06-14 15:23:59,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:23:59,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:23:59,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:23:59,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 15:23:59,972 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-14 15:23:59,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:23:59,973 INFO L85 PathProgramCache]: Analyzing trace with hash 63089889, now seen corresponding path program 2 times [2024-06-14 15:23:59,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:23:59,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448192928] [2024-06-14 15:23:59,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:23:59,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:24:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:24:05,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-14 15:24:05,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:24:05,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448192928] [2024-06-14 15:24:05,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448192928] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:24:05,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:24:05,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:24:05,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023001877] [2024-06-14 15:24:05,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:24:05,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:24:05,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:24:05,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:24:05,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:24:05,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:24:05,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 129 transitions, 1069 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:24:05,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:24:05,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:24:05,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:24:06,115 INFO L124 PetriNetUnfolderBase]: 352/627 cut-off events. [2024-06-14 15:24:06,115 INFO L125 PetriNetUnfolderBase]: For 33921/33921 co-relation queries the response was YES. [2024-06-14 15:24:06,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3953 conditions, 627 events. 352/627 cut-off events. For 33921/33921 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2627 event pairs, 54 based on Foata normal form. 2/628 useless extension candidates. Maximal degree in co-relation 3877. Up to 512 conditions per place. [2024-06-14 15:24:06,120 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 120 selfloop transitions, 26 changer transitions 0/148 dead transitions. [2024-06-14 15:24:06,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 148 transitions, 1533 flow [2024-06-14 15:24:06,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:24:06,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:24:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-14 15:24:06,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:24:06,122 INFO L175 Difference]: Start difference. First operand has 152 places, 129 transitions, 1069 flow. Second operand 9 states and 99 transitions. [2024-06-14 15:24:06,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 148 transitions, 1533 flow [2024-06-14 15:24:06,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 148 transitions, 1489 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 15:24:06,183 INFO L231 Difference]: Finished difference. Result has 154 places, 131 transitions, 1111 flow [2024-06-14 15:24:06,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1111, PETRI_PLACES=154, PETRI_TRANSITIONS=131} [2024-06-14 15:24:06,183 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 123 predicate places. [2024-06-14 15:24:06,183 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 131 transitions, 1111 flow [2024-06-14 15:24:06,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:24:06,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:24:06,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:24:06,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 15:24:06,184 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-14 15:24:06,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:24:06,184 INFO L85 PathProgramCache]: Analyzing trace with hash 146210654, now seen corresponding path program 1 times [2024-06-14 15:24:06,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:24:06,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502206589] [2024-06-14 15:24:06,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:24:06,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:24:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:24:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:24:11,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:24:11,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502206589] [2024-06-14 15:24:11,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502206589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:24:11,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:24:11,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:24:11,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718411171] [2024-06-14 15:24:11,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:24:11,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:24:11,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:24:11,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:24:11,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:24:11,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:24:11,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 131 transitions, 1111 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:24:11,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:24:11,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:24:11,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:24:12,235 INFO L124 PetriNetUnfolderBase]: 350/624 cut-off events. [2024-06-14 15:24:12,236 INFO L125 PetriNetUnfolderBase]: For 33155/33155 co-relation queries the response was YES. [2024-06-14 15:24:12,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3928 conditions, 624 events. 350/624 cut-off events. For 33155/33155 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2607 event pairs, 53 based on Foata normal form. 1/624 useless extension candidates. Maximal degree in co-relation 3851. Up to 529 conditions per place. [2024-06-14 15:24:12,240 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 114 selfloop transitions, 31 changer transitions 0/147 dead transitions. [2024-06-14 15:24:12,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 147 transitions, 1449 flow [2024-06-14 15:24:12,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:24:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:24:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-14 15:24:12,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-14 15:24:12,241 INFO L175 Difference]: Start difference. First operand has 154 places, 131 transitions, 1111 flow. Second operand 9 states and 98 transitions. [2024-06-14 15:24:12,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 147 transitions, 1449 flow [2024-06-14 15:24:12,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 147 transitions, 1393 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-14 15:24:12,297 INFO L231 Difference]: Finished difference. Result has 158 places, 131 transitions, 1125 flow [2024-06-14 15:24:12,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1125, PETRI_PLACES=158, PETRI_TRANSITIONS=131} [2024-06-14 15:24:12,297 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 127 predicate places. [2024-06-14 15:24:12,297 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 131 transitions, 1125 flow [2024-06-14 15:24:12,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:24:12,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:24:12,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:24:12,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 15:24:12,298 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-14 15:24:12,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:24:12,298 INFO L85 PathProgramCache]: Analyzing trace with hash 63093609, now seen corresponding path program 3 times [2024-06-14 15:24:12,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:24:12,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001418660] [2024-06-14 15:24:12,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:24:12,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:24:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:24:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:24:17,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:24:17,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001418660] [2024-06-14 15:24:17,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001418660] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:24:17,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:24:17,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:24:17,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114171374] [2024-06-14 15:24:17,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:24:17,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:24:17,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:24:17,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:24:17,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:24:18,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:24:18,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 131 transitions, 1125 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:24:18,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:24:18,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:24:18,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:24:18,384 INFO L124 PetriNetUnfolderBase]: 347/619 cut-off events. [2024-06-14 15:24:18,384 INFO L125 PetriNetUnfolderBase]: For 32999/32999 co-relation queries the response was YES. [2024-06-14 15:24:18,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3853 conditions, 619 events. 347/619 cut-off events. For 32999/32999 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2579 event pairs, 52 based on Foata normal form. 2/620 useless extension candidates. Maximal degree in co-relation 3774. Up to 527 conditions per place. [2024-06-14 15:24:18,388 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 117 selfloop transitions, 28 changer transitions 0/147 dead transitions. [2024-06-14 15:24:18,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 147 transitions, 1461 flow [2024-06-14 15:24:18,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:24:18,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:24:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-14 15:24:18,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3368055555555556 [2024-06-14 15:24:18,390 INFO L175 Difference]: Start difference. First operand has 158 places, 131 transitions, 1125 flow. Second operand 9 states and 97 transitions. [2024-06-14 15:24:18,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 147 transitions, 1461 flow [2024-06-14 15:24:18,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 147 transitions, 1340 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-14 15:24:18,452 INFO L231 Difference]: Finished difference. Result has 157 places, 131 transitions, 1065 flow [2024-06-14 15:24:18,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1065, PETRI_PLACES=157, PETRI_TRANSITIONS=131} [2024-06-14 15:24:18,453 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 126 predicate places. [2024-06-14 15:24:18,453 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 131 transitions, 1065 flow [2024-06-14 15:24:18,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:24:18,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:24:18,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-14 15:24:18,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 15:24:18,453 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-14 15:24:18,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:24:18,454 INFO L85 PathProgramCache]: Analyzing trace with hash 149935521, now seen corresponding path program 1 times [2024-06-14 15:24:18,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:24:18,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500010676] [2024-06-14 15:24:18,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:24:18,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:24:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:24:24,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:24:24,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:24:24,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500010676] [2024-06-14 15:24:24,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500010676] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:24:24,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:24:24,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:24:24,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844680720] [2024-06-14 15:24:24,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:24:24,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:24:24,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:24:24,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:24:24,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:24:24,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:24:24,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 131 transitions, 1065 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:24:24,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:24:24,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:24:24,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:24:24,451 INFO L124 PetriNetUnfolderBase]: 353/629 cut-off events. [2024-06-14 15:24:24,451 INFO L125 PetriNetUnfolderBase]: For 34189/34189 co-relation queries the response was YES. [2024-06-14 15:24:24,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3863 conditions, 629 events. 353/629 cut-off events. For 34189/34189 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2642 event pairs, 51 based on Foata normal form. 2/630 useless extension candidates. Maximal degree in co-relation 3783. Up to 540 conditions per place. [2024-06-14 15:24:24,456 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 127 selfloop transitions, 26 changer transitions 0/155 dead transitions. [2024-06-14 15:24:24,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 155 transitions, 1463 flow [2024-06-14 15:24:24,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:24:24,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:24:24,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-14 15:24:24,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33238636363636365 [2024-06-14 15:24:24,457 INFO L175 Difference]: Start difference. First operand has 157 places, 131 transitions, 1065 flow. Second operand 11 states and 117 transitions. [2024-06-14 15:24:24,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 155 transitions, 1463 flow [2024-06-14 15:24:24,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 155 transitions, 1402 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-14 15:24:24,525 INFO L231 Difference]: Finished difference. Result has 160 places, 133 transitions, 1089 flow [2024-06-14 15:24:24,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1089, PETRI_PLACES=160, PETRI_TRANSITIONS=133} [2024-06-14 15:24:24,525 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 129 predicate places. [2024-06-14 15:24:24,525 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 133 transitions, 1089 flow [2024-06-14 15:24:24,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:24:24,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:24:24,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:24:24,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 15:24:24,526 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-14 15:24:24,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:24:24,526 INFO L85 PathProgramCache]: Analyzing trace with hash -565433596, now seen corresponding path program 1 times [2024-06-14 15:24:24,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:24:24,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011261285] [2024-06-14 15:24:24,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:24:24,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:24:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:24:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:24:30,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:24:30,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011261285] [2024-06-14 15:24:30,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011261285] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:24:30,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:24:30,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:24:30,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321972516] [2024-06-14 15:24:30,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:24:30,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:24:30,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:24:30,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:24:30,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:24:30,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:24:30,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 133 transitions, 1089 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:24:30,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:24:30,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:24:30,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:24:30,868 INFO L124 PetriNetUnfolderBase]: 356/634 cut-off events. [2024-06-14 15:24:30,868 INFO L125 PetriNetUnfolderBase]: For 34146/34146 co-relation queries the response was YES. [2024-06-14 15:24:30,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3943 conditions, 634 events. 356/634 cut-off events. For 34146/34146 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2669 event pairs, 56 based on Foata normal form. 1/634 useless extension candidates. Maximal degree in co-relation 3862. Up to 596 conditions per place. [2024-06-14 15:24:30,873 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 125 selfloop transitions, 19 changer transitions 0/146 dead transitions. [2024-06-14 15:24:30,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 146 transitions, 1427 flow [2024-06-14 15:24:30,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:24:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:24:30,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2024-06-14 15:24:30,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.309375 [2024-06-14 15:24:30,875 INFO L175 Difference]: Start difference. First operand has 160 places, 133 transitions, 1089 flow. Second operand 10 states and 99 transitions. [2024-06-14 15:24:30,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 146 transitions, 1427 flow [2024-06-14 15:24:30,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 146 transitions, 1358 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-14 15:24:30,939 INFO L231 Difference]: Finished difference. Result has 161 places, 135 transitions, 1091 flow [2024-06-14 15:24:30,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1091, PETRI_PLACES=161, PETRI_TRANSITIONS=135} [2024-06-14 15:24:30,940 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 130 predicate places. [2024-06-14 15:24:30,940 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 135 transitions, 1091 flow [2024-06-14 15:24:30,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:24:30,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:24:30,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:24:30,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 15:24:30,940 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-14 15:24:30,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:24:30,941 INFO L85 PathProgramCache]: Analyzing trace with hash -565649077, now seen corresponding path program 4 times [2024-06-14 15:24:30,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:24:30,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619376269] [2024-06-14 15:24:30,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:24:30,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:24:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:24:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:24:36,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:24:36,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619376269] [2024-06-14 15:24:36,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619376269] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:24:36,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:24:36,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:24:36,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918503886] [2024-06-14 15:24:36,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:24:36,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:24:36,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:24:36,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:24:36,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:24:37,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:24:37,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 135 transitions, 1091 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:24:37,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:24:37,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:24:37,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:24:37,382 INFO L124 PetriNetUnfolderBase]: 360/642 cut-off events. [2024-06-14 15:24:37,382 INFO L125 PetriNetUnfolderBase]: For 36778/36778 co-relation queries the response was YES. [2024-06-14 15:24:37,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3983 conditions, 642 events. 360/642 cut-off events. For 36778/36778 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2718 event pairs, 44 based on Foata normal form. 2/643 useless extension candidates. Maximal degree in co-relation 3901. Up to 524 conditions per place. [2024-06-14 15:24:37,387 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 115 selfloop transitions, 37 changer transitions 0/154 dead transitions. [2024-06-14 15:24:37,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 154 transitions, 1463 flow [2024-06-14 15:24:37,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:24:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:24:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-14 15:24:37,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-14 15:24:37,388 INFO L175 Difference]: Start difference. First operand has 161 places, 135 transitions, 1091 flow. Second operand 10 states and 108 transitions. [2024-06-14 15:24:37,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 154 transitions, 1463 flow [2024-06-14 15:24:37,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 154 transitions, 1408 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 15:24:37,453 INFO L231 Difference]: Finished difference. Result has 163 places, 136 transitions, 1132 flow [2024-06-14 15:24:37,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1132, PETRI_PLACES=163, PETRI_TRANSITIONS=136} [2024-06-14 15:24:37,454 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 132 predicate places. [2024-06-14 15:24:37,454 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 136 transitions, 1132 flow [2024-06-14 15:24:37,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:24:37,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:24:37,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-14 15:24:37,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 15:24:37,455 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-14 15:24:37,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:24:37,455 INFO L85 PathProgramCache]: Analyzing trace with hash -571155607, now seen corresponding path program 5 times [2024-06-14 15:24:37,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:24:37,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985436359] [2024-06-14 15:24:37,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:24:37,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:24:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:24:42,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:24:42,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:24:42,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985436359] [2024-06-14 15:24:42,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985436359] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:24:42,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:24:42,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:24:42,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508191009] [2024-06-14 15:24:42,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:24:42,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:24:42,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:24:42,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:24:42,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:24:43,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:24:43,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 136 transitions, 1132 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:24:43,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:24:43,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:24:43,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:24:43,323 INFO L124 PetriNetUnfolderBase]: 364/650 cut-off events. [2024-06-14 15:24:43,323 INFO L125 PetriNetUnfolderBase]: For 38300/38300 co-relation queries the response was YES. [2024-06-14 15:24:43,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4101 conditions, 650 events. 364/650 cut-off events. For 38300/38300 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2761 event pairs, 48 based on Foata normal form. 2/651 useless extension candidates. Maximal degree in co-relation 4018. Up to 532 conditions per place. [2024-06-14 15:24:43,328 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 120 selfloop transitions, 33 changer transitions 0/155 dead transitions. [2024-06-14 15:24:43,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 155 transitions, 1508 flow [2024-06-14 15:24:43,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:24:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:24:43,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-14 15:24:43,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.340625 [2024-06-14 15:24:43,329 INFO L175 Difference]: Start difference. First operand has 163 places, 136 transitions, 1132 flow. Second operand 10 states and 109 transitions. [2024-06-14 15:24:43,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 155 transitions, 1508 flow [2024-06-14 15:24:43,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 155 transitions, 1422 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-14 15:24:43,409 INFO L231 Difference]: Finished difference. Result has 165 places, 137 transitions, 1136 flow [2024-06-14 15:24:43,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1136, PETRI_PLACES=165, PETRI_TRANSITIONS=137} [2024-06-14 15:24:43,410 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 134 predicate places. [2024-06-14 15:24:43,410 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 137 transitions, 1136 flow [2024-06-14 15:24:43,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:24:43,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:24:43,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:24:43,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 15:24:43,410 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-14 15:24:43,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:24:43,410 INFO L85 PathProgramCache]: Analyzing trace with hash -565433875, now seen corresponding path program 2 times [2024-06-14 15:24:43,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:24:43,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102834048] [2024-06-14 15:24:43,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:24:43,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:24:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:24:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:24:49,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:24:49,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102834048] [2024-06-14 15:24:49,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102834048] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:24:49,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:24:49,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:24:49,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940121178] [2024-06-14 15:24:49,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:24:49,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:24:49,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:24:49,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:24:49,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:24:49,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:24:49,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 137 transitions, 1136 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:24:49,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:24:49,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:24:49,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:24:49,518 INFO L124 PetriNetUnfolderBase]: 396/702 cut-off events. [2024-06-14 15:24:49,519 INFO L125 PetriNetUnfolderBase]: For 49089/49089 co-relation queries the response was YES. [2024-06-14 15:24:49,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4575 conditions, 702 events. 396/702 cut-off events. For 49089/49089 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3047 event pairs, 45 based on Foata normal form. 4/705 useless extension candidates. Maximal degree in co-relation 4491. Up to 486 conditions per place. [2024-06-14 15:24:49,524 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 107 selfloop transitions, 55 changer transitions 0/164 dead transitions. [2024-06-14 15:24:49,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 164 transitions, 1702 flow [2024-06-14 15:24:49,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:24:49,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:24:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-14 15:24:49,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3494318181818182 [2024-06-14 15:24:49,525 INFO L175 Difference]: Start difference. First operand has 165 places, 137 transitions, 1136 flow. Second operand 11 states and 123 transitions. [2024-06-14 15:24:49,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 164 transitions, 1702 flow [2024-06-14 15:24:49,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 164 transitions, 1622 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-14 15:24:49,607 INFO L231 Difference]: Finished difference. Result has 168 places, 142 transitions, 1237 flow [2024-06-14 15:24:49,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1237, PETRI_PLACES=168, PETRI_TRANSITIONS=142} [2024-06-14 15:24:49,608 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 137 predicate places. [2024-06-14 15:24:49,608 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 142 transitions, 1237 flow [2024-06-14 15:24:49,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:24:49,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:24:49,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:24:49,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 15:24:49,608 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-14 15:24:49,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:24:49,609 INFO L85 PathProgramCache]: Analyzing trace with hash -565441315, now seen corresponding path program 3 times [2024-06-14 15:24:49,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:24:49,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890173322] [2024-06-14 15:24:49,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:24:49,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:24:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:24:55,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:24:55,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:24:55,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890173322] [2024-06-14 15:24:55,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890173322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:24:55,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:24:55,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:24:55,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205319709] [2024-06-14 15:24:55,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:24:55,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:24:55,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:24:55,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:24:55,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:24:55,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:24:55,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 142 transitions, 1237 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:24:55,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:24:55,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:24:55,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:24:55,683 INFO L124 PetriNetUnfolderBase]: 402/712 cut-off events. [2024-06-14 15:24:55,683 INFO L125 PetriNetUnfolderBase]: For 47537/47537 co-relation queries the response was YES. [2024-06-14 15:24:55,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4758 conditions, 712 events. 402/712 cut-off events. For 47537/47537 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3105 event pairs, 45 based on Foata normal form. 2/713 useless extension candidates. Maximal degree in co-relation 4673. Up to 488 conditions per place. [2024-06-14 15:24:55,689 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 111 selfloop transitions, 53 changer transitions 0/166 dead transitions. [2024-06-14 15:24:55,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 166 transitions, 1785 flow [2024-06-14 15:24:55,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:24:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:24:55,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-14 15:24:55,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-14 15:24:55,689 INFO L175 Difference]: Start difference. First operand has 168 places, 142 transitions, 1237 flow. Second operand 11 states and 124 transitions. [2024-06-14 15:24:55,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 166 transitions, 1785 flow [2024-06-14 15:24:55,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 166 transitions, 1681 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-14 15:24:55,769 INFO L231 Difference]: Finished difference. Result has 172 places, 144 transitions, 1278 flow [2024-06-14 15:24:55,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1278, PETRI_PLACES=172, PETRI_TRANSITIONS=144} [2024-06-14 15:24:55,769 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 141 predicate places. [2024-06-14 15:24:55,769 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 144 transitions, 1278 flow [2024-06-14 15:24:55,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:24:55,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:24:55,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-14 15:24:55,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 15:24:55,769 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-14 15:24:55,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:24:55,770 INFO L85 PathProgramCache]: Analyzing trace with hash -565643125, now seen corresponding path program 4 times [2024-06-14 15:24:55,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:24:55,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191731126] [2024-06-14 15:24:55,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:24:55,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:24:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:25:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:25:01,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:25:01,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191731126] [2024-06-14 15:25:01,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191731126] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:25:01,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:25:01,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:25:01,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414316065] [2024-06-14 15:25:01,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:25:01,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:25:01,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:25:01,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:25:01,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:25:01,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:25:01,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 144 transitions, 1278 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:01,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:25:01,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:25:01,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:25:01,874 INFO L124 PetriNetUnfolderBase]: 408/722 cut-off events. [2024-06-14 15:25:01,874 INFO L125 PetriNetUnfolderBase]: For 48946/48946 co-relation queries the response was YES. [2024-06-14 15:25:01,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4883 conditions, 722 events. 408/722 cut-off events. For 48946/48946 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3151 event pairs, 49 based on Foata normal form. 2/723 useless extension candidates. Maximal degree in co-relation 4796. Up to 490 conditions per place. [2024-06-14 15:25:01,879 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 114 selfloop transitions, 52 changer transitions 0/168 dead transitions. [2024-06-14 15:25:01,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 168 transitions, 1834 flow [2024-06-14 15:25:01,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:25:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:25:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-14 15:25:01,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35511363636363635 [2024-06-14 15:25:01,880 INFO L175 Difference]: Start difference. First operand has 172 places, 144 transitions, 1278 flow. Second operand 11 states and 125 transitions. [2024-06-14 15:25:01,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 168 transitions, 1834 flow [2024-06-14 15:25:01,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 168 transitions, 1726 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 15:25:01,976 INFO L231 Difference]: Finished difference. Result has 175 places, 146 transitions, 1313 flow [2024-06-14 15:25:01,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1313, PETRI_PLACES=175, PETRI_TRANSITIONS=146} [2024-06-14 15:25:01,977 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 144 predicate places. [2024-06-14 15:25:01,977 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 146 transitions, 1313 flow [2024-06-14 15:25:01,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:01,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:25:01,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:25:01,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 15:25:01,978 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-14 15:25:01,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:25:01,978 INFO L85 PathProgramCache]: Analyzing trace with hash -571159327, now seen corresponding path program 6 times [2024-06-14 15:25:01,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:25:01,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135805092] [2024-06-14 15:25:01,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:25:01,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:25:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:25:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:25:07,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:25:07,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135805092] [2024-06-14 15:25:07,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135805092] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:25:07,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:25:07,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:25:07,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603066088] [2024-06-14 15:25:07,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:25:07,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:25:07,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:25:07,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:25:07,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:25:07,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:25:07,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 146 transitions, 1313 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:07,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:25:07,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:25:07,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:25:08,077 INFO L124 PetriNetUnfolderBase]: 412/730 cut-off events. [2024-06-14 15:25:08,078 INFO L125 PetriNetUnfolderBase]: For 50814/50814 co-relation queries the response was YES. [2024-06-14 15:25:08,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4977 conditions, 730 events. 412/730 cut-off events. For 50814/50814 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3213 event pairs, 53 based on Foata normal form. 2/731 useless extension candidates. Maximal degree in co-relation 4889. Up to 592 conditions per place. [2024-06-14 15:25:08,083 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 128 selfloop transitions, 35 changer transitions 0/165 dead transitions. [2024-06-14 15:25:08,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 165 transitions, 1709 flow [2024-06-14 15:25:08,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:25:08,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:25:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-14 15:25:08,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.340625 [2024-06-14 15:25:08,084 INFO L175 Difference]: Start difference. First operand has 175 places, 146 transitions, 1313 flow. Second operand 10 states and 109 transitions. [2024-06-14 15:25:08,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 165 transitions, 1709 flow [2024-06-14 15:25:08,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 165 transitions, 1607 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-14 15:25:08,187 INFO L231 Difference]: Finished difference. Result has 177 places, 147 transitions, 1307 flow [2024-06-14 15:25:08,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1307, PETRI_PLACES=177, PETRI_TRANSITIONS=147} [2024-06-14 15:25:08,188 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 146 predicate places. [2024-06-14 15:25:08,188 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 147 transitions, 1307 flow [2024-06-14 15:25:08,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:08,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:25:08,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:25:08,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 15:25:08,189 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-14 15:25:08,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:25:08,189 INFO L85 PathProgramCache]: Analyzing trace with hash -571005505, now seen corresponding path program 5 times [2024-06-14 15:25:08,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:25:08,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256480453] [2024-06-14 15:25:08,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:25:08,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:25:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:25:13,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:25:13,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:25:13,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256480453] [2024-06-14 15:25:13,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256480453] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:25:13,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:25:13,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:25:13,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512708132] [2024-06-14 15:25:13,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:25:13,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:25:13,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:25:13,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:25:13,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:25:13,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:25:13,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 147 transitions, 1307 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:13,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:25:13,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:25:13,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:25:14,366 INFO L124 PetriNetUnfolderBase]: 413/732 cut-off events. [2024-06-14 15:25:14,367 INFO L125 PetriNetUnfolderBase]: For 50710/50710 co-relation queries the response was YES. [2024-06-14 15:25:14,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4929 conditions, 732 events. 413/732 cut-off events. For 50710/50710 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3214 event pairs, 59 based on Foata normal form. 2/733 useless extension candidates. Maximal degree in co-relation 4840. Up to 500 conditions per place. [2024-06-14 15:25:14,373 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 119 selfloop transitions, 50 changer transitions 0/171 dead transitions. [2024-06-14 15:25:14,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 171 transitions, 1877 flow [2024-06-14 15:25:14,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:25:14,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:25:14,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-14 15:25:14,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35795454545454547 [2024-06-14 15:25:14,382 INFO L175 Difference]: Start difference. First operand has 177 places, 147 transitions, 1307 flow. Second operand 11 states and 126 transitions. [2024-06-14 15:25:14,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 171 transitions, 1877 flow [2024-06-14 15:25:14,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 171 transitions, 1791 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 15:25:14,491 INFO L231 Difference]: Finished difference. Result has 180 places, 149 transitions, 1362 flow [2024-06-14 15:25:14,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1362, PETRI_PLACES=180, PETRI_TRANSITIONS=149} [2024-06-14 15:25:14,491 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 149 predicate places. [2024-06-14 15:25:14,491 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 149 transitions, 1362 flow [2024-06-14 15:25:14,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:14,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:25:14,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:25:14,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 15:25:14,492 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-14 15:25:14,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:25:14,492 INFO L85 PathProgramCache]: Analyzing trace with hash 614840294, now seen corresponding path program 2 times [2024-06-14 15:25:14,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:25:14,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255277123] [2024-06-14 15:25:14,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:25:14,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:25:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:25:20,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:25:20,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:25:20,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255277123] [2024-06-14 15:25:20,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255277123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:25:20,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:25:20,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:25:20,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294786176] [2024-06-14 15:25:20,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:25:20,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:25:20,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:25:20,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:25:20,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:25:20,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:25:20,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 149 transitions, 1362 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:20,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:25:20,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:25:20,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:25:20,768 INFO L124 PetriNetUnfolderBase]: 416/738 cut-off events. [2024-06-14 15:25:20,769 INFO L125 PetriNetUnfolderBase]: For 50551/50551 co-relation queries the response was YES. [2024-06-14 15:25:20,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5024 conditions, 738 events. 416/738 cut-off events. For 50551/50551 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3257 event pairs, 69 based on Foata normal form. 1/736 useless extension candidates. Maximal degree in co-relation 4934. Up to 657 conditions per place. [2024-06-14 15:25:20,774 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 120 selfloop transitions, 38 changer transitions 0/160 dead transitions. [2024-06-14 15:25:20,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 160 transitions, 1728 flow [2024-06-14 15:25:20,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:25:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:25:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2024-06-14 15:25:20,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.321875 [2024-06-14 15:25:20,776 INFO L175 Difference]: Start difference. First operand has 180 places, 149 transitions, 1362 flow. Second operand 10 states and 103 transitions. [2024-06-14 15:25:20,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 160 transitions, 1728 flow [2024-06-14 15:25:20,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 160 transitions, 1632 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 15:25:20,880 INFO L231 Difference]: Finished difference. Result has 182 places, 151 transitions, 1381 flow [2024-06-14 15:25:20,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1266, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1381, PETRI_PLACES=182, PETRI_TRANSITIONS=151} [2024-06-14 15:25:20,881 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 151 predicate places. [2024-06-14 15:25:20,881 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 151 transitions, 1381 flow [2024-06-14 15:25:20,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:20,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:25:20,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:25:20,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 15:25:20,882 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-14 15:25:20,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:25:20,882 INFO L85 PathProgramCache]: Analyzing trace with hash 614624813, now seen corresponding path program 7 times [2024-06-14 15:25:20,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:25:20,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251632866] [2024-06-14 15:25:20,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:25:20,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:25:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:25:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:25:26,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:25:26,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251632866] [2024-06-14 15:25:26,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251632866] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:25:26,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:25:26,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:25:26,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530605819] [2024-06-14 15:25:26,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:25:26,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:25:26,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:25:26,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:25:26,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:25:26,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:25:26,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 151 transitions, 1381 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:26,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:25:26,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:25:26,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:25:27,291 INFO L124 PetriNetUnfolderBase]: 420/746 cut-off events. [2024-06-14 15:25:27,291 INFO L125 PetriNetUnfolderBase]: For 53622/53622 co-relation queries the response was YES. [2024-06-14 15:25:27,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5070 conditions, 746 events. 420/746 cut-off events. For 53622/53622 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3295 event pairs, 45 based on Foata normal form. 2/745 useless extension candidates. Maximal degree in co-relation 4979. Up to 586 conditions per place. [2024-06-14 15:25:27,296 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 116 selfloop transitions, 50 changer transitions 0/168 dead transitions. [2024-06-14 15:25:27,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 168 transitions, 1781 flow [2024-06-14 15:25:27,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:25:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:25:27,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-14 15:25:27,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-14 15:25:27,297 INFO L175 Difference]: Start difference. First operand has 182 places, 151 transitions, 1381 flow. Second operand 10 states and 108 transitions. [2024-06-14 15:25:27,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 168 transitions, 1781 flow [2024-06-14 15:25:27,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 168 transitions, 1682 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 15:25:27,400 INFO L231 Difference]: Finished difference. Result has 184 places, 152 transitions, 1410 flow [2024-06-14 15:25:27,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1410, PETRI_PLACES=184, PETRI_TRANSITIONS=152} [2024-06-14 15:25:27,400 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 153 predicate places. [2024-06-14 15:25:27,401 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 152 transitions, 1410 flow [2024-06-14 15:25:27,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:27,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:25:27,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:25:27,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 15:25:27,401 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-14 15:25:27,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:25:27,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2139623755, now seen corresponding path program 8 times [2024-06-14 15:25:27,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:25:27,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562824815] [2024-06-14 15:25:27,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:25:27,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:25:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:25:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:25:33,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:25:33,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562824815] [2024-06-14 15:25:33,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562824815] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:25:33,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:25:33,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:25:33,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637138491] [2024-06-14 15:25:33,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:25:33,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:25:33,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:25:33,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:25:33,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:25:33,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:25:33,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 152 transitions, 1410 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:33,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:25:33,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:25:33,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:25:33,676 INFO L124 PetriNetUnfolderBase]: 424/754 cut-off events. [2024-06-14 15:25:33,676 INFO L125 PetriNetUnfolderBase]: For 55701/55701 co-relation queries the response was YES. [2024-06-14 15:25:33,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5193 conditions, 754 events. 424/754 cut-off events. For 55701/55701 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3344 event pairs, 53 based on Foata normal form. 2/753 useless extension candidates. Maximal degree in co-relation 5101. Up to 594 conditions per place. [2024-06-14 15:25:33,682 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 124 selfloop transitions, 44 changer transitions 0/170 dead transitions. [2024-06-14 15:25:33,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 170 transitions, 1820 flow [2024-06-14 15:25:33,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:25:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:25:33,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-14 15:25:33,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.346875 [2024-06-14 15:25:33,684 INFO L175 Difference]: Start difference. First operand has 184 places, 152 transitions, 1410 flow. Second operand 10 states and 111 transitions. [2024-06-14 15:25:33,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 170 transitions, 1820 flow [2024-06-14 15:25:33,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 170 transitions, 1702 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 15:25:33,811 INFO L231 Difference]: Finished difference. Result has 186 places, 153 transitions, 1410 flow [2024-06-14 15:25:33,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1410, PETRI_PLACES=186, PETRI_TRANSITIONS=153} [2024-06-14 15:25:33,812 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 155 predicate places. [2024-06-14 15:25:33,812 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 153 transitions, 1410 flow [2024-06-14 15:25:33,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:33,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:25:33,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:25:33,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 15:25:33,812 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-14 15:25:33,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:25:33,813 INFO L85 PathProgramCache]: Analyzing trace with hash 2139838957, now seen corresponding path program 6 times [2024-06-14 15:25:33,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:25:33,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978950515] [2024-06-14 15:25:33,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:25:33,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:25:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:25:39,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:25:39,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:25:39,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978950515] [2024-06-14 15:25:39,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978950515] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:25:39,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:25:39,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:25:39,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059538529] [2024-06-14 15:25:39,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:25:39,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:25:39,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:25:39,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:25:39,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:25:39,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:25:39,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 153 transitions, 1410 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:39,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:25:39,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:25:39,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:25:39,918 INFO L124 PetriNetUnfolderBase]: 463/818 cut-off events. [2024-06-14 15:25:39,918 INFO L125 PetriNetUnfolderBase]: For 71120/71120 co-relation queries the response was YES. [2024-06-14 15:25:39,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5905 conditions, 818 events. 463/818 cut-off events. For 71120/71120 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3691 event pairs, 65 based on Foata normal form. 4/819 useless extension candidates. Maximal degree in co-relation 5812. Up to 364 conditions per place. [2024-06-14 15:25:39,924 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 113 selfloop transitions, 72 changer transitions 0/187 dead transitions. [2024-06-14 15:25:39,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 187 transitions, 2438 flow [2024-06-14 15:25:39,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:25:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:25:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-14 15:25:39,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-14 15:25:39,925 INFO L175 Difference]: Start difference. First operand has 186 places, 153 transitions, 1410 flow. Second operand 11 states and 134 transitions. [2024-06-14 15:25:39,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 187 transitions, 2438 flow [2024-06-14 15:25:40,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 187 transitions, 2330 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 15:25:40,041 INFO L231 Difference]: Finished difference. Result has 190 places, 161 transitions, 1602 flow [2024-06-14 15:25:40,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1602, PETRI_PLACES=190, PETRI_TRANSITIONS=161} [2024-06-14 15:25:40,042 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 159 predicate places. [2024-06-14 15:25:40,042 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 161 transitions, 1602 flow [2024-06-14 15:25:40,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:40,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:25:40,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:25:40,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 15:25:40,042 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-14 15:25:40,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:25:40,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2139839236, now seen corresponding path program 3 times [2024-06-14 15:25:40,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:25:40,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934141246] [2024-06-14 15:25:40,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:25:40,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:25:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:25:45,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:25:45,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:25:45,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934141246] [2024-06-14 15:25:45,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934141246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:25:45,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:25:45,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:25:45,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739312187] [2024-06-14 15:25:45,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:25:45,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:25:45,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:25:45,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:25:45,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:25:45,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:25:45,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 161 transitions, 1602 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:45,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:25:45,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:25:45,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:25:46,196 INFO L124 PetriNetUnfolderBase]: 459/811 cut-off events. [2024-06-14 15:25:46,196 INFO L125 PetriNetUnfolderBase]: For 65198/65198 co-relation queries the response was YES. [2024-06-14 15:25:46,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5947 conditions, 811 events. 459/811 cut-off events. For 65198/65198 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3658 event pairs, 81 based on Foata normal form. 1/809 useless extension candidates. Maximal degree in co-relation 5852. Up to 730 conditions per place. [2024-06-14 15:25:46,202 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 132 selfloop transitions, 37 changer transitions 0/171 dead transitions. [2024-06-14 15:25:46,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 171 transitions, 1973 flow [2024-06-14 15:25:46,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:25:46,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:25:46,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2024-06-14 15:25:46,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.325 [2024-06-14 15:25:46,203 INFO L175 Difference]: Start difference. First operand has 190 places, 161 transitions, 1602 flow. Second operand 10 states and 104 transitions. [2024-06-14 15:25:46,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 171 transitions, 1973 flow [2024-06-14 15:25:46,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 171 transitions, 1811 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-06-14 15:25:46,325 INFO L231 Difference]: Finished difference. Result has 193 places, 162 transitions, 1534 flow [2024-06-14 15:25:46,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1534, PETRI_PLACES=193, PETRI_TRANSITIONS=162} [2024-06-14 15:25:46,325 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 162 predicate places. [2024-06-14 15:25:46,325 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 162 transitions, 1534 flow [2024-06-14 15:25:46,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:46,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:25:46,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:25:46,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 15:25:46,325 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-14 15:25:46,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:25:46,326 INFO L85 PathProgramCache]: Analyzing trace with hash 614840015, now seen corresponding path program 7 times [2024-06-14 15:25:46,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:25:46,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476134017] [2024-06-14 15:25:46,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:25:46,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:25:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:25:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:25:51,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:25:51,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476134017] [2024-06-14 15:25:51,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476134017] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:25:51,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:25:51,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:25:51,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927706686] [2024-06-14 15:25:51,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:25:51,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:25:51,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:25:51,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:25:51,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:25:52,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:25:52,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 162 transitions, 1534 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:52,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:25:52,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:25:52,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:25:52,417 INFO L124 PetriNetUnfolderBase]: 491/863 cut-off events. [2024-06-14 15:25:52,417 INFO L125 PetriNetUnfolderBase]: For 81832/81832 co-relation queries the response was YES. [2024-06-14 15:25:52,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6411 conditions, 863 events. 491/863 cut-off events. For 81832/81832 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3951 event pairs, 56 based on Foata normal form. 4/864 useless extension candidates. Maximal degree in co-relation 6315. Up to 380 conditions per place. [2024-06-14 15:25:52,424 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 110 selfloop transitions, 81 changer transitions 0/193 dead transitions. [2024-06-14 15:25:52,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 193 transitions, 2542 flow [2024-06-14 15:25:52,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:25:52,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:25:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-14 15:25:52,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3778409090909091 [2024-06-14 15:25:52,425 INFO L175 Difference]: Start difference. First operand has 193 places, 162 transitions, 1534 flow. Second operand 11 states and 133 transitions. [2024-06-14 15:25:52,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 193 transitions, 2542 flow [2024-06-14 15:25:52,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 193 transitions, 2447 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-14 15:25:52,545 INFO L231 Difference]: Finished difference. Result has 196 places, 167 transitions, 1690 flow [2024-06-14 15:25:52,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1690, PETRI_PLACES=196, PETRI_TRANSITIONS=167} [2024-06-14 15:25:52,545 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 165 predicate places. [2024-06-14 15:25:52,545 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 167 transitions, 1690 flow [2024-06-14 15:25:52,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:52,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:25:52,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:25:52,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 15:25:52,546 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-14 15:25:52,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:25:52,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1481416937, now seen corresponding path program 8 times [2024-06-14 15:25:52,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:25:52,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032844761] [2024-06-14 15:25:52,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:25:52,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:25:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:25:58,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:25:58,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:25:58,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032844761] [2024-06-14 15:25:58,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032844761] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:25:58,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:25:58,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:25:58,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525725422] [2024-06-14 15:25:58,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:25:58,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:25:58,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:25:58,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:25:58,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:25:58,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:25:58,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 167 transitions, 1690 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:58,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:25:58,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:25:58,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:25:58,681 INFO L124 PetriNetUnfolderBase]: 497/873 cut-off events. [2024-06-14 15:25:58,681 INFO L125 PetriNetUnfolderBase]: For 79502/79502 co-relation queries the response was YES. [2024-06-14 15:25:58,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6700 conditions, 873 events. 497/873 cut-off events. For 79502/79502 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4007 event pairs, 61 based on Foata normal form. 2/872 useless extension candidates. Maximal degree in co-relation 6603. Up to 382 conditions per place. [2024-06-14 15:25:58,689 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 111 selfloop transitions, 82 changer transitions 0/195 dead transitions. [2024-06-14 15:25:58,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 195 transitions, 2678 flow [2024-06-14 15:25:58,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:25:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:25:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-14 15:25:58,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-14 15:25:58,690 INFO L175 Difference]: Start difference. First operand has 196 places, 167 transitions, 1690 flow. Second operand 11 states and 134 transitions. [2024-06-14 15:25:58,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 195 transitions, 2678 flow [2024-06-14 15:25:58,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 195 transitions, 2471 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-06-14 15:25:58,832 INFO L231 Difference]: Finished difference. Result has 199 places, 169 transitions, 1698 flow [2024-06-14 15:25:58,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1698, PETRI_PLACES=199, PETRI_TRANSITIONS=169} [2024-06-14 15:25:58,832 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 168 predicate places. [2024-06-14 15:25:58,832 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 169 transitions, 1698 flow [2024-06-14 15:25:58,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:25:58,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:25:58,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:25:58,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 15:25:58,833 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-14 15:25:58,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:25:58,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1481215127, now seen corresponding path program 9 times [2024-06-14 15:25:58,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:25:58,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355426201] [2024-06-14 15:25:58,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:25:58,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:25:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:26:03,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:26:03,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:26:03,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355426201] [2024-06-14 15:26:03,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355426201] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:26:03,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:26:03,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:26:03,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655699223] [2024-06-14 15:26:03,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:26:03,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:26:03,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:26:03,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:26:03,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:26:03,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:26:03,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 169 transitions, 1698 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:03,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:26:03,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:26:03,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:26:04,142 INFO L124 PetriNetUnfolderBase]: 503/884 cut-off events. [2024-06-14 15:26:04,143 INFO L125 PetriNetUnfolderBase]: For 81958/81958 co-relation queries the response was YES. [2024-06-14 15:26:04,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6741 conditions, 884 events. 503/884 cut-off events. For 81958/81958 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4077 event pairs, 63 based on Foata normal form. 2/882 useless extension candidates. Maximal degree in co-relation 6643. Up to 390 conditions per place. [2024-06-14 15:26:04,150 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 104 selfloop transitions, 92 changer transitions 0/198 dead transitions. [2024-06-14 15:26:04,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 198 transitions, 2730 flow [2024-06-14 15:26:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:26:04,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:26:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-14 15:26:04,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-14 15:26:04,151 INFO L175 Difference]: Start difference. First operand has 199 places, 169 transitions, 1698 flow. Second operand 11 states and 131 transitions. [2024-06-14 15:26:04,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 198 transitions, 2730 flow [2024-06-14 15:26:04,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 198 transitions, 2541 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-14 15:26:04,289 INFO L231 Difference]: Finished difference. Result has 205 places, 177 transitions, 1898 flow [2024-06-14 15:26:04,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1516, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1898, PETRI_PLACES=205, PETRI_TRANSITIONS=177} [2024-06-14 15:26:04,289 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 174 predicate places. [2024-06-14 15:26:04,289 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 177 transitions, 1898 flow [2024-06-14 15:26:04,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:04,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:04,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:26:04,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 15:26:04,289 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-14 15:26:04,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:04,290 INFO L85 PathProgramCache]: Analyzing trace with hash 871340525, now seen corresponding path program 10 times [2024-06-14 15:26:04,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:04,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486958843] [2024-06-14 15:26:04,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:04,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:26:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:26:09,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:26:09,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486958843] [2024-06-14 15:26:09,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486958843] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:26:09,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:26:09,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:26:09,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391310591] [2024-06-14 15:26:09,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:26:09,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:26:09,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:26:09,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:26:09,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:26:10,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:26:10,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 177 transitions, 1898 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:10,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:26:10,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:26:10,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:26:10,422 INFO L124 PetriNetUnfolderBase]: 542/947 cut-off events. [2024-06-14 15:26:10,422 INFO L125 PetriNetUnfolderBase]: For 99297/99297 co-relation queries the response was YES. [2024-06-14 15:26:10,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7762 conditions, 947 events. 542/947 cut-off events. For 99297/99297 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4417 event pairs, 59 based on Foata normal form. 4/948 useless extension candidates. Maximal degree in co-relation 7660. Up to 416 conditions per place. [2024-06-14 15:26:10,430 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 107 selfloop transitions, 98 changer transitions 0/207 dead transitions. [2024-06-14 15:26:10,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 207 transitions, 2989 flow [2024-06-14 15:26:10,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:26:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:26:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-14 15:26:10,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:26:10,431 INFO L175 Difference]: Start difference. First operand has 205 places, 177 transitions, 1898 flow. Second operand 11 states and 132 transitions. [2024-06-14 15:26:10,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 207 transitions, 2989 flow [2024-06-14 15:26:10,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 207 transitions, 2813 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-14 15:26:10,605 INFO L231 Difference]: Finished difference. Result has 212 places, 184 transitions, 2092 flow [2024-06-14 15:26:10,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1733, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2092, PETRI_PLACES=212, PETRI_TRANSITIONS=184} [2024-06-14 15:26:10,605 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 181 predicate places. [2024-06-14 15:26:10,605 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 184 transitions, 2092 flow [2024-06-14 15:26:10,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:10,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:10,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:26:10,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 15:26:10,606 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-14 15:26:10,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:10,606 INFO L85 PathProgramCache]: Analyzing trace with hash 871333085, now seen corresponding path program 11 times [2024-06-14 15:26:10,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:10,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545192906] [2024-06-14 15:26:10,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:10,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:26:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:26:16,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:26:16,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545192906] [2024-06-14 15:26:16,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545192906] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:26:16,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:26:16,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:26:16,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072118799] [2024-06-14 15:26:16,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:26:16,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:26:16,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:26:16,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:26:16,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:26:16,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:26:16,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 184 transitions, 2092 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:16,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:26:16,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:26:16,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:26:16,748 INFO L124 PetriNetUnfolderBase]: 538/941 cut-off events. [2024-06-14 15:26:16,749 INFO L125 PetriNetUnfolderBase]: For 93993/93993 co-relation queries the response was YES. [2024-06-14 15:26:16,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7640 conditions, 941 events. 538/941 cut-off events. For 93993/93993 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4408 event pairs, 50 based on Foata normal form. 2/940 useless extension candidates. Maximal degree in co-relation 7535. Up to 415 conditions per place. [2024-06-14 15:26:16,757 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 103 selfloop transitions, 102 changer transitions 0/207 dead transitions. [2024-06-14 15:26:16,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 207 transitions, 3036 flow [2024-06-14 15:26:16,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:26:16,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:26:16,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-14 15:26:16,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-14 15:26:16,758 INFO L175 Difference]: Start difference. First operand has 212 places, 184 transitions, 2092 flow. Second operand 11 states and 131 transitions. [2024-06-14 15:26:16,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 207 transitions, 3036 flow [2024-06-14 15:26:16,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 207 transitions, 2788 flow, removed 29 selfloop flow, removed 8 redundant places. [2024-06-14 15:26:16,965 INFO L231 Difference]: Finished difference. Result has 215 places, 185 transitions, 2081 flow [2024-06-14 15:26:16,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1844, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2081, PETRI_PLACES=215, PETRI_TRANSITIONS=185} [2024-06-14 15:26:16,966 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 184 predicate places. [2024-06-14 15:26:16,966 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 185 transitions, 2081 flow [2024-06-14 15:26:16,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:16,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:16,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:26:16,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 15:26:16,966 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-14 15:26:16,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:16,966 INFO L85 PathProgramCache]: Analyzing trace with hash 880537295, now seen corresponding path program 12 times [2024-06-14 15:26:16,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:16,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350759573] [2024-06-14 15:26:16,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:16,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:26:22,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:26:22,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:26:22,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350759573] [2024-06-14 15:26:22,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350759573] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:26:22,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:26:22,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:26:22,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266591694] [2024-06-14 15:26:22,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:26:22,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:26:22,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:26:22,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:26:22,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:26:22,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:26:22,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 185 transitions, 2081 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:22,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:26:22,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:26:22,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:26:23,196 INFO L124 PetriNetUnfolderBase]: 532/932 cut-off events. [2024-06-14 15:26:23,196 INFO L125 PetriNetUnfolderBase]: For 90728/90728 co-relation queries the response was YES. [2024-06-14 15:26:23,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7249 conditions, 932 events. 532/932 cut-off events. For 90728/90728 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4362 event pairs, 91 based on Foata normal form. 4/935 useless extension candidates. Maximal degree in co-relation 7143. Up to 873 conditions per place. [2024-06-14 15:26:23,203 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 175 selfloop transitions, 20 changer transitions 0/197 dead transitions. [2024-06-14 15:26:23,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 197 transitions, 2643 flow [2024-06-14 15:26:23,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:26:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:26:23,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2024-06-14 15:26:23,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.321875 [2024-06-14 15:26:23,204 INFO L175 Difference]: Start difference. First operand has 215 places, 185 transitions, 2081 flow. Second operand 10 states and 103 transitions. [2024-06-14 15:26:23,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 197 transitions, 2643 flow [2024-06-14 15:26:23,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 197 transitions, 2370 flow, removed 37 selfloop flow, removed 8 redundant places. [2024-06-14 15:26:23,421 INFO L231 Difference]: Finished difference. Result has 217 places, 185 transitions, 1855 flow [2024-06-14 15:26:23,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1855, PETRI_PLACES=217, PETRI_TRANSITIONS=185} [2024-06-14 15:26:23,421 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 186 predicate places. [2024-06-14 15:26:23,422 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 185 transitions, 1855 flow [2024-06-14 15:26:23,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:23,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:23,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:26:23,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 15:26:23,422 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-14 15:26:23,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:23,422 INFO L85 PathProgramCache]: Analyzing trace with hash 871340804, now seen corresponding path program 4 times [2024-06-14 15:26:23,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:23,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866363721] [2024-06-14 15:26:23,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:23,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:26:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:26:29,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:26:29,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866363721] [2024-06-14 15:26:29,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866363721] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:26:29,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:26:29,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:26:29,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986835711] [2024-06-14 15:26:29,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:26:29,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:26:29,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:26:29,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:26:29,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:26:29,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:26:29,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 185 transitions, 1855 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:29,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:26:29,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:26:29,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:26:29,675 INFO L124 PetriNetUnfolderBase]: 528/926 cut-off events. [2024-06-14 15:26:29,675 INFO L125 PetriNetUnfolderBase]: For 84611/84611 co-relation queries the response was YES. [2024-06-14 15:26:29,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6811 conditions, 926 events. 528/926 cut-off events. For 84611/84611 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4322 event pairs, 90 based on Foata normal form. 1/924 useless extension candidates. Maximal degree in co-relation 6704. Up to 845 conditions per place. [2024-06-14 15:26:29,683 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 153 selfloop transitions, 40 changer transitions 0/195 dead transitions. [2024-06-14 15:26:29,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 195 transitions, 2275 flow [2024-06-14 15:26:29,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:26:29,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:26:29,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-14 15:26:29,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31875 [2024-06-14 15:26:29,684 INFO L175 Difference]: Start difference. First operand has 217 places, 185 transitions, 1855 flow. Second operand 10 states and 102 transitions. [2024-06-14 15:26:29,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 195 transitions, 2275 flow [2024-06-14 15:26:29,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 195 transitions, 2205 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-14 15:26:29,879 INFO L231 Difference]: Finished difference. Result has 217 places, 186 transitions, 1886 flow [2024-06-14 15:26:29,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1786, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1886, PETRI_PLACES=217, PETRI_TRANSITIONS=186} [2024-06-14 15:26:29,880 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 186 predicate places. [2024-06-14 15:26:29,880 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 186 transitions, 1886 flow [2024-06-14 15:26:29,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:29,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:29,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:26:29,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 15:26:29,880 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-14 15:26:29,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:29,880 INFO L85 PathProgramCache]: Analyzing trace with hash 880537574, now seen corresponding path program 5 times [2024-06-14 15:26:29,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:29,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024594617] [2024-06-14 15:26:29,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:29,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:26:35,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-14 15:26:35,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:26:35,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024594617] [2024-06-14 15:26:35,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024594617] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:26:35,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:26:35,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:26:35,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857423564] [2024-06-14 15:26:35,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:26:35,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:26:35,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:26:35,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:26:35,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:26:35,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:26:35,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 186 transitions, 1886 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:35,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:26:35,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:26:35,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:26:36,272 INFO L124 PetriNetUnfolderBase]: 531/930 cut-off events. [2024-06-14 15:26:36,272 INFO L125 PetriNetUnfolderBase]: For 87029/87029 co-relation queries the response was YES. [2024-06-14 15:26:36,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6876 conditions, 930 events. 531/930 cut-off events. For 87029/87029 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4317 event pairs, 94 based on Foata normal form. 1/930 useless extension candidates. Maximal degree in co-relation 6769. Up to 902 conditions per place. [2024-06-14 15:26:36,282 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 179 selfloop transitions, 16 changer transitions 0/197 dead transitions. [2024-06-14 15:26:36,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 197 transitions, 2336 flow [2024-06-14 15:26:36,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:26:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:26:36,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2024-06-14 15:26:36,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3 [2024-06-14 15:26:36,284 INFO L175 Difference]: Start difference. First operand has 217 places, 186 transitions, 1886 flow. Second operand 10 states and 96 transitions. [2024-06-14 15:26:36,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 197 transitions, 2336 flow [2024-06-14 15:26:36,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 197 transitions, 2235 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-14 15:26:36,469 INFO L231 Difference]: Finished difference. Result has 219 places, 188 transitions, 1866 flow [2024-06-14 15:26:36,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1785, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1866, PETRI_PLACES=219, PETRI_TRANSITIONS=188} [2024-06-14 15:26:36,470 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 188 predicate places. [2024-06-14 15:26:36,470 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 188 transitions, 1866 flow [2024-06-14 15:26:36,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:36,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:36,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:26:36,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 15:26:36,471 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-14 15:26:36,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:36,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2139831517, now seen corresponding path program 13 times [2024-06-14 15:26:36,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:36,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203013328] [2024-06-14 15:26:36,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:36,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:26:42,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:26:42,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:26:42,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203013328] [2024-06-14 15:26:42,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203013328] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:26:42,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:26:42,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:26:42,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682374818] [2024-06-14 15:26:42,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:26:42,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:26:42,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:26:42,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:26:42,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:26:42,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:26:42,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 188 transitions, 1866 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:42,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:26:42,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:26:42,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:26:42,608 INFO L124 PetriNetUnfolderBase]: 537/941 cut-off events. [2024-06-14 15:26:42,608 INFO L125 PetriNetUnfolderBase]: For 92185/92185 co-relation queries the response was YES. [2024-06-14 15:26:42,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6947 conditions, 941 events. 537/941 cut-off events. For 92185/92185 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4402 event pairs, 74 based on Foata normal form. 2/940 useless extension candidates. Maximal degree in co-relation 6839. Up to 414 conditions per place. [2024-06-14 15:26:42,616 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 122 selfloop transitions, 89 changer transitions 0/213 dead transitions. [2024-06-14 15:26:42,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 213 transitions, 2891 flow [2024-06-14 15:26:42,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:26:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:26:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-14 15:26:42,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-14 15:26:42,618 INFO L175 Difference]: Start difference. First operand has 219 places, 188 transitions, 1866 flow. Second operand 11 states and 135 transitions. [2024-06-14 15:26:42,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 213 transitions, 2891 flow [2024-06-14 15:26:42,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 213 transitions, 2838 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-14 15:26:42,793 INFO L231 Difference]: Finished difference. Result has 222 places, 190 transitions, 2043 flow [2024-06-14 15:26:42,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1813, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2043, PETRI_PLACES=222, PETRI_TRANSITIONS=190} [2024-06-14 15:26:42,793 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 191 predicate places. [2024-06-14 15:26:42,794 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 190 transitions, 2043 flow [2024-06-14 15:26:42,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:42,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:42,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:26:42,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 15:26:42,794 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-14 15:26:42,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:42,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2139629707, now seen corresponding path program 14 times [2024-06-14 15:26:42,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:42,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652765423] [2024-06-14 15:26:42,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:42,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:26:48,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:26:48,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:26:48,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652765423] [2024-06-14 15:26:48,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652765423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:26:48,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:26:48,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:26:48,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159271286] [2024-06-14 15:26:48,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:26:48,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:26:48,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:26:48,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:26:48,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:26:48,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:26:48,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 190 transitions, 2043 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:48,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:26:48,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:26:48,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:26:49,027 INFO L124 PetriNetUnfolderBase]: 543/951 cut-off events. [2024-06-14 15:26:49,028 INFO L125 PetriNetUnfolderBase]: For 95282/95282 co-relation queries the response was YES. [2024-06-14 15:26:49,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7291 conditions, 951 events. 543/951 cut-off events. For 95282/95282 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4482 event pairs, 76 based on Foata normal form. 2/950 useless extension candidates. Maximal degree in co-relation 7182. Up to 416 conditions per place. [2024-06-14 15:26:49,035 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 123 selfloop transitions, 90 changer transitions 0/215 dead transitions. [2024-06-14 15:26:49,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 215 transitions, 3086 flow [2024-06-14 15:26:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:26:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:26:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-14 15:26:49,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-14 15:26:49,036 INFO L175 Difference]: Start difference. First operand has 222 places, 190 transitions, 2043 flow. Second operand 11 states and 136 transitions. [2024-06-14 15:26:49,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 215 transitions, 3086 flow [2024-06-14 15:26:49,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 215 transitions, 2885 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-14 15:26:49,229 INFO L231 Difference]: Finished difference. Result has 225 places, 192 transitions, 2078 flow [2024-06-14 15:26:49,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1843, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2078, PETRI_PLACES=225, PETRI_TRANSITIONS=192} [2024-06-14 15:26:49,229 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 194 predicate places. [2024-06-14 15:26:49,229 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 192 transitions, 2078 flow [2024-06-14 15:26:49,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:49,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:49,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:26:49,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 15:26:49,230 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-14 15:26:49,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:49,230 INFO L85 PathProgramCache]: Analyzing trace with hash 880864004, now seen corresponding path program 6 times [2024-06-14 15:26:49,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:49,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988417544] [2024-06-14 15:26:49,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:49,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:26:55,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:26:55,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:26:55,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988417544] [2024-06-14 15:26:55,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988417544] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:26:55,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:26:55,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:26:55,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911836004] [2024-06-14 15:26:55,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:26:55,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:26:55,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:26:55,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:26:55,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:26:55,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:26:55,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 192 transitions, 2078 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:55,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:26:55,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:26:55,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:26:55,906 INFO L124 PetriNetUnfolderBase]: 539/943 cut-off events. [2024-06-14 15:26:55,906 INFO L125 PetriNetUnfolderBase]: For 93225/93225 co-relation queries the response was YES. [2024-06-14 15:26:55,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7180 conditions, 943 events. 539/943 cut-off events. For 93225/93225 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4412 event pairs, 96 based on Foata normal form. 1/943 useless extension candidates. Maximal degree in co-relation 7070. Up to 909 conditions per place. [2024-06-14 15:26:55,914 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 181 selfloop transitions, 20 changer transitions 0/203 dead transitions. [2024-06-14 15:26:55,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 203 transitions, 2519 flow [2024-06-14 15:26:55,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:26:55,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:26:55,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2024-06-14 15:26:55,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29829545454545453 [2024-06-14 15:26:55,914 INFO L175 Difference]: Start difference. First operand has 225 places, 192 transitions, 2078 flow. Second operand 11 states and 105 transitions. [2024-06-14 15:26:55,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 203 transitions, 2519 flow [2024-06-14 15:26:56,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 203 transitions, 2314 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-14 15:26:56,133 INFO L231 Difference]: Finished difference. Result has 228 places, 193 transitions, 1937 flow [2024-06-14 15:26:56,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1875, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1937, PETRI_PLACES=228, PETRI_TRANSITIONS=193} [2024-06-14 15:26:56,133 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 197 predicate places. [2024-06-14 15:26:56,134 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 193 transitions, 1937 flow [2024-06-14 15:26:56,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:56,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:56,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:26:56,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 15:26:56,134 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-14 15:26:56,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:56,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2134117225, now seen corresponding path program 9 times [2024-06-14 15:26:56,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:56,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653290649] [2024-06-14 15:26:56,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:56,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:01,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:27:01,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:01,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653290649] [2024-06-14 15:27:01,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653290649] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:01,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:01,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:27:01,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082194923] [2024-06-14 15:27:01,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:01,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:27:01,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:01,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:27:01,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:27:01,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:27:01,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 193 transitions, 1937 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:01,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:01,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:27:01,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:02,131 INFO L124 PetriNetUnfolderBase]: 543/952 cut-off events. [2024-06-14 15:27:02,131 INFO L125 PetriNetUnfolderBase]: For 97897/97897 co-relation queries the response was YES. [2024-06-14 15:27:02,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7035 conditions, 952 events. 543/952 cut-off events. For 97897/97897 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4486 event pairs, 67 based on Foata normal form. 2/951 useless extension candidates. Maximal degree in co-relation 6924. Up to 792 conditions per place. [2024-06-14 15:27:02,141 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 161 selfloop transitions, 46 changer transitions 0/209 dead transitions. [2024-06-14 15:27:02,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 209 transitions, 2417 flow [2024-06-14 15:27:02,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:27:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:27:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-14 15:27:02,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.340625 [2024-06-14 15:27:02,142 INFO L175 Difference]: Start difference. First operand has 228 places, 193 transitions, 1937 flow. Second operand 10 states and 109 transitions. [2024-06-14 15:27:02,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 209 transitions, 2417 flow [2024-06-14 15:27:02,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 209 transitions, 2352 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-14 15:27:02,342 INFO L231 Difference]: Finished difference. Result has 229 places, 194 transitions, 1996 flow [2024-06-14 15:27:02,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1872, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1996, PETRI_PLACES=229, PETRI_TRANSITIONS=194} [2024-06-14 15:27:02,343 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 198 predicate places. [2024-06-14 15:27:02,343 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 194 transitions, 1996 flow [2024-06-14 15:27:02,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:02,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:02,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:27:02,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 15:27:02,343 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-14 15:27:02,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:02,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2136739281, now seen corresponding path program 10 times [2024-06-14 15:27:02,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:02,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122617697] [2024-06-14 15:27:02,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:02,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:27:07,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:07,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122617697] [2024-06-14 15:27:07,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122617697] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:07,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:07,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:27:07,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095856749] [2024-06-14 15:27:07,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:07,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:27:07,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:07,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:27:07,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:27:07,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:27:07,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 194 transitions, 1996 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:07,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:07,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:27:07,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:08,250 INFO L124 PetriNetUnfolderBase]: 540/947 cut-off events. [2024-06-14 15:27:08,250 INFO L125 PetriNetUnfolderBase]: For 94489/94489 co-relation queries the response was YES. [2024-06-14 15:27:08,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6928 conditions, 947 events. 540/947 cut-off events. For 94489/94489 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4456 event pairs, 63 based on Foata normal form. 2/946 useless extension candidates. Maximal degree in co-relation 6816. Up to 761 conditions per place. [2024-06-14 15:27:08,258 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 158 selfloop transitions, 49 changer transitions 0/209 dead transitions. [2024-06-14 15:27:08,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 209 transitions, 2448 flow [2024-06-14 15:27:08,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:27:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:27:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-14 15:27:08,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.340625 [2024-06-14 15:27:08,259 INFO L175 Difference]: Start difference. First operand has 229 places, 194 transitions, 1996 flow. Second operand 10 states and 109 transitions. [2024-06-14 15:27:08,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 209 transitions, 2448 flow [2024-06-14 15:27:08,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 209 transitions, 2334 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-14 15:27:08,497 INFO L231 Difference]: Finished difference. Result has 231 places, 194 transitions, 1984 flow [2024-06-14 15:27:08,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1882, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1984, PETRI_PLACES=231, PETRI_TRANSITIONS=194} [2024-06-14 15:27:08,497 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 200 predicate places. [2024-06-14 15:27:08,498 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 194 transitions, 1984 flow [2024-06-14 15:27:08,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:08,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:08,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:27:08,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 15:27:08,498 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-14 15:27:08,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:08,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1350401271, now seen corresponding path program 15 times [2024-06-14 15:27:08,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:08,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425823300] [2024-06-14 15:27:08,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:08,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:27:13,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:13,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425823300] [2024-06-14 15:27:13,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425823300] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:13,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:13,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:27:13,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029846000] [2024-06-14 15:27:13,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:13,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:27:13,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:13,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:27:13,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:27:13,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:27:13,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 194 transitions, 1984 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:13,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:13,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:27:13,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:13,757 INFO L124 PetriNetUnfolderBase]: 536/942 cut-off events. [2024-06-14 15:27:13,757 INFO L125 PetriNetUnfolderBase]: For 90397/90397 co-relation queries the response was YES. [2024-06-14 15:27:13,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6720 conditions, 942 events. 536/942 cut-off events. For 90397/90397 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4418 event pairs, 78 based on Foata normal form. 2/940 useless extension candidates. Maximal degree in co-relation 6607. Up to 414 conditions per place. [2024-06-14 15:27:13,765 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 105 selfloop transitions, 109 changer transitions 0/216 dead transitions. [2024-06-14 15:27:13,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 216 transitions, 2871 flow [2024-06-14 15:27:13,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:27:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:27:13,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-14 15:27:13,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-14 15:27:13,767 INFO L175 Difference]: Start difference. First operand has 231 places, 194 transitions, 1984 flow. Second operand 11 states and 131 transitions. [2024-06-14 15:27:13,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 216 transitions, 2871 flow [2024-06-14 15:27:13,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 216 transitions, 2704 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-14 15:27:13,996 INFO L231 Difference]: Finished difference. Result has 232 places, 196 transitions, 2093 flow [2024-06-14 15:27:13,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1817, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2093, PETRI_PLACES=232, PETRI_TRANSITIONS=196} [2024-06-14 15:27:13,996 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 201 predicate places. [2024-06-14 15:27:13,996 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 196 transitions, 2093 flow [2024-06-14 15:27:13,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:13,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:13,997 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-14 15:27:13,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-14 15:27:13,997 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-14 15:27:13,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:13,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2121858326, now seen corresponding path program 1 times [2024-06-14 15:27:13,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:13,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418621486] [2024-06-14 15:27:13,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:13,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:19,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:27:19,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:19,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418621486] [2024-06-14 15:27:19,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418621486] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:19,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:19,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:27:19,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902730198] [2024-06-14 15:27:19,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:19,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:27:19,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:19,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:27:19,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:27:19,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:27:19,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 196 transitions, 2093 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:27:19,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:19,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:27:19,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:20,239 INFO L124 PetriNetUnfolderBase]: 561/991 cut-off events. [2024-06-14 15:27:20,239 INFO L125 PetriNetUnfolderBase]: For 92659/92659 co-relation queries the response was YES. [2024-06-14 15:27:20,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6993 conditions, 991 events. 561/991 cut-off events. For 92659/92659 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4775 event pairs, 89 based on Foata normal form. 2/992 useless extension candidates. Maximal degree in co-relation 6880. Up to 899 conditions per place. [2024-06-14 15:27:20,248 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 198 selfloop transitions, 24 changer transitions 0/224 dead transitions. [2024-06-14 15:27:20,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 224 transitions, 2653 flow [2024-06-14 15:27:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:27:20,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:27:20,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2024-06-14 15:27:20,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32386363636363635 [2024-06-14 15:27:20,249 INFO L175 Difference]: Start difference. First operand has 232 places, 196 transitions, 2093 flow. Second operand 11 states and 114 transitions. [2024-06-14 15:27:20,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 224 transitions, 2653 flow [2024-06-14 15:27:20,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 224 transitions, 2387 flow, removed 23 selfloop flow, removed 10 redundant places. [2024-06-14 15:27:20,471 INFO L231 Difference]: Finished difference. Result has 236 places, 203 transitions, 1954 flow [2024-06-14 15:27:20,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1834, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1954, PETRI_PLACES=236, PETRI_TRANSITIONS=203} [2024-06-14 15:27:20,472 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 205 predicate places. [2024-06-14 15:27:20,472 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 203 transitions, 1954 flow [2024-06-14 15:27:20,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:27:20,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:20,472 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-14 15:27:20,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-14 15:27:20,472 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-14 15:27:20,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:20,473 INFO L85 PathProgramCache]: Analyzing trace with hash -53322112, now seen corresponding path program 2 times [2024-06-14 15:27:20,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:20,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139719286] [2024-06-14 15:27:20,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:20,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:26,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-14 15:27:26,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:26,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139719286] [2024-06-14 15:27:26,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139719286] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:26,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:26,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:27:26,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437404238] [2024-06-14 15:27:26,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:26,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:27:26,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:26,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:27:26,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:27:26,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:27:26,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 203 transitions, 1954 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:27:26,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:26,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:27:26,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:26,882 INFO L124 PetriNetUnfolderBase]: 565/999 cut-off events. [2024-06-14 15:27:26,883 INFO L125 PetriNetUnfolderBase]: For 93977/93977 co-relation queries the response was YES. [2024-06-14 15:27:26,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6730 conditions, 999 events. 565/999 cut-off events. For 93977/93977 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4828 event pairs, 74 based on Foata normal form. 2/1000 useless extension candidates. Maximal degree in co-relation 6615. Up to 862 conditions per place. [2024-06-14 15:27:26,892 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 192 selfloop transitions, 27 changer transitions 0/221 dead transitions. [2024-06-14 15:27:26,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 221 transitions, 2444 flow [2024-06-14 15:27:26,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:27:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:27:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-14 15:27:26,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31875 [2024-06-14 15:27:26,901 INFO L175 Difference]: Start difference. First operand has 236 places, 203 transitions, 1954 flow. Second operand 10 states and 102 transitions. [2024-06-14 15:27:26,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 221 transitions, 2444 flow [2024-06-14 15:27:27,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 221 transitions, 2397 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-14 15:27:27,118 INFO L231 Difference]: Finished difference. Result has 241 places, 204 transitions, 1981 flow [2024-06-14 15:27:27,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1907, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1981, PETRI_PLACES=241, PETRI_TRANSITIONS=204} [2024-06-14 15:27:27,119 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 210 predicate places. [2024-06-14 15:27:27,119 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 204 transitions, 1981 flow [2024-06-14 15:27:27,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:27:27,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:27,119 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-14 15:27:27,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-14 15:27:27,119 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-14 15:27:27,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:27,120 INFO L85 PathProgramCache]: Analyzing trace with hash -50640922, now seen corresponding path program 3 times [2024-06-14 15:27:27,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:27,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433316587] [2024-06-14 15:27:27,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:27,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:32,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-14 15:27:32,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:32,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433316587] [2024-06-14 15:27:32,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433316587] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:32,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:32,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:27:32,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640622916] [2024-06-14 15:27:32,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:32,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:27:32,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:32,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:27:32,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:27:32,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:27:32,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 204 transitions, 1981 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:27:32,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:32,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:27:32,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:33,152 INFO L124 PetriNetUnfolderBase]: 576/1020 cut-off events. [2024-06-14 15:27:33,153 INFO L125 PetriNetUnfolderBase]: For 103066/103066 co-relation queries the response was YES. [2024-06-14 15:27:33,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7045 conditions, 1020 events. 576/1020 cut-off events. For 103066/103066 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4979 event pairs, 100 based on Foata normal form. 2/1021 useless extension candidates. Maximal degree in co-relation 6930. Up to 861 conditions per place. [2024-06-14 15:27:33,162 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 189 selfloop transitions, 33 changer transitions 0/224 dead transitions. [2024-06-14 15:27:33,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 224 transitions, 2661 flow [2024-06-14 15:27:33,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:27:33,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:27:33,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-14 15:27:33,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.340625 [2024-06-14 15:27:33,163 INFO L175 Difference]: Start difference. First operand has 241 places, 204 transitions, 1981 flow. Second operand 10 states and 109 transitions. [2024-06-14 15:27:33,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 224 transitions, 2661 flow [2024-06-14 15:27:33,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 224 transitions, 2593 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 15:27:33,436 INFO L231 Difference]: Finished difference. Result has 243 places, 206 transitions, 2015 flow [2024-06-14 15:27:33,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1919, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2015, PETRI_PLACES=243, PETRI_TRANSITIONS=206} [2024-06-14 15:27:33,437 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 212 predicate places. [2024-06-14 15:27:33,437 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 206 transitions, 2015 flow [2024-06-14 15:27:33,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:27:33,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:33,438 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-14 15:27:33,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-14 15:27:33,438 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-14 15:27:33,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:33,438 INFO L85 PathProgramCache]: Analyzing trace with hash -50520766, now seen corresponding path program 1 times [2024-06-14 15:27:33,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:33,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957729151] [2024-06-14 15:27:33,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:33,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:27:38,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:38,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957729151] [2024-06-14 15:27:38,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957729151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:38,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:38,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:27:38,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204860623] [2024-06-14 15:27:38,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:38,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:27:38,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:38,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:27:38,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:27:38,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:27:38,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 206 transitions, 2015 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:27:38,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:38,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:27:38,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:39,221 INFO L124 PetriNetUnfolderBase]: 574/1017 cut-off events. [2024-06-14 15:27:39,222 INFO L125 PetriNetUnfolderBase]: For 96885/96885 co-relation queries the response was YES. [2024-06-14 15:27:39,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6929 conditions, 1017 events. 574/1017 cut-off events. For 96885/96885 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4944 event pairs, 101 based on Foata normal form. 1/1017 useless extension candidates. Maximal degree in co-relation 6813. Up to 898 conditions per place. [2024-06-14 15:27:39,230 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 184 selfloop transitions, 39 changer transitions 0/225 dead transitions. [2024-06-14 15:27:39,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 225 transitions, 2562 flow [2024-06-14 15:27:39,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:27:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:27:39,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-14 15:27:39,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.334375 [2024-06-14 15:27:39,231 INFO L175 Difference]: Start difference. First operand has 243 places, 206 transitions, 2015 flow. Second operand 10 states and 107 transitions. [2024-06-14 15:27:39,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 225 transitions, 2562 flow [2024-06-14 15:27:39,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 225 transitions, 2506 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 15:27:39,491 INFO L231 Difference]: Finished difference. Result has 247 places, 208 transitions, 2102 flow [2024-06-14 15:27:39,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1959, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2102, PETRI_PLACES=247, PETRI_TRANSITIONS=208} [2024-06-14 15:27:39,491 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 216 predicate places. [2024-06-14 15:27:39,491 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 208 transitions, 2102 flow [2024-06-14 15:27:39,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:27:39,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:39,492 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-14 15:27:39,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-14 15:27:39,492 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-14 15:27:39,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:39,492 INFO L85 PathProgramCache]: Analyzing trace with hash 237559672, now seen corresponding path program 4 times [2024-06-14 15:27:39,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:39,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137966576] [2024-06-14 15:27:39,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:39,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:27:45,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:45,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137966576] [2024-06-14 15:27:45,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137966576] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:45,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:45,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:27:45,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846488457] [2024-06-14 15:27:45,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:45,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:27:45,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:45,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:27:45,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:27:45,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:27:45,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 208 transitions, 2102 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:27:45,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:45,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:27:45,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:46,005 INFO L124 PetriNetUnfolderBase]: 578/1025 cut-off events. [2024-06-14 15:27:46,005 INFO L125 PetriNetUnfolderBase]: For 102406/102406 co-relation queries the response was YES. [2024-06-14 15:27:46,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7041 conditions, 1025 events. 578/1025 cut-off events. For 102406/102406 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5031 event pairs, 99 based on Foata normal form. 2/1026 useless extension candidates. Maximal degree in co-relation 6923. Up to 890 conditions per place. [2024-06-14 15:27:46,014 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 189 selfloop transitions, 36 changer transitions 0/227 dead transitions. [2024-06-14 15:27:46,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 227 transitions, 2774 flow [2024-06-14 15:27:46,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:27:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:27:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-14 15:27:46,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-14 15:27:46,017 INFO L175 Difference]: Start difference. First operand has 247 places, 208 transitions, 2102 flow. Second operand 10 states and 108 transitions. [2024-06-14 15:27:46,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 227 transitions, 2774 flow [2024-06-14 15:27:46,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 227 transitions, 2662 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-14 15:27:46,320 INFO L231 Difference]: Finished difference. Result has 249 places, 209 transitions, 2076 flow [2024-06-14 15:27:46,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1990, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2076, PETRI_PLACES=249, PETRI_TRANSITIONS=209} [2024-06-14 15:27:46,321 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 218 predicate places. [2024-06-14 15:27:46,321 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 209 transitions, 2076 flow [2024-06-14 15:27:46,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:27:46,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:46,321 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-14 15:27:46,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-14 15:27:46,321 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-14 15:27:46,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:46,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1955908028, now seen corresponding path program 5 times [2024-06-14 15:27:46,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:46,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225540212] [2024-06-14 15:27:46,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:46,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:52,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:27:52,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:52,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225540212] [2024-06-14 15:27:52,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225540212] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:52,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:52,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:27:52,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215529869] [2024-06-14 15:27:52,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:52,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:27:52,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:52,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:27:52,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:27:52,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:27:52,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 209 transitions, 2076 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:27:52,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:52,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:27:52,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:52,684 INFO L124 PetriNetUnfolderBase]: 575/1020 cut-off events. [2024-06-14 15:27:52,684 INFO L125 PetriNetUnfolderBase]: For 98617/98617 co-relation queries the response was YES. [2024-06-14 15:27:52,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6850 conditions, 1020 events. 575/1020 cut-off events. For 98617/98617 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4982 event pairs, 100 based on Foata normal form. 2/1021 useless extension candidates. Maximal degree in co-relation 6731. Up to 904 conditions per place. [2024-06-14 15:27:52,692 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 188 selfloop transitions, 36 changer transitions 0/226 dead transitions. [2024-06-14 15:27:52,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 226 transitions, 2570 flow [2024-06-14 15:27:52,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:27:52,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:27:52,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-14 15:27:52,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33125 [2024-06-14 15:27:52,693 INFO L175 Difference]: Start difference. First operand has 249 places, 209 transitions, 2076 flow. Second operand 10 states and 106 transitions. [2024-06-14 15:27:52,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 226 transitions, 2570 flow [2024-06-14 15:27:52,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 226 transitions, 2483 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 15:27:52,970 INFO L231 Difference]: Finished difference. Result has 251 places, 209 transitions, 2066 flow [2024-06-14 15:27:52,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1989, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2066, PETRI_PLACES=251, PETRI_TRANSITIONS=209} [2024-06-14 15:27:52,970 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 220 predicate places. [2024-06-14 15:27:52,970 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 209 transitions, 2066 flow [2024-06-14 15:27:52,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:27:52,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:52,970 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-14 15:27:52,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-14 15:27:52,971 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-14 15:27:52,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:52,971 INFO L85 PathProgramCache]: Analyzing trace with hash 353035416, now seen corresponding path program 1 times [2024-06-14 15:27:52,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:52,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287663884] [2024-06-14 15:27:52,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:52,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:58,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-14 15:27:58,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:58,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287663884] [2024-06-14 15:27:58,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287663884] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:58,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:58,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:27:58,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958034726] [2024-06-14 15:27:58,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:58,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:27:58,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:58,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:27:58,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:27:58,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:27:58,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 209 transitions, 2066 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:58,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:58,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:27:58,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:59,402 INFO L124 PetriNetUnfolderBase]: 571/1014 cut-off events. [2024-06-14 15:27:59,403 INFO L125 PetriNetUnfolderBase]: For 93697/93697 co-relation queries the response was YES. [2024-06-14 15:27:59,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6654 conditions, 1014 events. 571/1014 cut-off events. For 93697/93697 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4959 event pairs, 86 based on Foata normal form. 2/1015 useless extension candidates. Maximal degree in co-relation 6534. Up to 780 conditions per place. [2024-06-14 15:27:59,412 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 160 selfloop transitions, 67 changer transitions 0/229 dead transitions. [2024-06-14 15:27:59,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 229 transitions, 2579 flow [2024-06-14 15:27:59,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:27:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:27:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-14 15:27:59,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:27:59,413 INFO L175 Difference]: Start difference. First operand has 251 places, 209 transitions, 2066 flow. Second operand 11 states and 121 transitions. [2024-06-14 15:27:59,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 229 transitions, 2579 flow [2024-06-14 15:27:59,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 229 transitions, 2492 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-14 15:27:59,658 INFO L231 Difference]: Finished difference. Result has 254 places, 210 transitions, 2152 flow [2024-06-14 15:27:59,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1979, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2152, PETRI_PLACES=254, PETRI_TRANSITIONS=210} [2024-06-14 15:27:59,659 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 223 predicate places. [2024-06-14 15:27:59,659 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 210 transitions, 2152 flow [2024-06-14 15:27:59,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:59,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:59,659 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-14 15:27:59,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-14 15:27:59,659 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-14 15:27:59,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:59,659 INFO L85 PathProgramCache]: Analyzing trace with hash 230409352, now seen corresponding path program 6 times [2024-06-14 15:27:59,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:59,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357730745] [2024-06-14 15:27:59,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:59,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:05,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:05,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:05,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357730745] [2024-06-14 15:28:05,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357730745] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:05,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:05,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:28:05,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71143414] [2024-06-14 15:28:05,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:05,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:28:05,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:05,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:28:05,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:28:05,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:28:05,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 210 transitions, 2152 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:28:05,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:05,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:28:05,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:06,085 INFO L124 PetriNetUnfolderBase]: 575/1022 cut-off events. [2024-06-14 15:28:06,085 INFO L125 PetriNetUnfolderBase]: For 96154/96154 co-relation queries the response was YES. [2024-06-14 15:28:06,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6834 conditions, 1022 events. 575/1022 cut-off events. For 96154/96154 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5014 event pairs, 86 based on Foata normal form. 2/1023 useless extension candidates. Maximal degree in co-relation 6712. Up to 855 conditions per place. [2024-06-14 15:28:06,096 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 179 selfloop transitions, 49 changer transitions 0/230 dead transitions. [2024-06-14 15:28:06,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 230 transitions, 2674 flow [2024-06-14 15:28:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:28:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:28:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-14 15:28:06,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3380681818181818 [2024-06-14 15:28:06,097 INFO L175 Difference]: Start difference. First operand has 254 places, 210 transitions, 2152 flow. Second operand 11 states and 119 transitions. [2024-06-14 15:28:06,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 230 transitions, 2674 flow [2024-06-14 15:28:06,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 230 transitions, 2473 flow, removed 2 selfloop flow, removed 12 redundant places. [2024-06-14 15:28:06,329 INFO L231 Difference]: Finished difference. Result has 253 places, 211 transitions, 2069 flow [2024-06-14 15:28:06,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1951, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2069, PETRI_PLACES=253, PETRI_TRANSITIONS=211} [2024-06-14 15:28:06,329 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 222 predicate places. [2024-06-14 15:28:06,330 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 211 transitions, 2069 flow [2024-06-14 15:28:06,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:28:06,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:06,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:28:06,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-14 15:28:06,330 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-14 15:28:06,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:06,330 INFO L85 PathProgramCache]: Analyzing trace with hash -348816964, now seen corresponding path program 7 times [2024-06-14 15:28:06,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:06,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092385651] [2024-06-14 15:28:06,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:06,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:12,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:12,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:12,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092385651] [2024-06-14 15:28:12,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092385651] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:12,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:12,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:28:12,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648027222] [2024-06-14 15:28:12,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:12,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:28:12,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:12,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:28:12,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:28:12,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:28:12,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 211 transitions, 2069 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:28:12,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:12,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:28:12,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:13,364 INFO L124 PetriNetUnfolderBase]: 579/1030 cut-off events. [2024-06-14 15:28:13,364 INFO L125 PetriNetUnfolderBase]: For 98201/98201 co-relation queries the response was YES. [2024-06-14 15:28:13,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6793 conditions, 1030 events. 579/1030 cut-off events. For 98201/98201 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5086 event pairs, 88 based on Foata normal form. 2/1031 useless extension candidates. Maximal degree in co-relation 6670. Up to 863 conditions per place. [2024-06-14 15:28:13,374 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 177 selfloop transitions, 52 changer transitions 0/231 dead transitions. [2024-06-14 15:28:13,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 231 transitions, 2595 flow [2024-06-14 15:28:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:28:13,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:28:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-14 15:28:13,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3352272727272727 [2024-06-14 15:28:13,375 INFO L175 Difference]: Start difference. First operand has 253 places, 211 transitions, 2069 flow. Second operand 11 states and 118 transitions. [2024-06-14 15:28:13,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 231 transitions, 2595 flow [2024-06-14 15:28:13,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 231 transitions, 2487 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-14 15:28:13,635 INFO L231 Difference]: Finished difference. Result has 255 places, 212 transitions, 2087 flow [2024-06-14 15:28:13,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1961, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2087, PETRI_PLACES=255, PETRI_TRANSITIONS=212} [2024-06-14 15:28:13,635 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 224 predicate places. [2024-06-14 15:28:13,635 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 212 transitions, 2087 flow [2024-06-14 15:28:13,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:28:13,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:13,636 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-14 15:28:13,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-14 15:28:13,636 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-14 15:28:13,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:13,636 INFO L85 PathProgramCache]: Analyzing trace with hash -348570700, now seen corresponding path program 1 times [2024-06-14 15:28:13,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:13,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616022683] [2024-06-14 15:28:13,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:13,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:19,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:19,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616022683] [2024-06-14 15:28:19,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616022683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:19,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:19,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:28:19,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44996380] [2024-06-14 15:28:19,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:19,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:28:19,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:19,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:28:19,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:28:19,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:28:19,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 212 transitions, 2087 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:28:19,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:19,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:28:19,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:20,074 INFO L124 PetriNetUnfolderBase]: 583/1038 cut-off events. [2024-06-14 15:28:20,074 INFO L125 PetriNetUnfolderBase]: For 100635/100635 co-relation queries the response was YES. [2024-06-14 15:28:20,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6880 conditions, 1038 events. 583/1038 cut-off events. For 100635/100635 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5144 event pairs, 109 based on Foata normal form. 2/1039 useless extension candidates. Maximal degree in co-relation 6756. Up to 992 conditions per place. [2024-06-14 15:28:20,084 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 204 selfloop transitions, 20 changer transitions 0/226 dead transitions. [2024-06-14 15:28:20,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 226 transitions, 2591 flow [2024-06-14 15:28:20,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:28:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:28:20,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2024-06-14 15:28:20,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3039772727272727 [2024-06-14 15:28:20,085 INFO L175 Difference]: Start difference. First operand has 255 places, 212 transitions, 2087 flow. Second operand 11 states and 107 transitions. [2024-06-14 15:28:20,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 226 transitions, 2591 flow [2024-06-14 15:28:20,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 226 transitions, 2475 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-14 15:28:20,350 INFO L231 Difference]: Finished difference. Result has 257 places, 213 transitions, 2043 flow [2024-06-14 15:28:20,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1971, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2043, PETRI_PLACES=257, PETRI_TRANSITIONS=213} [2024-06-14 15:28:20,351 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 226 predicate places. [2024-06-14 15:28:20,351 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 213 transitions, 2043 flow [2024-06-14 15:28:20,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:28:20,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:20,351 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-14 15:28:20,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-14 15:28:20,351 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-14 15:28:20,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:20,352 INFO L85 PathProgramCache]: Analyzing trace with hash 230404702, now seen corresponding path program 8 times [2024-06-14 15:28:20,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:20,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016727419] [2024-06-14 15:28:20,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:20,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:26,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:26,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016727419] [2024-06-14 15:28:26,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016727419] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:26,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:26,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:28:26,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621825120] [2024-06-14 15:28:26,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:26,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:28:26,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:26,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:28:26,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:28:26,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:28:26,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 213 transitions, 2043 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:28:26,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:26,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:28:26,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:26,905 INFO L124 PetriNetUnfolderBase]: 587/1046 cut-off events. [2024-06-14 15:28:26,905 INFO L125 PetriNetUnfolderBase]: For 102933/102933 co-relation queries the response was YES. [2024-06-14 15:28:26,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6850 conditions, 1046 events. 587/1046 cut-off events. For 102933/102933 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5216 event pairs, 88 based on Foata normal form. 2/1047 useless extension candidates. Maximal degree in co-relation 6725. Up to 859 conditions per place. [2024-06-14 15:28:26,916 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 180 selfloop transitions, 51 changer transitions 0/233 dead transitions. [2024-06-14 15:28:26,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 233 transitions, 2573 flow [2024-06-14 15:28:26,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:28:26,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:28:26,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-14 15:28:26,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3380681818181818 [2024-06-14 15:28:26,917 INFO L175 Difference]: Start difference. First operand has 257 places, 213 transitions, 2043 flow. Second operand 11 states and 119 transitions. [2024-06-14 15:28:26,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 233 transitions, 2573 flow [2024-06-14 15:28:27,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 233 transitions, 2511 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-14 15:28:27,176 INFO L231 Difference]: Finished difference. Result has 259 places, 214 transitions, 2107 flow [2024-06-14 15:28:27,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1981, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2107, PETRI_PLACES=259, PETRI_TRANSITIONS=214} [2024-06-14 15:28:27,177 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 228 predicate places. [2024-06-14 15:28:27,177 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 214 transitions, 2107 flow [2024-06-14 15:28:27,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:28:27,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:27,177 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-14 15:28:27,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-14 15:28:27,177 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-14 15:28:27,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:27,177 INFO L85 PathProgramCache]: Analyzing trace with hash -525948484, now seen corresponding path program 9 times [2024-06-14 15:28:27,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:27,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155567433] [2024-06-14 15:28:27,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:27,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:33,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:33,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:33,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155567433] [2024-06-14 15:28:33,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155567433] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:33,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:33,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:28:33,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314208644] [2024-06-14 15:28:33,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:33,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:28:33,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:33,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:28:33,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:28:33,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:28:33,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 214 transitions, 2107 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:28:33,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:33,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:28:33,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:33,752 INFO L124 PetriNetUnfolderBase]: 591/1054 cut-off events. [2024-06-14 15:28:33,752 INFO L125 PetriNetUnfolderBase]: For 105271/105271 co-relation queries the response was YES. [2024-06-14 15:28:33,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6976 conditions, 1054 events. 591/1054 cut-off events. For 105271/105271 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5279 event pairs, 96 based on Foata normal form. 2/1055 useless extension candidates. Maximal degree in co-relation 6850. Up to 887 conditions per place. [2024-06-14 15:28:33,762 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 187 selfloop transitions, 45 changer transitions 0/234 dead transitions. [2024-06-14 15:28:33,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 234 transitions, 2643 flow [2024-06-14 15:28:33,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:28:33,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:28:33,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-14 15:28:33,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2024-06-14 15:28:33,764 INFO L175 Difference]: Start difference. First operand has 259 places, 214 transitions, 2107 flow. Second operand 11 states and 120 transitions. [2024-06-14 15:28:33,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 234 transitions, 2643 flow [2024-06-14 15:28:34,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 234 transitions, 2527 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-14 15:28:34,029 INFO L231 Difference]: Finished difference. Result has 261 places, 215 transitions, 2107 flow [2024-06-14 15:28:34,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1991, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2107, PETRI_PLACES=261, PETRI_TRANSITIONS=215} [2024-06-14 15:28:34,030 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 230 predicate places. [2024-06-14 15:28:34,030 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 215 transitions, 2107 flow [2024-06-14 15:28:34,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:28:34,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:34,030 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-14 15:28:34,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-14 15:28:34,030 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-14 15:28:34,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:34,031 INFO L85 PathProgramCache]: Analyzing trace with hash -525953134, now seen corresponding path program 10 times [2024-06-14 15:28:34,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:34,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745412439] [2024-06-14 15:28:34,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:34,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:39,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:39,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:39,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745412439] [2024-06-14 15:28:39,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745412439] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:39,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:39,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:28:39,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236742025] [2024-06-14 15:28:39,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:39,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:28:39,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:39,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:28:39,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:28:39,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:28:39,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 215 transitions, 2107 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:28:39,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:39,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:28:39,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:40,501 INFO L124 PetriNetUnfolderBase]: 595/1062 cut-off events. [2024-06-14 15:28:40,501 INFO L125 PetriNetUnfolderBase]: For 107588/107588 co-relation queries the response was YES. [2024-06-14 15:28:40,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7019 conditions, 1062 events. 595/1062 cut-off events. For 107588/107588 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5324 event pairs, 96 based on Foata normal form. 2/1063 useless extension candidates. Maximal degree in co-relation 6892. Up to 881 conditions per place. [2024-06-14 15:28:40,511 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 187 selfloop transitions, 46 changer transitions 0/235 dead transitions. [2024-06-14 15:28:40,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 235 transitions, 2645 flow [2024-06-14 15:28:40,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:28:40,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:28:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-14 15:28:40,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:28:40,512 INFO L175 Difference]: Start difference. First operand has 261 places, 215 transitions, 2107 flow. Second operand 11 states and 121 transitions. [2024-06-14 15:28:40,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 235 transitions, 2645 flow [2024-06-14 15:28:40,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 235 transitions, 2539 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-14 15:28:40,790 INFO L231 Difference]: Finished difference. Result has 263 places, 216 transitions, 2121 flow [2024-06-14 15:28:40,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2001, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2121, PETRI_PLACES=263, PETRI_TRANSITIONS=216} [2024-06-14 15:28:40,791 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 232 predicate places. [2024-06-14 15:28:40,791 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 216 transitions, 2121 flow [2024-06-14 15:28:40,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:28:40,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:40,791 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-14 15:28:40,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-14 15:28:40,791 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-14 15:28:40,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:40,791 INFO L85 PathProgramCache]: Analyzing trace with hash -526068454, now seen corresponding path program 11 times [2024-06-14 15:28:40,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:40,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238813250] [2024-06-14 15:28:40,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:40,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:46,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:46,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238813250] [2024-06-14 15:28:46,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238813250] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:46,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:46,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:28:46,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709535975] [2024-06-14 15:28:46,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:46,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:28:46,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:46,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:28:46,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:28:46,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:28:46,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 216 transitions, 2121 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:28:46,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:46,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:28:46,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:47,089 INFO L124 PetriNetUnfolderBase]: 599/1070 cut-off events. [2024-06-14 15:28:47,089 INFO L125 PetriNetUnfolderBase]: For 110141/110141 co-relation queries the response was YES. [2024-06-14 15:28:47,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7084 conditions, 1070 events. 599/1070 cut-off events. For 110141/110141 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5391 event pairs, 98 based on Foata normal form. 2/1071 useless extension candidates. Maximal degree in co-relation 6956. Up to 841 conditions per place. [2024-06-14 15:28:47,097 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 184 selfloop transitions, 50 changer transitions 0/236 dead transitions. [2024-06-14 15:28:47,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 236 transitions, 2661 flow [2024-06-14 15:28:47,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:28:47,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:28:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-14 15:28:47,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2024-06-14 15:28:47,098 INFO L175 Difference]: Start difference. First operand has 263 places, 216 transitions, 2121 flow. Second operand 11 states and 120 transitions. [2024-06-14 15:28:47,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 236 transitions, 2661 flow [2024-06-14 15:28:47,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 236 transitions, 2551 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-14 15:28:47,403 INFO L231 Difference]: Finished difference. Result has 265 places, 217 transitions, 2141 flow [2024-06-14 15:28:47,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2011, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2141, PETRI_PLACES=265, PETRI_TRANSITIONS=217} [2024-06-14 15:28:47,403 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 234 predicate places. [2024-06-14 15:28:47,403 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 217 transitions, 2141 flow [2024-06-14 15:28:47,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:28:47,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:47,404 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-14 15:28:47,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-14 15:28:47,404 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-14 15:28:47,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:47,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1099075552, now seen corresponding path program 12 times [2024-06-14 15:28:47,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:47,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540221522] [2024-06-14 15:28:47,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:47,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:52,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-14 15:28:52,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:52,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540221522] [2024-06-14 15:28:52,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540221522] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:52,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:52,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:28:52,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195092122] [2024-06-14 15:28:52,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:52,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:28:52,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:52,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:28:52,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:28:53,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:28:53,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 217 transitions, 2141 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:28:53,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:53,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:28:53,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:53,417 INFO L124 PetriNetUnfolderBase]: 603/1079 cut-off events. [2024-06-14 15:28:53,417 INFO L125 PetriNetUnfolderBase]: For 112807/112807 co-relation queries the response was YES. [2024-06-14 15:28:53,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7164 conditions, 1079 events. 603/1079 cut-off events. For 112807/112807 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5474 event pairs, 62 based on Foata normal form. 2/1078 useless extension candidates. Maximal degree in co-relation 7035. Up to 816 conditions per place. [2024-06-14 15:28:53,428 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 152 selfloop transitions, 81 changer transitions 0/235 dead transitions. [2024-06-14 15:28:53,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 235 transitions, 2679 flow [2024-06-14 15:28:53,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:28:53,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:28:53,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-14 15:28:53,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3380681818181818 [2024-06-14 15:28:53,429 INFO L175 Difference]: Start difference. First operand has 265 places, 217 transitions, 2141 flow. Second operand 11 states and 119 transitions. [2024-06-14 15:28:53,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 235 transitions, 2679 flow [2024-06-14 15:28:53,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 235 transitions, 2559 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-14 15:28:53,725 INFO L231 Difference]: Finished difference. Result has 267 places, 218 transitions, 2215 flow [2024-06-14 15:28:53,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2021, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2215, PETRI_PLACES=267, PETRI_TRANSITIONS=218} [2024-06-14 15:28:53,725 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 236 predicate places. [2024-06-14 15:28:53,725 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 218 transitions, 2215 flow [2024-06-14 15:28:53,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:28:53,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:53,725 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-14 15:28:53,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-14 15:28:53,725 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-14 15:28:53,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:53,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1098837968, now seen corresponding path program 2 times [2024-06-14 15:28:53,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:53,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669502279] [2024-06-14 15:28:53,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:53,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:59,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:59,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669502279] [2024-06-14 15:28:59,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669502279] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:59,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:59,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:28:59,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127485271] [2024-06-14 15:28:59,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:59,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:28:59,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:59,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:28:59,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:28:59,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:28:59,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 218 transitions, 2215 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:28:59,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:59,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:28:59,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:00,083 INFO L124 PetriNetUnfolderBase]: 609/1089 cut-off events. [2024-06-14 15:29:00,083 INFO L125 PetriNetUnfolderBase]: For 115063/115063 co-relation queries the response was YES. [2024-06-14 15:29:00,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7298 conditions, 1089 events. 609/1089 cut-off events. For 115063/115063 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5527 event pairs, 68 based on Foata normal form. 2/1088 useless extension candidates. Maximal degree in co-relation 7168. Up to 550 conditions per place. [2024-06-14 15:29:00,094 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 130 selfloop transitions, 111 changer transitions 0/243 dead transitions. [2024-06-14 15:29:00,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 243 transitions, 3361 flow [2024-06-14 15:29:00,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:29:00,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:29:00,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-14 15:29:00,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-14 15:29:00,096 INFO L175 Difference]: Start difference. First operand has 267 places, 218 transitions, 2215 flow. Second operand 12 states and 141 transitions. [2024-06-14 15:29:00,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 243 transitions, 3361 flow [2024-06-14 15:29:00,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 243 transitions, 3177 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-14 15:29:00,438 INFO L231 Difference]: Finished difference. Result has 270 places, 220 transitions, 2294 flow [2024-06-14 15:29:00,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2031, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2294, PETRI_PLACES=270, PETRI_TRANSITIONS=220} [2024-06-14 15:29:00,439 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 239 predicate places. [2024-06-14 15:29:00,439 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 220 transitions, 2294 flow [2024-06-14 15:29:00,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:29:00,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:00,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-14 15:29:00,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-14 15:29:00,439 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-14 15:29:00,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:00,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1098829288, now seen corresponding path program 2 times [2024-06-14 15:29:00,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:00,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953972566] [2024-06-14 15:29:00,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:00,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:29:06,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:06,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953972566] [2024-06-14 15:29:06,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953972566] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:06,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:06,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:29:06,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722048276] [2024-06-14 15:29:06,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:06,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:29:06,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:06,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:29:06,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:29:06,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:29:06,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 220 transitions, 2294 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:29:06,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:06,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:29:06,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:06,726 INFO L124 PetriNetUnfolderBase]: 613/1097 cut-off events. [2024-06-14 15:29:06,727 INFO L125 PetriNetUnfolderBase]: For 117964/117964 co-relation queries the response was YES. [2024-06-14 15:29:06,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7435 conditions, 1097 events. 613/1097 cut-off events. For 117964/117964 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5555 event pairs, 118 based on Foata normal form. 2/1096 useless extension candidates. Maximal degree in co-relation 7304. Up to 1008 conditions per place. [2024-06-14 15:29:06,737 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 189 selfloop transitions, 41 changer transitions 0/232 dead transitions. [2024-06-14 15:29:06,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 232 transitions, 2806 flow [2024-06-14 15:29:06,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:29:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:29:06,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-14 15:29:06,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3125 [2024-06-14 15:29:06,739 INFO L175 Difference]: Start difference. First operand has 270 places, 220 transitions, 2294 flow. Second operand 11 states and 110 transitions. [2024-06-14 15:29:06,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 232 transitions, 2806 flow [2024-06-14 15:29:07,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 232 transitions, 2564 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-14 15:29:07,050 INFO L231 Difference]: Finished difference. Result has 271 places, 221 transitions, 2168 flow [2024-06-14 15:29:07,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2052, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2168, PETRI_PLACES=271, PETRI_TRANSITIONS=221} [2024-06-14 15:29:07,050 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 240 predicate places. [2024-06-14 15:29:07,050 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 221 transitions, 2168 flow [2024-06-14 15:29:07,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:29:07,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:07,051 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-14 15:29:07,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-14 15:29:07,051 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-14 15:29:07,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:07,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1257092290, now seen corresponding path program 13 times [2024-06-14 15:29:07,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:07,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001298526] [2024-06-14 15:29:07,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:07,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:29:12,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:12,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001298526] [2024-06-14 15:29:12,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001298526] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:12,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:12,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:29:12,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164253023] [2024-06-14 15:29:12,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:12,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:29:12,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:12,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:29:12,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:29:12,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:29:12,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 221 transitions, 2168 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:29:12,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:12,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:29:12,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:13,041 INFO L124 PetriNetUnfolderBase]: 617/1105 cut-off events. [2024-06-14 15:29:13,041 INFO L125 PetriNetUnfolderBase]: For 120227/120227 co-relation queries the response was YES. [2024-06-14 15:29:13,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7303 conditions, 1105 events. 617/1105 cut-off events. For 120227/120227 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5636 event pairs, 73 based on Foata normal form. 2/1104 useless extension candidates. Maximal degree in co-relation 7171. Up to 842 conditions per place. [2024-06-14 15:29:13,052 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 170 selfloop transitions, 68 changer transitions 0/240 dead transitions. [2024-06-14 15:29:13,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 240 transitions, 2722 flow [2024-06-14 15:29:13,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:29:13,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:29:13,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-14 15:29:13,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3494318181818182 [2024-06-14 15:29:13,054 INFO L175 Difference]: Start difference. First operand has 271 places, 221 transitions, 2168 flow. Second operand 11 states and 123 transitions. [2024-06-14 15:29:13,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 240 transitions, 2722 flow [2024-06-14 15:29:13,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 240 transitions, 2616 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-14 15:29:13,385 INFO L231 Difference]: Finished difference. Result has 273 places, 222 transitions, 2232 flow [2024-06-14 15:29:13,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2062, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2232, PETRI_PLACES=273, PETRI_TRANSITIONS=222} [2024-06-14 15:29:13,386 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 242 predicate places. [2024-06-14 15:29:13,386 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 222 transitions, 2232 flow [2024-06-14 15:29:13,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:29:13,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:13,386 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-14 15:29:13,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-14 15:29:13,387 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-14 15:29:13,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:13,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1322922476, now seen corresponding path program 3 times [2024-06-14 15:29:13,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:13,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566816092] [2024-06-14 15:29:13,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:13,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:19,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:29:19,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:19,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566816092] [2024-06-14 15:29:19,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566816092] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:19,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:19,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:29:19,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132445291] [2024-06-14 15:29:19,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:19,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:29:19,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:19,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:29:19,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:29:19,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:29:19,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 222 transitions, 2232 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:29:19,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:19,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:29:19,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:19,957 INFO L124 PetriNetUnfolderBase]: 613/1099 cut-off events. [2024-06-14 15:29:19,957 INFO L125 PetriNetUnfolderBase]: For 113246/113246 co-relation queries the response was YES. [2024-06-14 15:29:19,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7144 conditions, 1099 events. 613/1099 cut-off events. For 113246/113246 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5605 event pairs, 62 based on Foata normal form. 2/1098 useless extension candidates. Maximal degree in co-relation 7011. Up to 563 conditions per place. [2024-06-14 15:29:19,968 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 126 selfloop transitions, 116 changer transitions 0/244 dead transitions. [2024-06-14 15:29:19,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 244 transitions, 3166 flow [2024-06-14 15:29:19,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:29:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:29:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 139 transitions. [2024-06-14 15:29:19,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3619791666666667 [2024-06-14 15:29:19,970 INFO L175 Difference]: Start difference. First operand has 273 places, 222 transitions, 2232 flow. Second operand 12 states and 139 transitions. [2024-06-14 15:29:19,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 244 transitions, 3166 flow [2024-06-14 15:29:20,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 244 transitions, 2988 flow, removed 22 selfloop flow, removed 9 redundant places. [2024-06-14 15:29:20,309 INFO L231 Difference]: Finished difference. Result has 276 places, 222 transitions, 2291 flow [2024-06-14 15:29:20,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2054, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2291, PETRI_PLACES=276, PETRI_TRANSITIONS=222} [2024-06-14 15:29:20,309 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 245 predicate places. [2024-06-14 15:29:20,309 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 222 transitions, 2291 flow [2024-06-14 15:29:20,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:29:20,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:20,310 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-14 15:29:20,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-14 15:29:20,310 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-14 15:29:20,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:20,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1250663200, now seen corresponding path program 14 times [2024-06-14 15:29:20,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:20,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572342385] [2024-06-14 15:29:20,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:20,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:26,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-14 15:29:26,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:26,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572342385] [2024-06-14 15:29:26,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572342385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:26,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:26,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:29:26,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023532728] [2024-06-14 15:29:26,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:26,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:29:26,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:26,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:29:26,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:29:26,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:29:26,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 222 transitions, 2291 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:29:26,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:26,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:29:26,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:27,100 INFO L124 PetriNetUnfolderBase]: 617/1107 cut-off events. [2024-06-14 15:29:27,100 INFO L125 PetriNetUnfolderBase]: For 115799/115799 co-relation queries the response was YES. [2024-06-14 15:29:27,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7306 conditions, 1107 events. 617/1107 cut-off events. For 115799/115799 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5668 event pairs, 73 based on Foata normal form. 2/1106 useless extension candidates. Maximal degree in co-relation 7172. Up to 844 conditions per place. [2024-06-14 15:29:27,108 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 172 selfloop transitions, 67 changer transitions 0/241 dead transitions. [2024-06-14 15:29:27,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 241 transitions, 2849 flow [2024-06-14 15:29:27,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:29:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:29:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-14 15:29:27,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-14 15:29:27,110 INFO L175 Difference]: Start difference. First operand has 276 places, 222 transitions, 2291 flow. Second operand 11 states and 124 transitions. [2024-06-14 15:29:27,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 241 transitions, 2849 flow [2024-06-14 15:29:27,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 241 transitions, 2589 flow, removed 1 selfloop flow, removed 12 redundant places. [2024-06-14 15:29:27,406 INFO L231 Difference]: Finished difference. Result has 275 places, 223 transitions, 2201 flow [2024-06-14 15:29:27,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2031, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2201, PETRI_PLACES=275, PETRI_TRANSITIONS=223} [2024-06-14 15:29:27,406 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 244 predicate places. [2024-06-14 15:29:27,406 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 223 transitions, 2201 flow [2024-06-14 15:29:27,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:29:27,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:27,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:29:27,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-14 15:29:27,407 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-14 15:29:27,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:27,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1536981940, now seen corresponding path program 3 times [2024-06-14 15:29:27,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:27,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338713272] [2024-06-14 15:29:27,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:27,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:33,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-14 15:29:33,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:33,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338713272] [2024-06-14 15:29:33,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338713272] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:33,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:33,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:29:33,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677184944] [2024-06-14 15:29:33,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:33,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:29:33,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:33,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:29:33,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:29:33,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:29:33,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 223 transitions, 2201 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:29:33,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:33,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:29:33,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:34,276 INFO L124 PetriNetUnfolderBase]: 621/1114 cut-off events. [2024-06-14 15:29:34,276 INFO L125 PetriNetUnfolderBase]: For 118178/118178 co-relation queries the response was YES. [2024-06-14 15:29:34,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7247 conditions, 1114 events. 621/1114 cut-off events. For 118178/118178 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5716 event pairs, 123 based on Foata normal form. 2/1115 useless extension candidates. Maximal degree in co-relation 7112. Up to 1072 conditions per place. [2024-06-14 15:29:34,287 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 213 selfloop transitions, 21 changer transitions 0/236 dead transitions. [2024-06-14 15:29:34,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 236 transitions, 2725 flow [2024-06-14 15:29:34,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:29:34,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:29:34,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 113 transitions. [2024-06-14 15:29:34,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2942708333333333 [2024-06-14 15:29:34,290 INFO L175 Difference]: Start difference. First operand has 275 places, 223 transitions, 2201 flow. Second operand 12 states and 113 transitions. [2024-06-14 15:29:34,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 236 transitions, 2725 flow [2024-06-14 15:29:34,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 236 transitions, 2565 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-14 15:29:34,687 INFO L231 Difference]: Finished difference. Result has 278 places, 224 transitions, 2119 flow [2024-06-14 15:29:34,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2041, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2119, PETRI_PLACES=278, PETRI_TRANSITIONS=224} [2024-06-14 15:29:34,688 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 247 predicate places. [2024-06-14 15:29:34,688 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 224 transitions, 2119 flow [2024-06-14 15:29:34,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:29:34,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:34,688 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-14 15:29:34,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-14 15:29:34,688 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-14 15:29:34,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:34,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1537338130, now seen corresponding path program 4 times [2024-06-14 15:29:34,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:34,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651924526] [2024-06-14 15:29:34,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:34,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:40,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:29:40,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:40,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651924526] [2024-06-14 15:29:40,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651924526] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:40,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:40,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:29:40,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435693230] [2024-06-14 15:29:40,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:40,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:29:40,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:40,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:29:40,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:29:41,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:29:41,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 224 transitions, 2119 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:29:41,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:41,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:29:41,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:41,451 INFO L124 PetriNetUnfolderBase]: 632/1135 cut-off events. [2024-06-14 15:29:41,451 INFO L125 PetriNetUnfolderBase]: For 130637/130637 co-relation queries the response was YES. [2024-06-14 15:29:41,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7500 conditions, 1135 events. 632/1135 cut-off events. For 130637/130637 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5834 event pairs, 124 based on Foata normal form. 2/1136 useless extension candidates. Maximal degree in co-relation 7364. Up to 1070 conditions per place. [2024-06-14 15:29:41,463 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 215 selfloop transitions, 23 changer transitions 0/240 dead transitions. [2024-06-14 15:29:41,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 240 transitions, 2889 flow [2024-06-14 15:29:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:29:41,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:29:41,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 114 transitions. [2024-06-14 15:29:41,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.296875 [2024-06-14 15:29:41,464 INFO L175 Difference]: Start difference. First operand has 278 places, 224 transitions, 2119 flow. Second operand 12 states and 114 transitions. [2024-06-14 15:29:41,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 240 transitions, 2889 flow [2024-06-14 15:29:41,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 240 transitions, 2821 flow, removed 14 selfloop flow, removed 10 redundant places. [2024-06-14 15:29:41,860 INFO L231 Difference]: Finished difference. Result has 280 places, 226 transitions, 2167 flow [2024-06-14 15:29:41,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2051, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2167, PETRI_PLACES=280, PETRI_TRANSITIONS=226} [2024-06-14 15:29:41,861 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 249 predicate places. [2024-06-14 15:29:41,861 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 226 transitions, 2167 flow [2024-06-14 15:29:41,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:29:41,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:41,861 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-14 15:29:41,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-14 15:29:41,861 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-14 15:29:41,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:41,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1250658550, now seen corresponding path program 15 times [2024-06-14 15:29:41,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:41,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284875550] [2024-06-14 15:29:41,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:41,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:48,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:29:48,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:48,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284875550] [2024-06-14 15:29:48,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284875550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:48,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:48,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:29:48,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142068292] [2024-06-14 15:29:48,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:48,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:29:48,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:48,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:29:48,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:29:48,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:29:48,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 226 transitions, 2167 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:29:48,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:48,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:29:48,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:48,563 INFO L124 PetriNetUnfolderBase]: 636/1144 cut-off events. [2024-06-14 15:29:48,563 INFO L125 PetriNetUnfolderBase]: For 133443/133443 co-relation queries the response was YES. [2024-06-14 15:29:48,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7570 conditions, 1144 events. 636/1144 cut-off events. For 133443/133443 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5920 event pairs, 78 based on Foata normal form. 2/1143 useless extension candidates. Maximal degree in co-relation 7433. Up to 861 conditions per place. [2024-06-14 15:29:48,575 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 174 selfloop transitions, 69 changer transitions 0/245 dead transitions. [2024-06-14 15:29:48,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 245 transitions, 2733 flow [2024-06-14 15:29:48,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:29:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:29:48,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-14 15:29:48,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-14 15:29:48,576 INFO L175 Difference]: Start difference. First operand has 280 places, 226 transitions, 2167 flow. Second operand 11 states and 124 transitions. [2024-06-14 15:29:48,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 245 transitions, 2733 flow [2024-06-14 15:29:48,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 245 transitions, 2668 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-14 15:29:48,967 INFO L231 Difference]: Finished difference. Result has 283 places, 227 transitions, 2278 flow [2024-06-14 15:29:48,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2102, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2278, PETRI_PLACES=283, PETRI_TRANSITIONS=227} [2024-06-14 15:29:48,967 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 252 predicate places. [2024-06-14 15:29:48,967 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 227 transitions, 2278 flow [2024-06-14 15:29:48,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:29:48,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:48,967 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-14 15:29:48,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-14 15:29:48,967 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-14 15:29:48,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:48,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1526853930, now seen corresponding path program 4 times [2024-06-14 15:29:48,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:48,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748961422] [2024-06-14 15:29:48,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:48,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:29:55,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:55,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748961422] [2024-06-14 15:29:55,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748961422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:55,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:55,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:29:55,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696419059] [2024-06-14 15:29:55,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:55,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:29:55,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:55,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:29:55,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:29:55,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:29:55,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 227 transitions, 2278 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:29:55,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:55,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:29:55,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:55,697 INFO L124 PetriNetUnfolderBase]: 632/1137 cut-off events. [2024-06-14 15:29:55,697 INFO L125 PetriNetUnfolderBase]: For 125543/125543 co-relation queries the response was YES. [2024-06-14 15:29:55,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7437 conditions, 1137 events. 632/1137 cut-off events. For 125543/125543 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5881 event pairs, 123 based on Foata normal form. 2/1138 useless extension candidates. Maximal degree in co-relation 7298. Up to 1093 conditions per place. [2024-06-14 15:29:55,709 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 218 selfloop transitions, 20 changer transitions 0/240 dead transitions. [2024-06-14 15:29:55,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 240 transitions, 2790 flow [2024-06-14 15:29:55,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:29:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:29:55,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2024-06-14 15:29:55,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3039772727272727 [2024-06-14 15:29:55,710 INFO L175 Difference]: Start difference. First operand has 283 places, 227 transitions, 2278 flow. Second operand 11 states and 107 transitions. [2024-06-14 15:29:55,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 240 transitions, 2790 flow [2024-06-14 15:29:56,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 240 transitions, 2606 flow, removed 24 selfloop flow, removed 9 redundant places. [2024-06-14 15:29:56,063 INFO L231 Difference]: Finished difference. Result has 286 places, 228 transitions, 2153 flow [2024-06-14 15:29:56,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2094, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2153, PETRI_PLACES=286, PETRI_TRANSITIONS=228} [2024-06-14 15:29:56,063 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 255 predicate places. [2024-06-14 15:29:56,063 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 228 transitions, 2153 flow [2024-06-14 15:29:56,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:29:56,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:56,063 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-14 15:29:56,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-14 15:29:56,064 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:29:56,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:56,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1526862610, now seen corresponding path program 5 times [2024-06-14 15:29:56,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:56,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252062937] [2024-06-14 15:29:56,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:56,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:02,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-14 15:30:02,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:02,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252062937] [2024-06-14 15:30:02,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252062937] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:02,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:02,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:30:02,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747328284] [2024-06-14 15:30:02,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:02,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:30:02,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:02,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:30:02,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:30:02,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:30:02,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 228 transitions, 2153 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:30:02,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:02,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:30:02,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:02,679 INFO L124 PetriNetUnfolderBase]: 629/1132 cut-off events. [2024-06-14 15:30:02,680 INFO L125 PetriNetUnfolderBase]: For 116511/116511 co-relation queries the response was YES. [2024-06-14 15:30:02,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7033 conditions, 1132 events. 629/1132 cut-off events. For 116511/116511 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5868 event pairs, 124 based on Foata normal form. 2/1133 useless extension candidates. Maximal degree in co-relation 6892. Up to 1096 conditions per place. [2024-06-14 15:30:02,691 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 220 selfloop transitions, 17 changer transitions 0/239 dead transitions. [2024-06-14 15:30:02,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 239 transitions, 2651 flow [2024-06-14 15:30:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:30:02,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:30:02,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2024-06-14 15:30:02,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29545454545454547 [2024-06-14 15:30:02,692 INFO L175 Difference]: Start difference. First operand has 286 places, 228 transitions, 2153 flow. Second operand 11 states and 104 transitions. [2024-06-14 15:30:02,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 239 transitions, 2651 flow [2024-06-14 15:30:03,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 239 transitions, 2586 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-14 15:30:03,034 INFO L231 Difference]: Finished difference. Result has 288 places, 228 transitions, 2126 flow [2024-06-14 15:30:03,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2088, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2126, PETRI_PLACES=288, PETRI_TRANSITIONS=228} [2024-06-14 15:30:03,035 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 257 predicate places. [2024-06-14 15:30:03,035 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 228 transitions, 2126 flow [2024-06-14 15:30:03,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:30:03,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:03,035 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-14 15:30:03,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-14 15:30:03,035 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:30:03,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:03,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1991668204, now seen corresponding path program 5 times [2024-06-14 15:30:03,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:03,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564719019] [2024-06-14 15:30:03,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:03,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:09,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:09,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564719019] [2024-06-14 15:30:09,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564719019] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:09,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:09,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:30:09,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540367320] [2024-06-14 15:30:09,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:09,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:30:09,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:09,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:30:09,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:30:09,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:30:09,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 228 transitions, 2126 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:30:09,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:09,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:30:09,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:09,806 INFO L124 PetriNetUnfolderBase]: 635/1143 cut-off events. [2024-06-14 15:30:09,806 INFO L125 PetriNetUnfolderBase]: For 116255/116255 co-relation queries the response was YES. [2024-06-14 15:30:09,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7049 conditions, 1143 events. 635/1143 cut-off events. For 116255/116255 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5921 event pairs, 95 based on Foata normal form. 2/1142 useless extension candidates. Maximal degree in co-relation 6907. Up to 606 conditions per place. [2024-06-14 15:30:09,818 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 148 selfloop transitions, 102 changer transitions 0/252 dead transitions. [2024-06-14 15:30:09,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 252 transitions, 3136 flow [2024-06-14 15:30:09,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:30:09,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:30:09,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2024-06-14 15:30:09,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3723958333333333 [2024-06-14 15:30:09,820 INFO L175 Difference]: Start difference. First operand has 288 places, 228 transitions, 2126 flow. Second operand 12 states and 143 transitions. [2024-06-14 15:30:09,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 252 transitions, 3136 flow [2024-06-14 15:30:10,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 252 transitions, 3096 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-14 15:30:10,204 INFO L231 Difference]: Finished difference. Result has 290 places, 230 transitions, 2331 flow [2024-06-14 15:30:10,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2086, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2331, PETRI_PLACES=290, PETRI_TRANSITIONS=230} [2024-06-14 15:30:10,205 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 259 predicate places. [2024-06-14 15:30:10,205 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 230 transitions, 2331 flow [2024-06-14 15:30:10,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:30:10,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:10,205 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-14 15:30:10,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-14 15:30:10,205 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:30:10,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:10,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1873506168, now seen corresponding path program 16 times [2024-06-14 15:30:10,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:10,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603639218] [2024-06-14 15:30:10,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:10,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:16,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:16,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:16,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603639218] [2024-06-14 15:30:16,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603639218] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:16,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:16,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:30:16,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3502235] [2024-06-14 15:30:16,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:16,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:30:16,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:16,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:30:16,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:30:16,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:30:16,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 230 transitions, 2331 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:30:16,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:16,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:30:16,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:17,013 INFO L124 PetriNetUnfolderBase]: 639/1151 cut-off events. [2024-06-14 15:30:17,013 INFO L125 PetriNetUnfolderBase]: For 119439/119439 co-relation queries the response was YES. [2024-06-14 15:30:17,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7366 conditions, 1151 events. 639/1151 cut-off events. For 119439/119439 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6006 event pairs, 73 based on Foata normal form. 2/1150 useless extension candidates. Maximal degree in co-relation 7223. Up to 888 conditions per place. [2024-06-14 15:30:17,025 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 172 selfloop transitions, 74 changer transitions 0/248 dead transitions. [2024-06-14 15:30:17,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 248 transitions, 2903 flow [2024-06-14 15:30:17,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:30:17,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:30:17,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-14 15:30:17,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2024-06-14 15:30:17,027 INFO L175 Difference]: Start difference. First operand has 290 places, 230 transitions, 2331 flow. Second operand 11 states and 120 transitions. [2024-06-14 15:30:17,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 248 transitions, 2903 flow [2024-06-14 15:30:17,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 248 transitions, 2679 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-14 15:30:17,377 INFO L231 Difference]: Finished difference. Result has 291 places, 231 transitions, 2295 flow [2024-06-14 15:30:17,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2107, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2295, PETRI_PLACES=291, PETRI_TRANSITIONS=231} [2024-06-14 15:30:17,378 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 260 predicate places. [2024-06-14 15:30:17,378 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 231 transitions, 2295 flow [2024-06-14 15:30:17,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:30:17,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:17,378 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-14 15:30:17,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-14 15:30:17,379 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:30:17,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:17,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1873686092, now seen corresponding path program 6 times [2024-06-14 15:30:17,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:17,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99097320] [2024-06-14 15:30:17,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:17,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:23,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:23,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:23,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99097320] [2024-06-14 15:30:23,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99097320] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:23,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:23,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:30:23,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364835418] [2024-06-14 15:30:23,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:23,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:30:23,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:23,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:30:23,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:30:23,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:30:23,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 231 transitions, 2295 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:23,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:23,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:30:23,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:23,997 INFO L124 PetriNetUnfolderBase]: 635/1145 cut-off events. [2024-06-14 15:30:23,997 INFO L125 PetriNetUnfolderBase]: For 110521/110521 co-relation queries the response was YES. [2024-06-14 15:30:24,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7056 conditions, 1145 events. 635/1145 cut-off events. For 110521/110521 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 5971 event pairs, 76 based on Foata normal form. 2/1144 useless extension candidates. Maximal degree in co-relation 6912. Up to 738 conditions per place. [2024-06-14 15:30:24,008 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 149 selfloop transitions, 101 changer transitions 0/252 dead transitions. [2024-06-14 15:30:24,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 252 transitions, 2864 flow [2024-06-14 15:30:24,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:30:24,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:30:24,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-14 15:30:24,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36079545454545453 [2024-06-14 15:30:24,009 INFO L175 Difference]: Start difference. First operand has 291 places, 231 transitions, 2295 flow. Second operand 11 states and 127 transitions. [2024-06-14 15:30:24,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 252 transitions, 2864 flow [2024-06-14 15:30:24,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 252 transitions, 2670 flow, removed 24 selfloop flow, removed 9 redundant places. [2024-06-14 15:30:24,352 INFO L231 Difference]: Finished difference. Result has 296 places, 234 transitions, 2410 flow [2024-06-14 15:30:24,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2101, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2410, PETRI_PLACES=296, PETRI_TRANSITIONS=234} [2024-06-14 15:30:24,352 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 265 predicate places. [2024-06-14 15:30:24,352 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 234 transitions, 2410 flow [2024-06-14 15:30:24,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:24,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:24,352 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-14 15:30:24,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-14 15:30:24,352 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:30:24,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:24,353 INFO L85 PathProgramCache]: Analyzing trace with hash -673984418, now seen corresponding path program 17 times [2024-06-14 15:30:24,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:24,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032036327] [2024-06-14 15:30:24,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:24,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:30,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:30,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:30,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032036327] [2024-06-14 15:30:30,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032036327] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:30,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:30,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:30:30,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998569531] [2024-06-14 15:30:30,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:30,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:30:30,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:30,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:30:30,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:30:30,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:30:30,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 234 transitions, 2410 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:30:30,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:30,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:30:30,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:30,931 INFO L124 PetriNetUnfolderBase]: 646/1166 cut-off events. [2024-06-14 15:30:30,932 INFO L125 PetriNetUnfolderBase]: For 124655/124655 co-relation queries the response was YES. [2024-06-14 15:30:30,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7654 conditions, 1166 events. 646/1166 cut-off events. For 124655/124655 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6145 event pairs, 71 based on Foata normal form. 2/1165 useless extension candidates. Maximal degree in co-relation 7506. Up to 874 conditions per place. [2024-06-14 15:30:30,947 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 175 selfloop transitions, 77 changer transitions 0/254 dead transitions. [2024-06-14 15:30:30,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 254 transitions, 3244 flow [2024-06-14 15:30:30,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:30:30,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:30:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-14 15:30:30,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:30:30,948 INFO L175 Difference]: Start difference. First operand has 296 places, 234 transitions, 2410 flow. Second operand 11 states and 121 transitions. [2024-06-14 15:30:30,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 254 transitions, 3244 flow [2024-06-14 15:30:31,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 254 transitions, 3069 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-14 15:30:31,365 INFO L231 Difference]: Finished difference. Result has 298 places, 236 transitions, 2467 flow [2024-06-14 15:30:31,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2235, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2467, PETRI_PLACES=298, PETRI_TRANSITIONS=236} [2024-06-14 15:30:31,365 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 267 predicate places. [2024-06-14 15:30:31,365 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 236 transitions, 2467 flow [2024-06-14 15:30:31,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:30:31,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:31,365 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-14 15:30:31,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-14 15:30:31,365 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:30:31,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:31,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1879935258, now seen corresponding path program 18 times [2024-06-14 15:30:31,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:31,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924139975] [2024-06-14 15:30:31,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:31,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:37,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:37,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:37,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924139975] [2024-06-14 15:30:37,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924139975] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:37,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:37,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:30:37,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407862416] [2024-06-14 15:30:37,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:37,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:30:37,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:37,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:30:37,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:30:37,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:30:37,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 236 transitions, 2467 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:30:37,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:37,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:30:37,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:38,365 INFO L124 PetriNetUnfolderBase]: 643/1161 cut-off events. [2024-06-14 15:30:38,365 INFO L125 PetriNetUnfolderBase]: For 115801/115801 co-relation queries the response was YES. [2024-06-14 15:30:38,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7367 conditions, 1161 events. 643/1161 cut-off events. For 115801/115801 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6103 event pairs, 75 based on Foata normal form. 2/1160 useless extension candidates. Maximal degree in co-relation 7218. Up to 898 conditions per place. [2024-06-14 15:30:38,374 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 179 selfloop transitions, 73 changer transitions 0/254 dead transitions. [2024-06-14 15:30:38,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 254 transitions, 3021 flow [2024-06-14 15:30:38,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:30:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:30:38,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2024-06-14 15:30:38,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3465909090909091 [2024-06-14 15:30:38,376 INFO L175 Difference]: Start difference. First operand has 298 places, 236 transitions, 2467 flow. Second operand 11 states and 122 transitions. [2024-06-14 15:30:38,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 254 transitions, 3021 flow [2024-06-14 15:30:38,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 254 transitions, 2858 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-06-14 15:30:38,734 INFO L231 Difference]: Finished difference. Result has 302 places, 236 transitions, 2454 flow [2024-06-14 15:30:38,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2304, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2454, PETRI_PLACES=302, PETRI_TRANSITIONS=236} [2024-06-14 15:30:38,735 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 271 predicate places. [2024-06-14 15:30:38,735 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 236 transitions, 2454 flow [2024-06-14 15:30:38,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:30:38,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:38,735 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-14 15:30:38,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-14 15:30:38,735 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:30:38,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:38,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1910499788, now seen corresponding path program 7 times [2024-06-14 15:30:38,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:38,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919396941] [2024-06-14 15:30:38,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:38,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:44,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-14 15:30:44,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:44,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919396941] [2024-06-14 15:30:44,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919396941] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:44,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:44,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:30:44,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126193485] [2024-06-14 15:30:44,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:44,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:30:44,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:44,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:30:44,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:30:44,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:30:44,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 236 transitions, 2454 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:44,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:44,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:30:44,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:45,061 INFO L124 PetriNetUnfolderBase]: 639/1155 cut-off events. [2024-06-14 15:30:45,061 INFO L125 PetriNetUnfolderBase]: For 105081/105081 co-relation queries the response was YES. [2024-06-14 15:30:45,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7131 conditions, 1155 events. 639/1155 cut-off events. For 105081/105081 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6054 event pairs, 88 based on Foata normal form. 2/1154 useless extension candidates. Maximal degree in co-relation 6980. Up to 740 conditions per place. [2024-06-14 15:30:45,074 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 153 selfloop transitions, 99 changer transitions 0/254 dead transitions. [2024-06-14 15:30:45,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 254 transitions, 3010 flow [2024-06-14 15:30:45,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:30:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:30:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-14 15:30:45,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 15:30:45,075 INFO L175 Difference]: Start difference. First operand has 302 places, 236 transitions, 2454 flow. Second operand 11 states and 128 transitions. [2024-06-14 15:30:45,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 254 transitions, 3010 flow [2024-06-14 15:30:45,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 254 transitions, 2836 flow, removed 11 selfloop flow, removed 10 redundant places. [2024-06-14 15:30:45,433 INFO L231 Difference]: Finished difference. Result has 303 places, 236 transitions, 2491 flow [2024-06-14 15:30:45,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2280, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2491, PETRI_PLACES=303, PETRI_TRANSITIONS=236} [2024-06-14 15:30:45,433 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 272 predicate places. [2024-06-14 15:30:45,433 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 236 transitions, 2491 flow [2024-06-14 15:30:45,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:45,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:45,433 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-14 15:30:45,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-14 15:30:45,433 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:30:45,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:45,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1910508468, now seen corresponding path program 6 times [2024-06-14 15:30:45,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:45,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576926927] [2024-06-14 15:30:45,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:45,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:51,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:51,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:51,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576926927] [2024-06-14 15:30:51,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576926927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:51,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:51,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:30:51,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129183874] [2024-06-14 15:30:51,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:51,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:30:51,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:51,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:30:51,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:30:51,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:30:51,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 236 transitions, 2491 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:30:51,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:51,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:30:51,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:51,973 INFO L124 PetriNetUnfolderBase]: 643/1163 cut-off events. [2024-06-14 15:30:51,973 INFO L125 PetriNetUnfolderBase]: For 107416/107416 co-relation queries the response was YES. [2024-06-14 15:30:51,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7272 conditions, 1163 events. 643/1163 cut-off events. For 107416/107416 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6131 event pairs, 122 based on Foata normal form. 2/1162 useless extension candidates. Maximal degree in co-relation 7120. Up to 1074 conditions per place. [2024-06-14 15:30:51,988 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 208 selfloop transitions, 38 changer transitions 0/248 dead transitions. [2024-06-14 15:30:51,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 248 transitions, 3041 flow [2024-06-14 15:30:51,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:30:51,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:30:51,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2024-06-14 15:30:51,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2024-06-14 15:30:51,990 INFO L175 Difference]: Start difference. First operand has 303 places, 236 transitions, 2491 flow. Second operand 11 states and 112 transitions. [2024-06-14 15:30:51,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 248 transitions, 3041 flow [2024-06-14 15:30:52,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 248 transitions, 2732 flow, removed 2 selfloop flow, removed 13 redundant places. [2024-06-14 15:30:52,361 INFO L231 Difference]: Finished difference. Result has 301 places, 237 transitions, 2298 flow [2024-06-14 15:30:52,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2182, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2298, PETRI_PLACES=301, PETRI_TRANSITIONS=237} [2024-06-14 15:30:52,361 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 270 predicate places. [2024-06-14 15:30:52,361 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 237 transitions, 2298 flow [2024-06-14 15:30:52,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:30:52,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:52,361 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-14 15:30:52,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-14 15:30:52,362 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:30:52,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:52,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1733130684, now seen corresponding path program 19 times [2024-06-14 15:30:52,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:52,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219379581] [2024-06-14 15:30:52,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:52,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:57,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:57,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:57,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219379581] [2024-06-14 15:30:57,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219379581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:57,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:57,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:30:57,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740497771] [2024-06-14 15:30:57,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:57,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:30:57,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:57,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:30:57,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:30:58,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:30:58,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 237 transitions, 2298 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:58,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:58,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:30:58,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:58,431 INFO L124 PetriNetUnfolderBase]: 647/1171 cut-off events. [2024-06-14 15:30:58,431 INFO L125 PetriNetUnfolderBase]: For 105546/105546 co-relation queries the response was YES. [2024-06-14 15:30:58,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7099 conditions, 1171 events. 647/1171 cut-off events. For 105546/105546 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6183 event pairs, 82 based on Foata normal form. 2/1170 useless extension candidates. Maximal degree in co-relation 6947. Up to 908 conditions per place. [2024-06-14 15:30:58,441 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 183 selfloop transitions, 70 changer transitions 0/255 dead transitions. [2024-06-14 15:30:58,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 255 transitions, 2888 flow [2024-06-14 15:30:58,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:30:58,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:30:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-14 15:30:58,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:30:58,442 INFO L175 Difference]: Start difference. First operand has 301 places, 237 transitions, 2298 flow. Second operand 11 states and 121 transitions. [2024-06-14 15:30:58,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 255 transitions, 2888 flow [2024-06-14 15:30:58,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 255 transitions, 2782 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-14 15:30:58,826 INFO L231 Difference]: Finished difference. Result has 303 places, 238 transitions, 2376 flow [2024-06-14 15:30:58,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2192, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2376, PETRI_PLACES=303, PETRI_TRANSITIONS=238} [2024-06-14 15:30:58,826 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 272 predicate places. [2024-06-14 15:30:58,827 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 238 transitions, 2376 flow [2024-06-14 15:30:58,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:58,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:58,827 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-14 15:30:58,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-14 15:30:58,827 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:30:58,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:58,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1733126034, now seen corresponding path program 20 times [2024-06-14 15:30:58,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:58,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393585434] [2024-06-14 15:30:58,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:58,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:04,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:04,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:04,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393585434] [2024-06-14 15:31:04,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393585434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:04,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:04,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:31:04,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320896047] [2024-06-14 15:31:04,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:04,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:31:04,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:04,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:31:04,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:31:04,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:31:04,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 238 transitions, 2376 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:31:04,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:04,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:31:04,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:05,233 INFO L124 PetriNetUnfolderBase]: 651/1179 cut-off events. [2024-06-14 15:31:05,233 INFO L125 PetriNetUnfolderBase]: For 107856/107856 co-relation queries the response was YES. [2024-06-14 15:31:05,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7247 conditions, 1179 events. 651/1179 cut-off events. For 107856/107856 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6259 event pairs, 82 based on Foata normal form. 2/1178 useless extension candidates. Maximal degree in co-relation 7094. Up to 902 conditions per place. [2024-06-14 15:31:05,246 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 183 selfloop transitions, 71 changer transitions 0/256 dead transitions. [2024-06-14 15:31:05,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 256 transitions, 2968 flow [2024-06-14 15:31:05,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:31:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:31:05,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2024-06-14 15:31:05,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3465909090909091 [2024-06-14 15:31:05,247 INFO L175 Difference]: Start difference. First operand has 303 places, 238 transitions, 2376 flow. Second operand 11 states and 122 transitions. [2024-06-14 15:31:05,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 256 transitions, 2968 flow [2024-06-14 15:31:05,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 256 transitions, 2794 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-14 15:31:05,593 INFO L231 Difference]: Finished difference. Result has 305 places, 239 transitions, 2390 flow [2024-06-14 15:31:05,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2202, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2390, PETRI_PLACES=305, PETRI_TRANSITIONS=239} [2024-06-14 15:31:05,594 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 274 predicate places. [2024-06-14 15:31:05,594 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 239 transitions, 2390 flow [2024-06-14 15:31:05,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:31:05,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:05,594 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-14 15:31:05,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-14 15:31:05,594 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:31:05,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:05,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1880181522, now seen corresponding path program 7 times [2024-06-14 15:31:05,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:05,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551519785] [2024-06-14 15:31:05,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:05,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:11,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:11,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551519785] [2024-06-14 15:31:11,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551519785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:11,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:11,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:31:11,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144189547] [2024-06-14 15:31:11,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:11,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:31:11,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:11,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:31:11,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:31:11,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:31:11,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 239 transitions, 2390 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:31:11,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:11,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:31:11,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:12,104 INFO L124 PetriNetUnfolderBase]: 648/1174 cut-off events. [2024-06-14 15:31:12,104 INFO L125 PetriNetUnfolderBase]: For 97216/97216 co-relation queries the response was YES. [2024-06-14 15:31:12,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6944 conditions, 1174 events. 648/1174 cut-off events. For 97216/97216 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6233 event pairs, 125 based on Foata normal form. 2/1173 useless extension candidates. Maximal degree in co-relation 6790. Up to 1085 conditions per place. [2024-06-14 15:31:12,118 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 209 selfloop transitions, 39 changer transitions 0/250 dead transitions. [2024-06-14 15:31:12,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 250 transitions, 2910 flow [2024-06-14 15:31:12,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:31:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:31:12,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2024-06-14 15:31:12,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3153409090909091 [2024-06-14 15:31:12,119 INFO L175 Difference]: Start difference. First operand has 305 places, 239 transitions, 2390 flow. Second operand 11 states and 111 transitions. [2024-06-14 15:31:12,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 250 transitions, 2910 flow [2024-06-14 15:31:12,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 250 transitions, 2732 flow, removed 19 selfloop flow, removed 9 redundant places. [2024-06-14 15:31:12,424 INFO L231 Difference]: Finished difference. Result has 307 places, 239 transitions, 2294 flow [2024-06-14 15:31:12,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2212, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2294, PETRI_PLACES=307, PETRI_TRANSITIONS=239} [2024-06-14 15:31:12,425 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 276 predicate places. [2024-06-14 15:31:12,425 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 239 transitions, 2294 flow [2024-06-14 15:31:12,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:31:12,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:12,425 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-14 15:31:12,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-14 15:31:12,425 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:31:12,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:12,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1733010714, now seen corresponding path program 21 times [2024-06-14 15:31:12,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:12,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575131075] [2024-06-14 15:31:12,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:12,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:18,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-14 15:31:18,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:18,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575131075] [2024-06-14 15:31:18,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575131075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:18,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:18,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:31:18,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312262554] [2024-06-14 15:31:18,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:18,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:31:18,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:18,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:31:18,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:31:18,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:31:18,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 239 transitions, 2294 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:31:18,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:18,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:31:18,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:19,089 INFO L124 PetriNetUnfolderBase]: 645/1169 cut-off events. [2024-06-14 15:31:19,089 INFO L125 PetriNetUnfolderBase]: For 85781/85781 co-relation queries the response was YES. [2024-06-14 15:31:19,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6526 conditions, 1169 events. 645/1169 cut-off events. For 85781/85781 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6182 event pairs, 84 based on Foata normal form. 2/1168 useless extension candidates. Maximal degree in co-relation 6371. Up to 812 conditions per place. [2024-06-14 15:31:19,102 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 175 selfloop transitions, 79 changer transitions 0/256 dead transitions. [2024-06-14 15:31:19,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 256 transitions, 2844 flow [2024-06-14 15:31:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:31:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:31:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-14 15:31:19,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:31:19,103 INFO L175 Difference]: Start difference. First operand has 307 places, 239 transitions, 2294 flow. Second operand 11 states and 121 transitions. [2024-06-14 15:31:19,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 256 transitions, 2844 flow [2024-06-14 15:31:19,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 256 transitions, 2639 flow, removed 17 selfloop flow, removed 13 redundant places. [2024-06-14 15:31:19,458 INFO L231 Difference]: Finished difference. Result has 305 places, 239 transitions, 2251 flow [2024-06-14 15:31:19,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2089, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2251, PETRI_PLACES=305, PETRI_TRANSITIONS=239} [2024-06-14 15:31:19,459 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 274 predicate places. [2024-06-14 15:31:19,459 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 239 transitions, 2251 flow [2024-06-14 15:31:19,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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-14 15:31:19,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:19,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:31:19,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-14 15:31:19,459 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:31:19,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:19,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1402576894, now seen corresponding path program 1 times [2024-06-14 15:31:19,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:19,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519938394] [2024-06-14 15:31:19,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:19,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:25,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:25,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:25,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519938394] [2024-06-14 15:31:25,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519938394] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:25,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:25,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:31:25,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020641548] [2024-06-14 15:31:25,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:25,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:31:25,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:25,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:31:25,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:31:25,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:31:25,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 239 transitions, 2251 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:25,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:25,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:31:25,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:25,748 INFO L124 PetriNetUnfolderBase]: 649/1176 cut-off events. [2024-06-14 15:31:25,749 INFO L125 PetriNetUnfolderBase]: For 87351/87351 co-relation queries the response was YES. [2024-06-14 15:31:25,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6558 conditions, 1176 events. 649/1176 cut-off events. For 87351/87351 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6254 event pairs, 86 based on Foata normal form. 2/1177 useless extension candidates. Maximal degree in co-relation 6405. Up to 1027 conditions per place. [2024-06-14 15:31:25,761 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 229 selfloop transitions, 28 changer transitions 0/259 dead transitions. [2024-06-14 15:31:25,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 259 transitions, 2845 flow [2024-06-14 15:31:25,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:31:25,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:31:25,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-14 15:31:25,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3125 [2024-06-14 15:31:25,762 INFO L175 Difference]: Start difference. First operand has 305 places, 239 transitions, 2251 flow. Second operand 11 states and 110 transitions. [2024-06-14 15:31:25,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 259 transitions, 2845 flow [2024-06-14 15:31:26,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 259 transitions, 2514 flow, removed 20 selfloop flow, removed 13 redundant places. [2024-06-14 15:31:26,076 INFO L231 Difference]: Finished difference. Result has 303 places, 240 transitions, 2019 flow [2024-06-14 15:31:26,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1920, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2019, PETRI_PLACES=303, PETRI_TRANSITIONS=240} [2024-06-14 15:31:26,077 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 272 predicate places. [2024-06-14 15:31:26,077 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 240 transitions, 2019 flow [2024-06-14 15:31:26,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:26,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:26,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:31:26,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-14 15:31:26,077 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:31:26,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:26,077 INFO L85 PathProgramCache]: Analyzing trace with hash 503613834, now seen corresponding path program 2 times [2024-06-14 15:31:26,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:26,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912688063] [2024-06-14 15:31:26,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:26,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:31,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:31,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912688063] [2024-06-14 15:31:31,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912688063] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:31,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:31,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:31:31,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106975609] [2024-06-14 15:31:31,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:31,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:31:31,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:31,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:31:31,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:31:31,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:31:31,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 240 transitions, 2019 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:31,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:31,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:31:31,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:32,208 INFO L124 PetriNetUnfolderBase]: 653/1184 cut-off events. [2024-06-14 15:31:32,208 INFO L125 PetriNetUnfolderBase]: For 88341/88341 co-relation queries the response was YES. [2024-06-14 15:31:32,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6197 conditions, 1184 events. 653/1184 cut-off events. For 88341/88341 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6301 event pairs, 112 based on Foata normal form. 2/1185 useless extension candidates. Maximal degree in co-relation 6046. Up to 1057 conditions per place. [2024-06-14 15:31:32,221 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 218 selfloop transitions, 40 changer transitions 0/260 dead transitions. [2024-06-14 15:31:32,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 260 transitions, 2625 flow [2024-06-14 15:31:32,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:31:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:31:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-14 15:31:32,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32670454545454547 [2024-06-14 15:31:32,222 INFO L175 Difference]: Start difference. First operand has 303 places, 240 transitions, 2019 flow. Second operand 11 states and 115 transitions. [2024-06-14 15:31:32,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 260 transitions, 2625 flow [2024-06-14 15:31:32,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 260 transitions, 2491 flow, removed 18 selfloop flow, removed 10 redundant places. [2024-06-14 15:31:32,570 INFO L231 Difference]: Finished difference. Result has 304 places, 241 transitions, 2010 flow [2024-06-14 15:31:32,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2010, PETRI_PLACES=304, PETRI_TRANSITIONS=241} [2024-06-14 15:31:32,570 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 273 predicate places. [2024-06-14 15:31:32,570 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 241 transitions, 2010 flow [2024-06-14 15:31:32,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:32,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:32,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:31:32,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-14 15:31:32,570 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:31:32,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:32,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1753226762, now seen corresponding path program 3 times [2024-06-14 15:31:32,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:32,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959921983] [2024-06-14 15:31:32,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:32,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:38,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:38,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959921983] [2024-06-14 15:31:38,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959921983] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:38,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:38,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:31:38,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158373231] [2024-06-14 15:31:38,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:38,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:31:38,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:38,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:31:38,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:31:38,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:31:38,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 241 transitions, 2010 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:38,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:38,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:31:38,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:38,782 INFO L124 PetriNetUnfolderBase]: 664/1205 cut-off events. [2024-06-14 15:31:38,782 INFO L125 PetriNetUnfolderBase]: For 106881/106881 co-relation queries the response was YES. [2024-06-14 15:31:38,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6520 conditions, 1205 events. 664/1205 cut-off events. For 106881/106881 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 6471 event pairs, 113 based on Foata normal form. 2/1206 useless extension candidates. Maximal degree in co-relation 6369. Up to 1035 conditions per place. [2024-06-14 15:31:38,795 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 221 selfloop transitions, 40 changer transitions 0/263 dead transitions. [2024-06-14 15:31:38,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 263 transitions, 2890 flow [2024-06-14 15:31:38,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:31:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:31:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-14 15:31:38,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3352272727272727 [2024-06-14 15:31:38,797 INFO L175 Difference]: Start difference. First operand has 304 places, 241 transitions, 2010 flow. Second operand 11 states and 118 transitions. [2024-06-14 15:31:38,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 263 transitions, 2890 flow [2024-06-14 15:31:39,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 263 transitions, 2777 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-14 15:31:39,121 INFO L231 Difference]: Finished difference. Result has 306 places, 243 transitions, 2063 flow [2024-06-14 15:31:39,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2063, PETRI_PLACES=306, PETRI_TRANSITIONS=243} [2024-06-14 15:31:39,121 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 275 predicate places. [2024-06-14 15:31:39,121 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 243 transitions, 2063 flow [2024-06-14 15:31:39,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:39,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:39,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:31:39,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-14 15:31:39,122 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:31:39,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:39,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1753370912, now seen corresponding path program 4 times [2024-06-14 15:31:39,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:39,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925040825] [2024-06-14 15:31:39,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:39,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:45,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-14 15:31:45,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:45,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925040825] [2024-06-14 15:31:45,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925040825] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:45,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:45,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:31:45,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5694878] [2024-06-14 15:31:45,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:45,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:31:45,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:45,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:31:45,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:31:45,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:31:45,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 243 transitions, 2063 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:45,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:45,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:31:45,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:45,673 INFO L124 PetriNetUnfolderBase]: 661/1200 cut-off events. [2024-06-14 15:31:45,673 INFO L125 PetriNetUnfolderBase]: For 95131/95131 co-relation queries the response was YES. [2024-06-14 15:31:45,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6203 conditions, 1200 events. 661/1200 cut-off events. For 95131/95131 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 6440 event pairs, 114 based on Foata normal form. 2/1201 useless extension candidates. Maximal degree in co-relation 6051. Up to 1057 conditions per place. [2024-06-14 15:31:45,686 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 220 selfloop transitions, 40 changer transitions 0/262 dead transitions. [2024-06-14 15:31:45,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 262 transitions, 2633 flow [2024-06-14 15:31:45,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:31:45,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:31:45,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-14 15:31:45,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32954545454545453 [2024-06-14 15:31:45,687 INFO L175 Difference]: Start difference. First operand has 306 places, 243 transitions, 2063 flow. Second operand 11 states and 116 transitions. [2024-06-14 15:31:45,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 262 transitions, 2633 flow [2024-06-14 15:31:45,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 262 transitions, 2507 flow, removed 37 selfloop flow, removed 7 redundant places. [2024-06-14 15:31:45,979 INFO L231 Difference]: Finished difference. Result has 310 places, 243 transitions, 2021 flow [2024-06-14 15:31:45,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1937, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2021, PETRI_PLACES=310, PETRI_TRANSITIONS=243} [2024-06-14 15:31:45,980 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 279 predicate places. [2024-06-14 15:31:45,980 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 243 transitions, 2021 flow [2024-06-14 15:31:45,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:45,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:45,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:31:45,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-14 15:31:45,980 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:31:45,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:45,980 INFO L85 PathProgramCache]: Analyzing trace with hash 499889184, now seen corresponding path program 5 times [2024-06-14 15:31:45,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:45,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144972301] [2024-06-14 15:31:45,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:45,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:51,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:51,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:51,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144972301] [2024-06-14 15:31:51,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144972301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:51,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:51,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:31:51,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910191108] [2024-06-14 15:31:51,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:51,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:31:51,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:51,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:31:51,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:31:51,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:31:51,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 243 transitions, 2021 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:51,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:51,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:31:51,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:52,229 INFO L124 PetriNetUnfolderBase]: 665/1208 cut-off events. [2024-06-14 15:31:52,229 INFO L125 PetriNetUnfolderBase]: For 96245/96245 co-relation queries the response was YES. [2024-06-14 15:31:52,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6226 conditions, 1208 events. 665/1208 cut-off events. For 96245/96245 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 6500 event pairs, 116 based on Foata normal form. 2/1209 useless extension candidates. Maximal degree in co-relation 6072. Up to 1005 conditions per place. [2024-06-14 15:31:52,240 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 223 selfloop transitions, 38 changer transitions 0/263 dead transitions. [2024-06-14 15:31:52,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 263 transitions, 2631 flow [2024-06-14 15:31:52,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:31:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:31:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-14 15:31:52,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3352272727272727 [2024-06-14 15:31:52,241 INFO L175 Difference]: Start difference. First operand has 310 places, 243 transitions, 2021 flow. Second operand 11 states and 118 transitions. [2024-06-14 15:31:52,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 263 transitions, 2631 flow [2024-06-14 15:31:52,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 263 transitions, 2542 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-14 15:31:52,587 INFO L231 Difference]: Finished difference. Result has 311 places, 244 transitions, 2056 flow [2024-06-14 15:31:52,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1932, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2056, PETRI_PLACES=311, PETRI_TRANSITIONS=244} [2024-06-14 15:31:52,587 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 280 predicate places. [2024-06-14 15:31:52,587 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 244 transitions, 2056 flow [2024-06-14 15:31:52,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:52,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:52,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:31:52,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-14 15:31:52,588 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:31:52,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:52,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1940802400, now seen corresponding path program 1 times [2024-06-14 15:31:52,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:52,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68834021] [2024-06-14 15:31:52,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:52,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:59,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:59,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68834021] [2024-06-14 15:31:59,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68834021] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:59,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:59,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:31:59,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236075110] [2024-06-14 15:31:59,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:59,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:31:59,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:59,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:31:59,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:31:59,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:31:59,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 244 transitions, 2056 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:59,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:59,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:31:59,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:59,682 INFO L124 PetriNetUnfolderBase]: 687/1253 cut-off events. [2024-06-14 15:31:59,682 INFO L125 PetriNetUnfolderBase]: For 151515/151517 co-relation queries the response was YES. [2024-06-14 15:31:59,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6392 conditions, 1253 events. 687/1253 cut-off events. For 151515/151517 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 6754 event pairs, 117 based on Foata normal form. 12/1264 useless extension candidates. Maximal degree in co-relation 6237. Up to 1104 conditions per place. [2024-06-14 15:31:59,695 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 233 selfloop transitions, 29 changer transitions 11/275 dead transitions. [2024-06-14 15:31:59,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 275 transitions, 2719 flow [2024-06-14 15:31:59,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 15:31:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 15:31:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2024-06-14 15:31:59,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3293269230769231 [2024-06-14 15:31:59,696 INFO L175 Difference]: Start difference. First operand has 311 places, 244 transitions, 2056 flow. Second operand 13 states and 137 transitions. [2024-06-14 15:31:59,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 275 transitions, 2719 flow [2024-06-14 15:32:00,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 275 transitions, 2605 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-14 15:32:00,097 INFO L231 Difference]: Finished difference. Result has 316 places, 243 transitions, 1994 flow [2024-06-14 15:32:00,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1942, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1994, PETRI_PLACES=316, PETRI_TRANSITIONS=243} [2024-06-14 15:32:00,098 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 285 predicate places. [2024-06-14 15:32:00,098 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 243 transitions, 1994 flow [2024-06-14 15:32:00,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:00,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:00,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:32:00,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-14 15:32:00,098 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:32:00,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:00,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1872281324, now seen corresponding path program 6 times [2024-06-14 15:32:00,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:00,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714481346] [2024-06-14 15:32:00,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:00,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:32:06,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:06,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714481346] [2024-06-14 15:32:06,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714481346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:06,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:06,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:32:06,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976691003] [2024-06-14 15:32:06,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:06,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:32:06,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:06,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:32:06,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:32:06,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:32:06,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 243 transitions, 1994 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:06,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:06,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:32:06,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:06,614 INFO L124 PetriNetUnfolderBase]: 665/1212 cut-off events. [2024-06-14 15:32:06,614 INFO L125 PetriNetUnfolderBase]: For 99559/99559 co-relation queries the response was YES. [2024-06-14 15:32:06,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6230 conditions, 1212 events. 665/1212 cut-off events. For 99559/99559 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 6549 event pairs, 108 based on Foata normal form. 2/1213 useless extension candidates. Maximal degree in co-relation 6073. Up to 970 conditions per place. [2024-06-14 15:32:06,627 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 203 selfloop transitions, 60 changer transitions 0/265 dead transitions. [2024-06-14 15:32:06,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 265 transitions, 2622 flow [2024-06-14 15:32:06,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:32:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:32:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions. [2024-06-14 15:32:06,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:32:06,628 INFO L175 Difference]: Start difference. First operand has 316 places, 243 transitions, 1994 flow. Second operand 12 states and 132 transitions. [2024-06-14 15:32:06,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 265 transitions, 2622 flow [2024-06-14 15:32:07,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 265 transitions, 2558 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-14 15:32:07,010 INFO L231 Difference]: Finished difference. Result has 314 places, 244 transitions, 2100 flow [2024-06-14 15:32:07,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2100, PETRI_PLACES=314, PETRI_TRANSITIONS=244} [2024-06-14 15:32:07,011 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 283 predicate places. [2024-06-14 15:32:07,011 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 244 transitions, 2100 flow [2024-06-14 15:32:07,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:07,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:07,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:32:07,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-14 15:32:07,013 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:32:07,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:07,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1872275744, now seen corresponding path program 7 times [2024-06-14 15:32:07,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:07,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330370466] [2024-06-14 15:32:07,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:07,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:32:12,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:12,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330370466] [2024-06-14 15:32:12,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330370466] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:12,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:12,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:32:12,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759163796] [2024-06-14 15:32:12,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:12,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:32:12,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:12,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:32:12,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:32:12,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:32:12,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 244 transitions, 2100 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:12,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:12,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:32:12,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:13,418 INFO L124 PetriNetUnfolderBase]: 669/1220 cut-off events. [2024-06-14 15:32:13,419 INFO L125 PetriNetUnfolderBase]: For 100789/100789 co-relation queries the response was YES. [2024-06-14 15:32:13,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6404 conditions, 1220 events. 669/1220 cut-off events. For 100789/100789 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 6586 event pairs, 106 based on Foata normal form. 2/1221 useless extension candidates. Maximal degree in co-relation 6248. Up to 964 conditions per place. [2024-06-14 15:32:13,431 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 203 selfloop transitions, 61 changer transitions 0/266 dead transitions. [2024-06-14 15:32:13,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 266 transitions, 2730 flow [2024-06-14 15:32:13,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:32:13,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:32:13,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 133 transitions. [2024-06-14 15:32:13,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3463541666666667 [2024-06-14 15:32:13,432 INFO L175 Difference]: Start difference. First operand has 314 places, 244 transitions, 2100 flow. Second operand 12 states and 133 transitions. [2024-06-14 15:32:13,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 266 transitions, 2730 flow [2024-06-14 15:32:13,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 266 transitions, 2570 flow, removed 21 selfloop flow, removed 10 redundant places. [2024-06-14 15:32:13,823 INFO L231 Difference]: Finished difference. Result has 316 places, 245 transitions, 2114 flow [2024-06-14 15:32:13,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1940, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2114, PETRI_PLACES=316, PETRI_TRANSITIONS=245} [2024-06-14 15:32:13,823 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 285 predicate places. [2024-06-14 15:32:13,823 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 245 transitions, 2114 flow [2024-06-14 15:32:13,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:13,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:13,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:32:13,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-14 15:32:13,824 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:32:13,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:13,824 INFO L85 PathProgramCache]: Analyzing trace with hash 875473290, now seen corresponding path program 8 times [2024-06-14 15:32:13,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:13,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432003074] [2024-06-14 15:32:13,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:13,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:32:19,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:19,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432003074] [2024-06-14 15:32:19,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432003074] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:19,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:19,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:32:19,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854362317] [2024-06-14 15:32:19,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:19,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:32:19,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:19,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:32:19,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:32:19,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:32:19,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 245 transitions, 2114 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:19,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:19,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:32:19,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:20,055 INFO L124 PetriNetUnfolderBase]: 673/1228 cut-off events. [2024-06-14 15:32:20,055 INFO L125 PetriNetUnfolderBase]: For 102636/102636 co-relation queries the response was YES. [2024-06-14 15:32:20,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6457 conditions, 1228 events. 673/1228 cut-off events. For 102636/102636 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 6653 event pairs, 120 based on Foata normal form. 2/1229 useless extension candidates. Maximal degree in co-relation 6300. Up to 986 conditions per place. [2024-06-14 15:32:20,068 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 208 selfloop transitions, 57 changer transitions 0/267 dead transitions. [2024-06-14 15:32:20,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 267 transitions, 2750 flow [2024-06-14 15:32:20,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:32:20,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:32:20,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 133 transitions. [2024-06-14 15:32:20,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3463541666666667 [2024-06-14 15:32:20,069 INFO L175 Difference]: Start difference. First operand has 316 places, 245 transitions, 2114 flow. Second operand 12 states and 133 transitions. [2024-06-14 15:32:20,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 267 transitions, 2750 flow [2024-06-14 15:32:20,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 267 transitions, 2586 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-06-14 15:32:20,469 INFO L231 Difference]: Finished difference. Result has 318 places, 246 transitions, 2118 flow [2024-06-14 15:32:20,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1950, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2118, PETRI_PLACES=318, PETRI_TRANSITIONS=246} [2024-06-14 15:32:20,470 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 287 predicate places. [2024-06-14 15:32:20,470 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 246 transitions, 2118 flow [2024-06-14 15:32:20,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:20,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:20,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:32:20,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-14 15:32:20,470 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:32:20,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:20,471 INFO L85 PathProgramCache]: Analyzing trace with hash 875467710, now seen corresponding path program 9 times [2024-06-14 15:32:20,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:20,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425649120] [2024-06-14 15:32:20,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:20,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:26,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:32:26,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:26,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425649120] [2024-06-14 15:32:26,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425649120] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:26,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:26,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:32:26,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434252987] [2024-06-14 15:32:26,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:26,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:32:26,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:26,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:32:26,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:32:26,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:32:26,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 246 transitions, 2118 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:26,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:26,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:32:26,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:26,671 INFO L124 PetriNetUnfolderBase]: 677/1236 cut-off events. [2024-06-14 15:32:26,672 INFO L125 PetriNetUnfolderBase]: For 104634/104634 co-relation queries the response was YES. [2024-06-14 15:32:26,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6496 conditions, 1236 events. 677/1236 cut-off events. For 104634/104634 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6710 event pairs, 120 based on Foata normal form. 2/1237 useless extension candidates. Maximal degree in co-relation 6338. Up to 980 conditions per place. [2024-06-14 15:32:26,689 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 208 selfloop transitions, 58 changer transitions 0/268 dead transitions. [2024-06-14 15:32:26,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 268 transitions, 2756 flow [2024-06-14 15:32:26,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:32:26,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:32:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 134 transitions. [2024-06-14 15:32:26,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3489583333333333 [2024-06-14 15:32:26,690 INFO L175 Difference]: Start difference. First operand has 318 places, 246 transitions, 2118 flow. Second operand 12 states and 134 transitions. [2024-06-14 15:32:26,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 268 transitions, 2756 flow [2024-06-14 15:32:27,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 268 transitions, 2598 flow, removed 23 selfloop flow, removed 10 redundant places. [2024-06-14 15:32:27,107 INFO L231 Difference]: Finished difference. Result has 320 places, 247 transitions, 2132 flow [2024-06-14 15:32:27,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1960, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2132, PETRI_PLACES=320, PETRI_TRANSITIONS=247} [2024-06-14 15:32:27,108 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 289 predicate places. [2024-06-14 15:32:27,108 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 247 transitions, 2132 flow [2024-06-14 15:32:27,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:27,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:27,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:32:27,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-14 15:32:27,108 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:32:27,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:27,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2078934764, now seen corresponding path program 10 times [2024-06-14 15:32:27,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:27,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615090843] [2024-06-14 15:32:27,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:27,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:32,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-14 15:32:32,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:32,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615090843] [2024-06-14 15:32:32,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615090843] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:32,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:32,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:32:32,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640291556] [2024-06-14 15:32:32,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:32,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:32:32,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:32,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:32:32,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:32:32,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:32:32,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 247 transitions, 2132 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:32,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:32,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:32:32,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:33,205 INFO L124 PetriNetUnfolderBase]: 697/1280 cut-off events. [2024-06-14 15:32:33,205 INFO L125 PetriNetUnfolderBase]: For 178689/178689 co-relation queries the response was YES. [2024-06-14 15:32:33,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6669 conditions, 1280 events. 697/1280 cut-off events. For 178689/178689 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 7011 event pairs, 114 based on Foata normal form. 12/1291 useless extension candidates. Maximal degree in co-relation 6510. Up to 996 conditions per place. [2024-06-14 15:32:33,218 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 202 selfloop transitions, 62 changer transitions 7/273 dead transitions. [2024-06-14 15:32:33,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 273 transitions, 2816 flow [2024-06-14 15:32:33,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:32:33,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:32:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 134 transitions. [2024-06-14 15:32:33,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3489583333333333 [2024-06-14 15:32:33,220 INFO L175 Difference]: Start difference. First operand has 320 places, 247 transitions, 2132 flow. Second operand 12 states and 134 transitions. [2024-06-14 15:32:33,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 273 transitions, 2816 flow [2024-06-14 15:32:33,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 273 transitions, 2654 flow, removed 24 selfloop flow, removed 10 redundant places. [2024-06-14 15:32:33,615 INFO L231 Difference]: Finished difference. Result has 322 places, 245 transitions, 2133 flow [2024-06-14 15:32:33,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1970, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2133, PETRI_PLACES=322, PETRI_TRANSITIONS=245} [2024-06-14 15:32:33,616 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 291 predicate places. [2024-06-14 15:32:33,616 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 245 transitions, 2133 flow [2024-06-14 15:32:33,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:33,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:33,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:32:33,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-14 15:32:33,617 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:32:33,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:33,617 INFO L85 PathProgramCache]: Analyzing trace with hash 875323560, now seen corresponding path program 11 times [2024-06-14 15:32:33,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:33,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273161724] [2024-06-14 15:32:33,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:33,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:39,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-14 15:32:39,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:39,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273161724] [2024-06-14 15:32:39,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273161724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:39,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:39,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:32:39,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353635677] [2024-06-14 15:32:39,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:39,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:32:39,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:39,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:32:39,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:32:39,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:32:39,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 245 transitions, 2133 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:39,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:39,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:32:39,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:40,108 INFO L124 PetriNetUnfolderBase]: 677/1240 cut-off events. [2024-06-14 15:32:40,108 INFO L125 PetriNetUnfolderBase]: For 108584/108584 co-relation queries the response was YES. [2024-06-14 15:32:40,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6566 conditions, 1240 events. 677/1240 cut-off events. For 108584/108584 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6785 event pairs, 120 based on Foata normal form. 2/1241 useless extension candidates. Maximal degree in co-relation 6406. Up to 968 conditions per place. [2024-06-14 15:32:40,122 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 209 selfloop transitions, 56 changer transitions 0/267 dead transitions. [2024-06-14 15:32:40,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 267 transitions, 2771 flow [2024-06-14 15:32:40,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:32:40,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:32:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 134 transitions. [2024-06-14 15:32:40,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3489583333333333 [2024-06-14 15:32:40,123 INFO L175 Difference]: Start difference. First operand has 322 places, 245 transitions, 2133 flow. Second operand 12 states and 134 transitions. [2024-06-14 15:32:40,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 267 transitions, 2771 flow [2024-06-14 15:32:40,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 267 transitions, 2563 flow, removed 25 selfloop flow, removed 12 redundant places. [2024-06-14 15:32:40,543 INFO L231 Difference]: Finished difference. Result has 322 places, 246 transitions, 2097 flow [2024-06-14 15:32:40,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1925, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2097, PETRI_PLACES=322, PETRI_TRANSITIONS=246} [2024-06-14 15:32:40,543 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 291 predicate places. [2024-06-14 15:32:40,543 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 246 transitions, 2097 flow [2024-06-14 15:32:40,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:40,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:40,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:32:40,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-14 15:32:40,544 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:32:40,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:40,544 INFO L85 PathProgramCache]: Analyzing trace with hash 677144546, now seen corresponding path program 12 times [2024-06-14 15:32:40,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:40,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949175745] [2024-06-14 15:32:40,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:40,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:32:46,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:46,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949175745] [2024-06-14 15:32:46,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949175745] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:46,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:46,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:32:46,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506581094] [2024-06-14 15:32:46,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:46,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:32:46,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:46,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:32:46,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:32:46,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:32:46,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 246 transitions, 2097 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:46,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:46,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:32:46,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:47,416 INFO L124 PetriNetUnfolderBase]: 681/1248 cut-off events. [2024-06-14 15:32:47,416 INFO L125 PetriNetUnfolderBase]: For 110490/110490 co-relation queries the response was YES. [2024-06-14 15:32:47,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6546 conditions, 1248 events. 681/1248 cut-off events. For 110490/110490 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 6840 event pairs, 112 based on Foata normal form. 2/1249 useless extension candidates. Maximal degree in co-relation 6386. Up to 1012 conditions per place. [2024-06-14 15:32:47,429 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 207 selfloop transitions, 59 changer transitions 0/268 dead transitions. [2024-06-14 15:32:47,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 268 transitions, 2743 flow [2024-06-14 15:32:47,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:32:47,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:32:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2024-06-14 15:32:47,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3385416666666667 [2024-06-14 15:32:47,430 INFO L175 Difference]: Start difference. First operand has 322 places, 246 transitions, 2097 flow. Second operand 12 states and 130 transitions. [2024-06-14 15:32:47,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 268 transitions, 2743 flow [2024-06-14 15:32:47,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 268 transitions, 2581 flow, removed 26 selfloop flow, removed 10 redundant places. [2024-06-14 15:32:47,816 INFO L231 Difference]: Finished difference. Result has 324 places, 247 transitions, 2115 flow [2024-06-14 15:32:47,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1935, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2115, PETRI_PLACES=324, PETRI_TRANSITIONS=247} [2024-06-14 15:32:47,816 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 293 predicate places. [2024-06-14 15:32:47,816 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 247 transitions, 2115 flow [2024-06-14 15:32:47,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:47,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:47,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:32:47,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-14 15:32:47,816 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:32:47,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:47,817 INFO L85 PathProgramCache]: Analyzing trace with hash 477693026, now seen corresponding path program 13 times [2024-06-14 15:32:47,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:47,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438631703] [2024-06-14 15:32:47,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:47,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:53,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:32:53,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:53,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438631703] [2024-06-14 15:32:53,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438631703] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:53,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:53,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:32:53,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804051895] [2024-06-14 15:32:53,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:53,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:32:53,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:53,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:32:53,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:32:54,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:32:54,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 247 transitions, 2115 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:54,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:54,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:32:54,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:54,751 INFO L124 PetriNetUnfolderBase]: 692/1269 cut-off events. [2024-06-14 15:32:54,751 INFO L125 PetriNetUnfolderBase]: For 129231/129231 co-relation queries the response was YES. [2024-06-14 15:32:54,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7045 conditions, 1269 events. 692/1269 cut-off events. For 129231/129231 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 6969 event pairs, 119 based on Foata normal form. 2/1270 useless extension candidates. Maximal degree in co-relation 6884. Up to 968 conditions per place. [2024-06-14 15:32:54,763 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 207 selfloop transitions, 62 changer transitions 0/271 dead transitions. [2024-06-14 15:32:54,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 271 transitions, 3073 flow [2024-06-14 15:32:54,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:32:54,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:32:54,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions. [2024-06-14 15:32:54,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:32:54,765 INFO L175 Difference]: Start difference. First operand has 324 places, 247 transitions, 2115 flow. Second operand 12 states and 132 transitions. [2024-06-14 15:32:54,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 271 transitions, 3073 flow [2024-06-14 15:32:55,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 271 transitions, 2903 flow, removed 27 selfloop flow, removed 10 redundant places. [2024-06-14 15:32:55,265 INFO L231 Difference]: Finished difference. Result has 326 places, 249 transitions, 2191 flow [2024-06-14 15:32:55,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1945, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2191, PETRI_PLACES=326, PETRI_TRANSITIONS=249} [2024-06-14 15:32:55,265 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 295 predicate places. [2024-06-14 15:32:55,265 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 249 transitions, 2191 flow [2024-06-14 15:32:55,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:55,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:55,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:32:55,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-06-14 15:32:55,266 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:32:55,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:55,266 INFO L85 PathProgramCache]: Analyzing trace with hash 677138966, now seen corresponding path program 14 times [2024-06-14 15:32:55,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:55,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628253960] [2024-06-14 15:32:55,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:55,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:33:00,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:00,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628253960] [2024-06-14 15:33:00,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628253960] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:00,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:00,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:33:00,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526465949] [2024-06-14 15:33:00,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:00,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:33:00,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:00,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:33:00,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:33:01,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:33:01,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 249 transitions, 2191 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:01,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:01,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:33:01,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:01,514 INFO L124 PetriNetUnfolderBase]: 689/1264 cut-off events. [2024-06-14 15:33:01,515 INFO L125 PetriNetUnfolderBase]: For 114463/114463 co-relation queries the response was YES. [2024-06-14 15:33:01,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6662 conditions, 1264 events. 689/1264 cut-off events. For 114463/114463 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 6962 event pairs, 116 based on Foata normal form. 2/1265 useless extension candidates. Maximal degree in co-relation 6500. Up to 1008 conditions per place. [2024-06-14 15:33:01,529 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 207 selfloop transitions, 61 changer transitions 0/270 dead transitions. [2024-06-14 15:33:01,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 270 transitions, 2783 flow [2024-06-14 15:33:01,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:33:01,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:33:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2024-06-14 15:33:01,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3385416666666667 [2024-06-14 15:33:01,530 INFO L175 Difference]: Start difference. First operand has 326 places, 249 transitions, 2191 flow. Second operand 12 states and 130 transitions. [2024-06-14 15:33:01,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 270 transitions, 2783 flow [2024-06-14 15:33:01,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 270 transitions, 2598 flow, removed 52 selfloop flow, removed 8 redundant places. [2024-06-14 15:33:01,997 INFO L231 Difference]: Finished difference. Result has 330 places, 249 transitions, 2132 flow [2024-06-14 15:33:01,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2006, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2132, PETRI_PLACES=330, PETRI_TRANSITIONS=249} [2024-06-14 15:33:01,998 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 299 predicate places. [2024-06-14 15:33:01,998 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 249 transitions, 2132 flow [2024-06-14 15:33:01,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:01,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:01,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:33:01,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-06-14 15:33:01,998 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:33:01,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:01,998 INFO L85 PathProgramCache]: Analyzing trace with hash 483414882, now seen corresponding path program 2 times [2024-06-14 15:33:01,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:01,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192321271] [2024-06-14 15:33:01,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:01,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:33:07,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:07,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192321271] [2024-06-14 15:33:07,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192321271] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:07,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:07,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:33:07,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940008957] [2024-06-14 15:33:07,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:07,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:33:07,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:07,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:33:07,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:33:07,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:33:07,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 249 transitions, 2132 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:07,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:07,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:33:07,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:08,421 INFO L124 PetriNetUnfolderBase]: 705/1300 cut-off events. [2024-06-14 15:33:08,421 INFO L125 PetriNetUnfolderBase]: For 175765/175765 co-relation queries the response was YES. [2024-06-14 15:33:08,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6675 conditions, 1300 events. 705/1300 cut-off events. For 175765/175765 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 7186 event pairs, 124 based on Foata normal form. 10/1309 useless extension candidates. Maximal degree in co-relation 6511. Up to 1022 conditions per place. [2024-06-14 15:33:08,435 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 201 selfloop transitions, 59 changer transitions 12/274 dead transitions. [2024-06-14 15:33:08,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 274 transitions, 2766 flow [2024-06-14 15:33:08,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:33:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:33:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions. [2024-06-14 15:33:08,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:33:08,437 INFO L175 Difference]: Start difference. First operand has 330 places, 249 transitions, 2132 flow. Second operand 12 states and 132 transitions. [2024-06-14 15:33:08,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 274 transitions, 2766 flow [2024-06-14 15:33:08,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 274 transitions, 2626 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-14 15:33:08,887 INFO L231 Difference]: Finished difference. Result has 331 places, 242 transitions, 2062 flow [2024-06-14 15:33:08,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1992, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2062, PETRI_PLACES=331, PETRI_TRANSITIONS=242} [2024-06-14 15:33:08,887 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 300 predicate places. [2024-06-14 15:33:08,887 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 242 transitions, 2062 flow [2024-06-14 15:33:08,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:08,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:08,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:33:08,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-06-14 15:33:08,887 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:33:08,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:08,888 INFO L85 PathProgramCache]: Analyzing trace with hash 684772902, now seen corresponding path program 3 times [2024-06-14 15:33:08,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:08,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356634184] [2024-06-14 15:33:08,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:08,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:14,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:33:14,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:14,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356634184] [2024-06-14 15:33:14,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356634184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:14,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:14,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:33:14,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148542708] [2024-06-14 15:33:14,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:14,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:33:14,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:14,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:33:14,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:33:15,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:33:15,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 242 transitions, 2062 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:15,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:15,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:33:15,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:15,614 INFO L124 PetriNetUnfolderBase]: 692/1297 cut-off events. [2024-06-14 15:33:15,614 INFO L125 PetriNetUnfolderBase]: For 209888/209888 co-relation queries the response was YES. [2024-06-14 15:33:15,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7342 conditions, 1297 events. 692/1297 cut-off events. For 209888/209888 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 7215 event pairs, 156 based on Foata normal form. 8/1304 useless extension candidates. Maximal degree in co-relation 7177. Up to 1170 conditions per place. [2024-06-14 15:33:15,629 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 237 selfloop transitions, 17 changer transitions 8/264 dead transitions. [2024-06-14 15:33:15,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 264 transitions, 2914 flow [2024-06-14 15:33:15,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:33:15,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:33:15,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2024-06-14 15:33:15,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3177083333333333 [2024-06-14 15:33:15,630 INFO L175 Difference]: Start difference. First operand has 331 places, 242 transitions, 2062 flow. Second operand 12 states and 122 transitions. [2024-06-14 15:33:15,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 264 transitions, 2914 flow [2024-06-14 15:33:16,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 264 transitions, 2782 flow, removed 4 selfloop flow, removed 14 redundant places. [2024-06-14 15:33:16,260 INFO L231 Difference]: Finished difference. Result has 329 places, 239 transitions, 1951 flow [2024-06-14 15:33:16,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1934, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1951, PETRI_PLACES=329, PETRI_TRANSITIONS=239} [2024-06-14 15:33:16,260 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 298 predicate places. [2024-06-14 15:33:16,261 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 239 transitions, 1951 flow [2024-06-14 15:33:16,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:16,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:16,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:33:16,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-06-14 15:33:16,261 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:33:16,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:16,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1823799202, now seen corresponding path program 15 times [2024-06-14 15:33:16,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:16,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508047427] [2024-06-14 15:33:16,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:16,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:33:21,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:21,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508047427] [2024-06-14 15:33:21,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508047427] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:21,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:21,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:33:21,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705841377] [2024-06-14 15:33:21,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:21,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:33:21,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:21,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:33:21,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:33:22,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:33:22,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 239 transitions, 1951 flow. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:22,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:22,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:33:22,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:22,548 INFO L124 PetriNetUnfolderBase]: 677/1264 cut-off events. [2024-06-14 15:33:22,548 INFO L125 PetriNetUnfolderBase]: For 162043/162043 co-relation queries the response was YES. [2024-06-14 15:33:22,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7204 conditions, 1264 events. 677/1264 cut-off events. For 162043/162043 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 6977 event pairs, 145 based on Foata normal form. 2/1265 useless extension candidates. Maximal degree in co-relation 7040. Up to 919 conditions per place. [2024-06-14 15:33:22,561 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 203 selfloop transitions, 56 changer transitions 0/261 dead transitions. [2024-06-14 15:33:22,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 261 transitions, 2581 flow [2024-06-14 15:33:22,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:33:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:33:22,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 129 transitions. [2024-06-14 15:33:22,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3359375 [2024-06-14 15:33:22,563 INFO L175 Difference]: Start difference. First operand has 329 places, 239 transitions, 1951 flow. Second operand 12 states and 129 transitions. [2024-06-14 15:33:22,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 261 transitions, 2581 flow Killed by 15