./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 76401ed0 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/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-76401ed-m [2024-06-20 19:10:33,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 19:10:33,130 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 19:10:33,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 19:10:33,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 19:10:33,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 19:10:33,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 19:10:33,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 19:10:33,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 19:10:33,161 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 19:10:33,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 19:10:33,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 19:10:33,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 19:10:33,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 19:10:33,163 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 19:10:33,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 19:10:33,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 19:10:33,164 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 19:10:33,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 19:10:33,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 19:10:33,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 19:10:33,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 19:10:33,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 19:10:33,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 19:10:33,165 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 19:10:33,165 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 19:10:33,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 19:10:33,166 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 19:10:33,166 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 19:10:33,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 19:10:33,167 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 19:10:33,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 19:10:33,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:10:33,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 19:10:33,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 19:10:33,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 19:10:33,168 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 19:10:33,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 19:10:33,169 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 19:10:33,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 19:10:33,169 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 19:10:33,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 19:10:33,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 19:10:33,170 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-20 19:10:33,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 19:10:33,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 19:10:33,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 19:10:33,426 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 19:10:33,426 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 19:10:33,427 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-20 19:10:34,483 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 19:10:34,728 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 19:10:34,728 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-20 19:10:34,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8451ffb3/3000788149bf4e7baa1cb2de2eb9a274/FLAG0ce7b86df [2024-06-20 19:10:34,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8451ffb3/3000788149bf4e7baa1cb2de2eb9a274 [2024-06-20 19:10:34,757 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 19:10:34,757 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 19:10:34,758 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-20 19:10:34,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 19:10:34,866 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 19:10:34,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 19:10:34,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 19:10:34,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 19:10:34,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:10:34" (1/2) ... [2024-06-20 19:10:34,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41423e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:10:34, skipping insertion in model container [2024-06-20 19:10:34,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:10:34" (1/2) ... [2024-06-20 19:10:34,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2877a2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:10:34, skipping insertion in model container [2024-06-20 19:10:34,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:10:34" (2/2) ... [2024-06-20 19:10:34,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41423e9a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:10:34, skipping insertion in model container [2024-06-20 19:10:34,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:10:34" (2/2) ... [2024-06-20 19:10:34,874 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 19:10:34,921 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 19:10:34,922 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-20 19:10:34,925 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-20 19:10:34,925 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 19:10:34,925 INFO L106 edCorrectnessWitness]: ghost_update [L803-L803] multithreaded = 1; [2024-06-20 19:10:34,962 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 19:10:35,183 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:10:35,191 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-20 19:10:35,498 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:10:35,531 INFO L206 MainTranslator]: Completed translation [2024-06-20 19:10:35,531 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:10:35 WrapperNode [2024-06-20 19:10:35,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 19:10:35,532 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 19:10:35,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 19:10:35,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 19:10:35,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:10:35" (1/1) ... [2024-06-20 19:10:35,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:10:35" (1/1) ... [2024-06-20 19:10:35,625 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 139 [2024-06-20 19:10:35,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 19:10:35,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 19:10:35,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 19:10:35,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 19:10:35,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:10:35" (1/1) ... [2024-06-20 19:10:35,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:10:35" (1/1) ... [2024-06-20 19:10:35,644 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:10:35" (1/1) ... [2024-06-20 19:10:35,670 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-20 19:10:35,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:10:35" (1/1) ... [2024-06-20 19:10:35,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:10:35" (1/1) ... [2024-06-20 19:10:35,693 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:10:35" (1/1) ... [2024-06-20 19:10:35,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:10:35" (1/1) ... [2024-06-20 19:10:35,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:10:35" (1/1) ... [2024-06-20 19:10:35,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:10:35" (1/1) ... [2024-06-20 19:10:35,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 19:10:35,715 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 19:10:35,715 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 19:10:35,715 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 19:10:35,717 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:10:35" (1/1) ... [2024-06-20 19:10:35,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:10:35,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 19:10:35,746 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-20 19:10:35,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-20 19:10:35,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-20 19:10:35,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 19:10:35,786 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-20 19:10:35,786 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-20 19:10:35,788 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-20 19:10:35,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-20 19:10:35,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 19:10:35,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-20 19:10:35,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 19:10:35,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 19:10:35,789 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-20 19:10:35,891 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 19:10:35,893 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 19:10:36,585 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 19:10:36,586 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 19:10:36,748 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 19:10:36,749 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-20 19:10:36,749 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:10:36 BoogieIcfgContainer [2024-06-20 19:10:36,749 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 19:10:36,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 19:10:36,752 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 19:10:36,754 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 19:10:36,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:10:34" (1/4) ... [2024-06-20 19:10:36,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766c50c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:10:36, skipping insertion in model container [2024-06-20 19:10:36,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:10:34" (2/4) ... [2024-06-20 19:10:36,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766c50c8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:10:36, skipping insertion in model container [2024-06-20 19:10:36,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:10:35" (3/4) ... [2024-06-20 19:10:36,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766c50c8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:10:36, skipping insertion in model container [2024-06-20 19:10:36,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:10:36" (4/4) ... [2024-06-20 19:10:36,760 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-20 19:10:36,773 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 19:10:36,774 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-20 19:10:36,774 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 19:10:36,840 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-20 19:10:36,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 70 flow [2024-06-20 19:10:36,911 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-06-20 19:10:36,913 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:10:36,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-20 19:10:36,915 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 70 flow [2024-06-20 19:10:36,918 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 52 flow [2024-06-20 19:10:36,929 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 19:10:36,935 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;@672aab63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 19:10:36,936 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-20 19:10:36,941 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 19:10:36,941 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-20 19:10:36,942 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:10:36,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:36,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 19:10:36,943 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:10:36,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:36,948 INFO L85 PathProgramCache]: Analyzing trace with hash 330507394, now seen corresponding path program 1 times [2024-06-20 19:10:36,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:36,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311755210] [2024-06-20 19:10:36,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:36,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:10:40,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:40,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311755210] [2024-06-20 19:10:40,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311755210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:40,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:40,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 19:10:40,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689631294] [2024-06-20 19:10:40,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:40,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 19:10:40,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:40,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 19:10:40,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 19:10:40,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-20 19:10:40,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:40,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:40,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-20 19:10:40,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:40,603 INFO L124 PetriNetUnfolderBase]: 162/320 cut-off events. [2024-06-20 19:10:40,603 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-20 19:10:40,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 320 events. 162/320 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1209 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-20 19:10:40,607 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 21 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-20 19:10:40,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 115 flow [2024-06-20 19:10:40,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 19:10:40,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 19:10:40,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2024-06-20 19:10:40,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5698924731182796 [2024-06-20 19:10:40,617 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 3 states and 53 transitions. [2024-06-20 19:10:40,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 115 flow [2024-06-20 19:10:40,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-20 19:10:40,621 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 71 flow [2024-06-20 19:10:40,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2024-06-20 19:10:40,624 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-06-20 19:10:40,625 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 71 flow [2024-06-20 19:10:40,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:40,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:40,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:40,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 19:10:40,625 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:10:40,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:40,626 INFO L85 PathProgramCache]: Analyzing trace with hash -209632469, now seen corresponding path program 1 times [2024-06-20 19:10:40,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:40,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221047095] [2024-06-20 19:10:40,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:40,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:43,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:10:43,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:43,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221047095] [2024-06-20 19:10:43,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221047095] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:43,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:43,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 19:10:43,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704912656] [2024-06-20 19:10:43,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:43,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 19:10:43,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:43,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 19:10:43,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-20 19:10:43,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:10:43,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:43,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:43,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:10:43,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:43,320 INFO L124 PetriNetUnfolderBase]: 186/348 cut-off events. [2024-06-20 19:10:43,321 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-06-20 19:10:43,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 348 events. 186/348 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1262 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-20 19:10:43,323 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 26 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-20 19:10:43,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 159 flow [2024-06-20 19:10:43,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 19:10:43,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 19:10:43,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-06-20 19:10:43,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5241935483870968 [2024-06-20 19:10:43,325 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 71 flow. Second operand 4 states and 65 transitions. [2024-06-20 19:10:43,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 159 flow [2024-06-20 19:10:43,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 19:10:43,326 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow [2024-06-20 19:10:43,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2024-06-20 19:10:43,327 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2024-06-20 19:10:43,327 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow [2024-06-20 19:10:43,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:43,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:43,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:43,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 19:10:43,328 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:10:43,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:43,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2091328885, now seen corresponding path program 1 times [2024-06-20 19:10:43,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:43,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057167958] [2024-06-20 19:10:43,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:43,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:45,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:10:45,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:45,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057167958] [2024-06-20 19:10:45,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057167958] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:45,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:45,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 19:10:45,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673589363] [2024-06-20 19:10:45,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:45,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 19:10:45,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:45,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 19:10:45,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-20 19:10:45,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:10:45,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:45,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:45,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:10:45,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:45,813 INFO L124 PetriNetUnfolderBase]: 180/340 cut-off events. [2024-06-20 19:10:45,814 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2024-06-20 19:10:45,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 340 events. 180/340 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1230 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-20 19:10:45,818 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 31 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2024-06-20 19:10:45,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 211 flow [2024-06-20 19:10:45,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:10:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:10:45,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-06-20 19:10:45,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2024-06-20 19:10:45,823 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 95 flow. Second operand 5 states and 80 transitions. [2024-06-20 19:10:45,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 211 flow [2024-06-20 19:10:45,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 202 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-20 19:10:45,826 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 119 flow [2024-06-20 19:10:45,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-06-20 19:10:45,827 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2024-06-20 19:10:45,827 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 119 flow [2024-06-20 19:10:45,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:45,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:45,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:45,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 19:10:45,829 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:10:45,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:45,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1135293634, now seen corresponding path program 1 times [2024-06-20 19:10:45,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:45,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909931338] [2024-06-20 19:10:45,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:45,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:10:48,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:48,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909931338] [2024-06-20 19:10:48,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909931338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:48,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:48,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:10:48,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986133570] [2024-06-20 19:10:48,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:48,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:10:48,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:48,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:10:48,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:10:48,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:10:48,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 119 flow. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:48,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:48,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:10:48,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:49,032 INFO L124 PetriNetUnfolderBase]: 176/330 cut-off events. [2024-06-20 19:10:49,032 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2024-06-20 19:10:49,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 900 conditions, 330 events. 176/330 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1159 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-20 19:10:49,033 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 31 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2024-06-20 19:10:49,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 225 flow [2024-06-20 19:10:49,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:10:49,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:10:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2024-06-20 19:10:49,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.478494623655914 [2024-06-20 19:10:49,035 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 119 flow. Second operand 6 states and 89 transitions. [2024-06-20 19:10:49,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 225 flow [2024-06-20 19:10:49,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 210 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-20 19:10:49,036 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 116 flow [2024-06-20 19:10:49,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2024-06-20 19:10:49,037 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-20 19:10:49,037 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 116 flow [2024-06-20 19:10:49,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:49,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:49,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:49,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 19:10:49,038 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-20 19:10:49,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:49,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1523058016, now seen corresponding path program 1 times [2024-06-20 19:10:49,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:49,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590225725] [2024-06-20 19:10:49,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:49,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:53,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:10:53,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:53,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590225725] [2024-06-20 19:10:53,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590225725] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:53,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:53,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:10:53,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673337842] [2024-06-20 19:10:53,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:53,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:10:53,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:53,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:10:53,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:10:53,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:10:53,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:53,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:53,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:10:53,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:53,746 INFO L124 PetriNetUnfolderBase]: 147/294 cut-off events. [2024-06-20 19:10:53,746 INFO L125 PetriNetUnfolderBase]: For 377/377 co-relation queries the response was YES. [2024-06-20 19:10:53,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 294 events. 147/294 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1061 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-20 19:10:53,748 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 25 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2024-06-20 19:10:53,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 196 flow [2024-06-20 19:10:53,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:10:53,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:10:53,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2024-06-20 19:10:53,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-06-20 19:10:53,751 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 116 flow. Second operand 5 states and 63 transitions. [2024-06-20 19:10:53,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 196 flow [2024-06-20 19:10:53,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 176 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-20 19:10:53,756 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 123 flow [2024-06-20 19:10:53,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2024-06-20 19:10:53,758 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2024-06-20 19:10:53,759 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 123 flow [2024-06-20 19:10:53,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:53,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:53,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:53,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 19:10:53,763 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:10:53,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:53,764 INFO L85 PathProgramCache]: Analyzing trace with hash 29843198, now seen corresponding path program 1 times [2024-06-20 19:10:53,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:53,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467948530] [2024-06-20 19:10:53,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:53,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:58,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:10:58,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:58,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467948530] [2024-06-20 19:10:58,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467948530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:58,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:58,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:10:58,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71837754] [2024-06-20 19:10:58,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:58,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:10:58,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:58,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:10:58,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:10:58,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:10:58,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 123 flow. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:58,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:58,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:10:58,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:58,511 INFO L124 PetriNetUnfolderBase]: 172/329 cut-off events. [2024-06-20 19:10:58,511 INFO L125 PetriNetUnfolderBase]: For 581/581 co-relation queries the response was YES. [2024-06-20 19:10:58,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 329 events. 172/329 cut-off events. For 581/581 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1181 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-20 19:10:58,514 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 27 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2024-06-20 19:10:58,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 215 flow [2024-06-20 19:10:58,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:10:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:10:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2024-06-20 19:10:58,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3655913978494624 [2024-06-20 19:10:58,517 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 123 flow. Second operand 6 states and 68 transitions. [2024-06-20 19:10:58,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 215 flow [2024-06-20 19:10:58,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 204 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-20 19:10:58,519 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 145 flow [2024-06-20 19:10:58,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2024-06-20 19:10:58,522 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2024-06-20 19:10:58,522 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 145 flow [2024-06-20 19:10:58,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:58,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:58,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:58,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 19:10:58,523 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:10:58,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:58,523 INFO L85 PathProgramCache]: Analyzing trace with hash 697773711, now seen corresponding path program 1 times [2024-06-20 19:10:58,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:58,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154021442] [2024-06-20 19:10:58,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:58,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:03,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:11:03,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:03,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154021442] [2024-06-20 19:11:03,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154021442] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:03,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:03,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:11:03,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817851658] [2024-06-20 19:11:03,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:03,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:11:03,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:03,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:11:03,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:11:03,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:11:03,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 145 flow. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:03,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:03,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:11:03,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:03,488 INFO L124 PetriNetUnfolderBase]: 188/348 cut-off events. [2024-06-20 19:11:03,488 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2024-06-20 19:11:03,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 348 events. 188/348 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1221 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-20 19:11:03,490 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 31 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2024-06-20 19:11:03,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 253 flow [2024-06-20 19:11:03,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:11:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:11:03,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2024-06-20 19:11:03,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3817204301075269 [2024-06-20 19:11:03,492 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 145 flow. Second operand 6 states and 71 transitions. [2024-06-20 19:11:03,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 253 flow [2024-06-20 19:11:03,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 236 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-20 19:11:03,494 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 161 flow [2024-06-20 19:11:03,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-06-20 19:11:03,495 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2024-06-20 19:11:03,495 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 161 flow [2024-06-20 19:11:03,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:03,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:03,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:03,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 19:11:03,496 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:11:03,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:03,496 INFO L85 PathProgramCache]: Analyzing trace with hash 703487631, now seen corresponding path program 2 times [2024-06-20 19:11:03,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:03,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784783782] [2024-06-20 19:11:03,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:03,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:11:08,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:08,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784783782] [2024-06-20 19:11:08,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784783782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:08,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:08,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:11:08,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260493820] [2024-06-20 19:11:08,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:08,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:11:08,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:08,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:11:08,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:11:08,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:11:08,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 161 flow. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:08,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:08,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:11:08,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:08,722 INFO L124 PetriNetUnfolderBase]: 186/346 cut-off events. [2024-06-20 19:11:08,723 INFO L125 PetriNetUnfolderBase]: For 1247/1249 co-relation queries the response was YES. [2024-06-20 19:11:08,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 346 events. 186/346 cut-off events. For 1247/1249 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1223 event pairs, 75 based on Foata normal form. 3/349 useless extension candidates. Maximal degree in co-relation 1174. Up to 302 conditions per place. [2024-06-20 19:11:08,725 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 27 selfloop transitions, 11 changer transitions 0/42 dead transitions. [2024-06-20 19:11:08,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 263 flow [2024-06-20 19:11:08,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:11:08,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:11:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2024-06-20 19:11:08,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2024-06-20 19:11:08,729 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 161 flow. Second operand 6 states and 70 transitions. [2024-06-20 19:11:08,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 263 flow [2024-06-20 19:11:08,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 42 transitions, 246 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-20 19:11:08,732 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 187 flow [2024-06-20 19:11:08,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2024-06-20 19:11:08,734 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2024-06-20 19:11:08,734 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 187 flow [2024-06-20 19:11:08,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:08,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:08,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:08,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 19:11:08,735 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:11:08,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:08,735 INFO L85 PathProgramCache]: Analyzing trace with hash 703495567, now seen corresponding path program 1 times [2024-06-20 19:11:08,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:08,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4179469] [2024-06-20 19:11:08,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:08,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:13,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:11:13,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:13,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4179469] [2024-06-20 19:11:13,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4179469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:13,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:13,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:11:13,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638583771] [2024-06-20 19:11:13,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:13,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:11:13,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:13,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:11:13,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:11:13,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:11:13,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 187 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:13,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:13,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:11:13,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:13,769 INFO L124 PetriNetUnfolderBase]: 171/323 cut-off events. [2024-06-20 19:11:13,769 INFO L125 PetriNetUnfolderBase]: For 1225/1225 co-relation queries the response was YES. [2024-06-20 19:11:13,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 323 events. 171/323 cut-off events. For 1225/1225 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1142 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-20 19:11:13,772 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 32 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2024-06-20 19:11:13,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 297 flow [2024-06-20 19:11:13,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:11:13,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:11:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2024-06-20 19:11:13,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:11:13,773 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 187 flow. Second operand 7 states and 77 transitions. [2024-06-20 19:11:13,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 297 flow [2024-06-20 19:11:13,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 270 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-20 19:11:13,775 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 199 flow [2024-06-20 19:11:13,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=199, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-06-20 19:11:13,776 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2024-06-20 19:11:13,776 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 199 flow [2024-06-20 19:11:13,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:13,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:13,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:13,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 19:11:13,776 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:11:13,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:13,777 INFO L85 PathProgramCache]: Analyzing trace with hash 10610739, now seen corresponding path program 1 times [2024-06-20 19:11:13,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:13,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040981013] [2024-06-20 19:11:13,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:13,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:11:18,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:18,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040981013] [2024-06-20 19:11:18,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040981013] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:18,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:18,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:11:18,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43185551] [2024-06-20 19:11:18,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:18,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:11:18,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:18,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:11:18,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:11:18,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:11:18,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 199 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:18,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:18,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:11:18,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:18,857 INFO L124 PetriNetUnfolderBase]: 188/349 cut-off events. [2024-06-20 19:11:18,857 INFO L125 PetriNetUnfolderBase]: For 1837/1837 co-relation queries the response was YES. [2024-06-20 19:11:18,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 349 events. 188/349 cut-off events. For 1837/1837 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1220 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-20 19:11:18,859 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 44 selfloop transitions, 12 changer transitions 0/60 dead transitions. [2024-06-20 19:11:18,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 373 flow [2024-06-20 19:11:18,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:11:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:11:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-20 19:11:18,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-20 19:11:18,861 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 199 flow. Second operand 8 states and 96 transitions. [2024-06-20 19:11:18,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 373 flow [2024-06-20 19:11:18,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 60 transitions, 350 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-20 19:11:18,863 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 232 flow [2024-06-20 19:11:18,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=232, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-06-20 19:11:18,864 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 24 predicate places. [2024-06-20 19:11:18,864 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 232 flow [2024-06-20 19:11:18,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:18,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:18,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:18,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-20 19:11:18,865 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:11:18,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:18,865 INFO L85 PathProgramCache]: Analyzing trace with hash 156149999, now seen corresponding path program 1 times [2024-06-20 19:11:18,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:18,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865163504] [2024-06-20 19:11:18,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:18,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:11:23,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:23,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865163504] [2024-06-20 19:11:23,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865163504] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:23,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:23,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:11:23,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914938176] [2024-06-20 19:11:23,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:23,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:11:23,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:23,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:11:23,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:11:23,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:11:23,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 232 flow. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:23,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:23,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:11:23,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:23,976 INFO L124 PetriNetUnfolderBase]: 205/368 cut-off events. [2024-06-20 19:11:23,976 INFO L125 PetriNetUnfolderBase]: For 2148/2148 co-relation queries the response was YES. [2024-06-20 19:11:23,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1511 conditions, 368 events. 205/368 cut-off events. For 2148/2148 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1257 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-20 19:11:23,978 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 42 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2024-06-20 19:11:23,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 372 flow [2024-06-20 19:11:23,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:11:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:11:23,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2024-06-20 19:11:23,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34101382488479265 [2024-06-20 19:11:23,980 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 232 flow. Second operand 7 states and 74 transitions. [2024-06-20 19:11:23,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 372 flow [2024-06-20 19:11:23,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 345 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-20 19:11:23,982 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 246 flow [2024-06-20 19:11:23,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=246, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-06-20 19:11:23,983 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2024-06-20 19:11:23,984 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 246 flow [2024-06-20 19:11:23,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:23,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:23,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:23,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-20 19:11:23,984 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:11:23,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:23,985 INFO L85 PathProgramCache]: Analyzing trace with hash 156149813, now seen corresponding path program 2 times [2024-06-20 19:11:23,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:23,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616025937] [2024-06-20 19:11:23,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:23,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:11:28,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:28,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616025937] [2024-06-20 19:11:28,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616025937] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:28,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:28,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:11:28,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601432521] [2024-06-20 19:11:28,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:28,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:11:28,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:28,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:11:28,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:11:28,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:11:28,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 246 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:28,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:28,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:11:28,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:29,298 INFO L124 PetriNetUnfolderBase]: 204/374 cut-off events. [2024-06-20 19:11:29,298 INFO L125 PetriNetUnfolderBase]: For 2777/2777 co-relation queries the response was YES. [2024-06-20 19:11:29,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 374 events. 204/374 cut-off events. For 2777/2777 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1326 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-20 19:11:29,303 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 43 selfloop transitions, 17 changer transitions 0/65 dead transitions. [2024-06-20 19:11:29,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 65 transitions, 464 flow [2024-06-20 19:11:29,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:11:29,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:11:29,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-20 19:11:29,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911290322580645 [2024-06-20 19:11:29,305 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 246 flow. Second operand 8 states and 97 transitions. [2024-06-20 19:11:29,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 65 transitions, 464 flow [2024-06-20 19:11:29,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 65 transitions, 439 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-20 19:11:29,307 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 296 flow [2024-06-20 19:11:29,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=296, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2024-06-20 19:11:29,308 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 29 predicate places. [2024-06-20 19:11:29,308 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 296 flow [2024-06-20 19:11:29,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:29,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:29,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:29,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-20 19:11:29,309 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:11:29,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:29,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1385656833, now seen corresponding path program 2 times [2024-06-20 19:11:29,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:29,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46343383] [2024-06-20 19:11:29,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:29,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:11:34,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:34,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46343383] [2024-06-20 19:11:34,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46343383] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:34,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:34,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:11:34,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933587287] [2024-06-20 19:11:34,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:34,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:11:34,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:34,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:11:34,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:11:34,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:11:34,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 296 flow. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:34,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:34,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:11:34,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:34,712 INFO L124 PetriNetUnfolderBase]: 219/392 cut-off events. [2024-06-20 19:11:34,713 INFO L125 PetriNetUnfolderBase]: For 3279/3281 co-relation queries the response was YES. [2024-06-20 19:11:34,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1772 conditions, 392 events. 219/392 cut-off events. For 3279/3281 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1356 event pairs, 55 based on Foata normal form. 3/395 useless extension candidates. Maximal degree in co-relation 1745. Up to 352 conditions per place. [2024-06-20 19:11:34,716 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 41 selfloop transitions, 17 changer transitions 0/60 dead transitions. [2024-06-20 19:11:34,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 486 flow [2024-06-20 19:11:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:11:34,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:11:34,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2024-06-20 19:11:34,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35023041474654376 [2024-06-20 19:11:34,717 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 296 flow. Second operand 7 states and 76 transitions. [2024-06-20 19:11:34,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 486 flow [2024-06-20 19:11:34,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 462 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-20 19:11:34,721 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 347 flow [2024-06-20 19:11:34,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=347, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2024-06-20 19:11:34,722 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2024-06-20 19:11:34,723 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 347 flow [2024-06-20 19:11:34,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:34,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:34,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:34,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-20 19:11:34,723 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:11:34,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:34,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1385657019, now seen corresponding path program 3 times [2024-06-20 19:11:34,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:34,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43808252] [2024-06-20 19:11:34,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:34,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:39,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:11:39,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:39,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43808252] [2024-06-20 19:11:39,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43808252] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:39,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:39,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:11:39,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448663997] [2024-06-20 19:11:39,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:39,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:11:39,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:39,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:11:39,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:11:39,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:11:39,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 347 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:39,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:39,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:11:39,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:40,222 INFO L124 PetriNetUnfolderBase]: 202/373 cut-off events. [2024-06-20 19:11:40,223 INFO L125 PetriNetUnfolderBase]: For 3750/3752 co-relation queries the response was YES. [2024-06-20 19:11:40,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1741 conditions, 373 events. 202/373 cut-off events. For 3750/3752 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1336 event pairs, 50 based on Foata normal form. 4/377 useless extension candidates. Maximal degree in co-relation 1712. Up to 285 conditions per place. [2024-06-20 19:11:40,225 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 40 selfloop transitions, 21 changer transitions 0/68 dead transitions. [2024-06-20 19:11:40,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 551 flow [2024-06-20 19:11:40,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:11:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:11:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-20 19:11:40,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-20 19:11:40,227 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 347 flow. Second operand 8 states and 96 transitions. [2024-06-20 19:11:40,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 551 flow [2024-06-20 19:11:40,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 68 transitions, 525 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-20 19:11:40,233 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 392 flow [2024-06-20 19:11:40,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=392, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2024-06-20 19:11:40,234 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 37 predicate places. [2024-06-20 19:11:40,234 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 392 flow [2024-06-20 19:11:40,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:40,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:40,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:40,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-20 19:11:40,235 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:11:40,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:40,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1385419683, now seen corresponding path program 3 times [2024-06-20 19:11:40,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:40,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107460597] [2024-06-20 19:11:40,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:40,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:11:45,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:45,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107460597] [2024-06-20 19:11:45,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107460597] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:45,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:45,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:11:45,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303595141] [2024-06-20 19:11:45,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:45,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:11:45,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:45,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:11:45,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:11:45,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:11:45,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 392 flow. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:45,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:45,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:11:45,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:45,436 INFO L124 PetriNetUnfolderBase]: 213/383 cut-off events. [2024-06-20 19:11:45,437 INFO L125 PetriNetUnfolderBase]: For 4070/4072 co-relation queries the response was YES. [2024-06-20 19:11:45,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1872 conditions, 383 events. 213/383 cut-off events. For 4070/4072 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1349 event pairs, 54 based on Foata normal form. 3/386 useless extension candidates. Maximal degree in co-relation 1841. Up to 344 conditions per place. [2024-06-20 19:11:45,439 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 41 selfloop transitions, 18 changer transitions 0/61 dead transitions. [2024-06-20 19:11:45,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 61 transitions, 526 flow [2024-06-20 19:11:45,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:11:45,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:11:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2024-06-20 19:11:45,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34101382488479265 [2024-06-20 19:11:45,440 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 392 flow. Second operand 7 states and 74 transitions. [2024-06-20 19:11:45,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 61 transitions, 526 flow [2024-06-20 19:11:45,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 61 transitions, 461 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-20 19:11:45,445 INFO L231 Difference]: Finished difference. Result has 68 places, 54 transitions, 368 flow [2024-06-20 19:11:45,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=68, PETRI_TRANSITIONS=54} [2024-06-20 19:11:45,446 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2024-06-20 19:11:45,446 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 54 transitions, 368 flow [2024-06-20 19:11:45,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:45,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:45,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:45,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-20 19:11:45,446 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:11:45,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:45,447 INFO L85 PathProgramCache]: Analyzing trace with hash -45321528, now seen corresponding path program 1 times [2024-06-20 19:11:45,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:45,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649228596] [2024-06-20 19:11:45,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:45,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:11:50,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:50,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649228596] [2024-06-20 19:11:50,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649228596] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:50,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:50,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:11:50,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494389182] [2024-06-20 19:11:50,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:50,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:11:50,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:50,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:11:50,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:11:50,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:11:50,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 54 transitions, 368 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:50,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:50,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:11:50,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:50,791 INFO L124 PetriNetUnfolderBase]: 221/406 cut-off events. [2024-06-20 19:11:50,791 INFO L125 PetriNetUnfolderBase]: For 4553/4553 co-relation queries the response was YES. [2024-06-20 19:11:50,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1960 conditions, 406 events. 221/406 cut-off events. For 4553/4553 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1499 event pairs, 47 based on Foata normal form. 1/407 useless extension candidates. Maximal degree in co-relation 1928. Up to 347 conditions per place. [2024-06-20 19:11:50,794 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 55 selfloop transitions, 16 changer transitions 0/78 dead transitions. [2024-06-20 19:11:50,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 78 transitions, 624 flow [2024-06-20 19:11:50,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:11:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:11:50,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-20 19:11:50,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-20 19:11:50,798 INFO L175 Difference]: Start difference. First operand has 68 places, 54 transitions, 368 flow. Second operand 8 states and 93 transitions. [2024-06-20 19:11:50,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 78 transitions, 624 flow [2024-06-20 19:11:50,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 78 transitions, 579 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-20 19:11:50,803 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 460 flow [2024-06-20 19:11:50,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=460, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2024-06-20 19:11:50,804 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 42 predicate places. [2024-06-20 19:11:50,804 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 460 flow [2024-06-20 19:11:50,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:50,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:50,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:50,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-20 19:11:50,805 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:11:50,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:50,805 INFO L85 PathProgramCache]: Analyzing trace with hash 325269062, now seen corresponding path program 2 times [2024-06-20 19:11:50,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:50,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400367035] [2024-06-20 19:11:50,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:50,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:11:55,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:55,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400367035] [2024-06-20 19:11:55,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400367035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:55,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:55,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:11:55,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491830058] [2024-06-20 19:11:55,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:55,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:11:55,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:55,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:11:55,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:11:55,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:11:55,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 460 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:55,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:55,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:11:55,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:56,273 INFO L124 PetriNetUnfolderBase]: 220/404 cut-off events. [2024-06-20 19:11:56,273 INFO L125 PetriNetUnfolderBase]: For 5027/5027 co-relation queries the response was YES. [2024-06-20 19:11:56,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2012 conditions, 404 events. 220/404 cut-off events. For 5027/5027 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1494 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-20 19:11:56,276 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 48 selfloop transitions, 22 changer transitions 0/77 dead transitions. [2024-06-20 19:11:56,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 77 transitions, 638 flow [2024-06-20 19:11:56,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:11:56,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:11:56,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-06-20 19:11:56,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.391705069124424 [2024-06-20 19:11:56,277 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 460 flow. Second operand 7 states and 85 transitions. [2024-06-20 19:11:56,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 77 transitions, 638 flow [2024-06-20 19:11:56,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 77 transitions, 604 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-20 19:11:56,282 INFO L231 Difference]: Finished difference. Result has 75 places, 64 transitions, 484 flow [2024-06-20 19:11:56,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=484, PETRI_PLACES=75, PETRI_TRANSITIONS=64} [2024-06-20 19:11:56,283 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 45 predicate places. [2024-06-20 19:11:56,283 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 64 transitions, 484 flow [2024-06-20 19:11:56,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:56,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:56,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:56,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-20 19:11:56,284 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:11:56,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:56,284 INFO L85 PathProgramCache]: Analyzing trace with hash -328030295, now seen corresponding path program 1 times [2024-06-20 19:11:56,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:56,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34750243] [2024-06-20 19:11:56,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:56,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:12:00,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:00,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34750243] [2024-06-20 19:12:00,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34750243] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:00,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:00,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:12:00,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764903420] [2024-06-20 19:12:00,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:00,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:12:00,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:00,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:12:00,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:12:01,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:12:01,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 64 transitions, 484 flow. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:01,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:01,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:12:01,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:01,392 INFO L124 PetriNetUnfolderBase]: 238/426 cut-off events. [2024-06-20 19:12:01,392 INFO L125 PetriNetUnfolderBase]: For 5694/5694 co-relation queries the response was YES. [2024-06-20 19:12:01,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2175 conditions, 426 events. 238/426 cut-off events. For 5694/5694 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1551 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-20 19:12:01,395 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 62 selfloop transitions, 21 changer transitions 0/85 dead transitions. [2024-06-20 19:12:01,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 85 transitions, 724 flow [2024-06-20 19:12:01,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:12:01,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:12:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-20 19:12:01,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-20 19:12:01,397 INFO L175 Difference]: Start difference. First operand has 75 places, 64 transitions, 484 flow. Second operand 9 states and 98 transitions. [2024-06-20 19:12:01,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 85 transitions, 724 flow [2024-06-20 19:12:01,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 85 transitions, 672 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-20 19:12:01,402 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 502 flow [2024-06-20 19:12:01,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=502, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2024-06-20 19:12:01,403 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2024-06-20 19:12:01,403 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 502 flow [2024-06-20 19:12:01,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:01,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:01,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:12:01,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-20 19:12:01,404 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:12:01,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:01,404 INFO L85 PathProgramCache]: Analyzing trace with hash -324305428, now seen corresponding path program 1 times [2024-06-20 19:12:01,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:01,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278578590] [2024-06-20 19:12:01,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:01,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:06,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:12:06,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:06,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278578590] [2024-06-20 19:12:06,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278578590] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:06,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:06,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:12:06,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664663649] [2024-06-20 19:12:06,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:06,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:12:06,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:06,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:12:06,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:12:06,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:12:06,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 502 flow. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:06,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:06,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:12:06,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:06,996 INFO L124 PetriNetUnfolderBase]: 241/431 cut-off events. [2024-06-20 19:12:06,996 INFO L125 PetriNetUnfolderBase]: For 5708/5708 co-relation queries the response was YES. [2024-06-20 19:12:06,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2232 conditions, 431 events. 241/431 cut-off events. For 5708/5708 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1574 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-20 19:12:06,999 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 62 selfloop transitions, 14 changer transitions 0/78 dead transitions. [2024-06-20 19:12:06,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 78 transitions, 694 flow [2024-06-20 19:12:06,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:12:07,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:12:07,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-06-20 19:12:07,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33064516129032256 [2024-06-20 19:12:07,000 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 502 flow. Second operand 8 states and 82 transitions. [2024-06-20 19:12:07,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 78 transitions, 694 flow [2024-06-20 19:12:07,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 78 transitions, 642 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-20 19:12:07,006 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 501 flow [2024-06-20 19:12:07,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=501, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2024-06-20 19:12:07,006 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2024-06-20 19:12:07,007 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 501 flow [2024-06-20 19:12:07,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:07,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:07,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:12:07,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-20 19:12:07,007 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:12:07,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:07,008 INFO L85 PathProgramCache]: Analyzing trace with hash 545683925, now seen corresponding path program 2 times [2024-06-20 19:12:07,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:07,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66170341] [2024-06-20 19:12:07,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:07,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:12:12,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:12,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66170341] [2024-06-20 19:12:12,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66170341] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:12,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:12,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:12:12,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018696923] [2024-06-20 19:12:12,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:12,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:12:12,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:12,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:12:12,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:12:12,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:12:12,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 68 transitions, 501 flow. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:12,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:12,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:12:12,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:12,469 INFO L124 PetriNetUnfolderBase]: 257/457 cut-off events. [2024-06-20 19:12:12,469 INFO L125 PetriNetUnfolderBase]: For 6822/6822 co-relation queries the response was YES. [2024-06-20 19:12:12,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2419 conditions, 457 events. 257/457 cut-off events. For 6822/6822 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1684 event pairs, 45 based on Foata normal form. 2/459 useless extension candidates. Maximal degree in co-relation 2381. Up to 344 conditions per place. [2024-06-20 19:12:12,472 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 55 selfloop transitions, 33 changer transitions 0/90 dead transitions. [2024-06-20 19:12:12,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 90 transitions, 809 flow [2024-06-20 19:12:12,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:12:12,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:12:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-20 19:12:12,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35842293906810035 [2024-06-20 19:12:12,474 INFO L175 Difference]: Start difference. First operand has 79 places, 68 transitions, 501 flow. Second operand 9 states and 100 transitions. [2024-06-20 19:12:12,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 90 transitions, 809 flow [2024-06-20 19:12:12,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 90 transitions, 774 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-20 19:12:12,480 INFO L231 Difference]: Finished difference. Result has 82 places, 72 transitions, 585 flow [2024-06-20 19:12:12,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=585, PETRI_PLACES=82, PETRI_TRANSITIONS=72} [2024-06-20 19:12:12,480 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 52 predicate places. [2024-06-20 19:12:12,481 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 72 transitions, 585 flow [2024-06-20 19:12:12,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:12,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:12,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:12:12,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-20 19:12:12,481 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:12:12,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:12,482 INFO L85 PathProgramCache]: Analyzing trace with hash 545678345, now seen corresponding path program 3 times [2024-06-20 19:12:12,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:12,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685159306] [2024-06-20 19:12:12,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:12,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:12:17,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:17,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685159306] [2024-06-20 19:12:17,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685159306] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:17,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:17,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:12:17,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091087657] [2024-06-20 19:12:17,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:17,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:12:17,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:17,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:12:17,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:12:17,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:12:17,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 72 transitions, 585 flow. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:17,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:17,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:12:17,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:17,696 INFO L124 PetriNetUnfolderBase]: 258/459 cut-off events. [2024-06-20 19:12:17,697 INFO L125 PetriNetUnfolderBase]: For 7502/7502 co-relation queries the response was YES. [2024-06-20 19:12:17,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2542 conditions, 459 events. 258/459 cut-off events. For 7502/7502 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1695 event pairs, 51 based on Foata normal form. 2/461 useless extension candidates. Maximal degree in co-relation 2503. Up to 347 conditions per place. [2024-06-20 19:12:17,700 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 59 selfloop transitions, 31 changer transitions 0/92 dead transitions. [2024-06-20 19:12:17,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 92 transitions, 881 flow [2024-06-20 19:12:17,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:12:17,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:12:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-20 19:12:17,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36200716845878134 [2024-06-20 19:12:17,701 INFO L175 Difference]: Start difference. First operand has 82 places, 72 transitions, 585 flow. Second operand 9 states and 101 transitions. [2024-06-20 19:12:17,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 92 transitions, 881 flow [2024-06-20 19:12:17,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 92 transitions, 824 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-20 19:12:17,708 INFO L231 Difference]: Finished difference. Result has 86 places, 74 transitions, 621 flow [2024-06-20 19:12:17,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=621, PETRI_PLACES=86, PETRI_TRANSITIONS=74} [2024-06-20 19:12:17,708 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 56 predicate places. [2024-06-20 19:12:17,708 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 74 transitions, 621 flow [2024-06-20 19:12:17,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:17,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:17,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:12:17,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-20 19:12:17,709 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:12:17,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:17,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1741788169, now seen corresponding path program 4 times [2024-06-20 19:12:17,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:17,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777391405] [2024-06-20 19:12:17,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:17,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:12:22,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:22,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777391405] [2024-06-20 19:12:22,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777391405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:22,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:22,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:12:22,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144292775] [2024-06-20 19:12:22,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:22,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:12:22,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:22,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:12:22,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:12:22,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:12:22,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 74 transitions, 621 flow. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:22,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:22,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:12:22,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:23,149 INFO L124 PetriNetUnfolderBase]: 264/470 cut-off events. [2024-06-20 19:12:23,150 INFO L125 PetriNetUnfolderBase]: For 8283/8285 co-relation queries the response was YES. [2024-06-20 19:12:23,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2663 conditions, 470 events. 264/470 cut-off events. For 8283/8285 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1764 event pairs, 54 based on Foata normal form. 4/474 useless extension candidates. Maximal degree in co-relation 2622. Up to 317 conditions per place. [2024-06-20 19:12:23,154 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 52 selfloop transitions, 41 changer transitions 0/95 dead transitions. [2024-06-20 19:12:23,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 95 transitions, 987 flow [2024-06-20 19:12:23,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:12:23,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:12:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-20 19:12:23,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3655913978494624 [2024-06-20 19:12:23,156 INFO L175 Difference]: Start difference. First operand has 86 places, 74 transitions, 621 flow. Second operand 9 states and 102 transitions. [2024-06-20 19:12:23,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 95 transitions, 987 flow [2024-06-20 19:12:23,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 95 transitions, 929 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-20 19:12:23,164 INFO L231 Difference]: Finished difference. Result has 89 places, 78 transitions, 706 flow [2024-06-20 19:12:23,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=706, PETRI_PLACES=89, PETRI_TRANSITIONS=78} [2024-06-20 19:12:23,165 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places. [2024-06-20 19:12:23,166 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 78 transitions, 706 flow [2024-06-20 19:12:23,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:23,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:23,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:12:23,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-20 19:12:23,167 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:12:23,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:23,167 INFO L85 PathProgramCache]: Analyzing trace with hash -5687394, now seen corresponding path program 2 times [2024-06-20 19:12:23,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:23,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990699007] [2024-06-20 19:12:23,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:23,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:12:28,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:28,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990699007] [2024-06-20 19:12:28,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990699007] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:28,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:28,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:12:28,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514078266] [2024-06-20 19:12:28,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:28,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:12:28,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:28,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:12:28,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:12:28,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:12:28,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 78 transitions, 706 flow. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:28,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:28,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:12:28,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:28,673 INFO L124 PetriNetUnfolderBase]: 267/475 cut-off events. [2024-06-20 19:12:28,673 INFO L125 PetriNetUnfolderBase]: For 8999/9001 co-relation queries the response was YES. [2024-06-20 19:12:28,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2766 conditions, 475 events. 267/475 cut-off events. For 8999/9001 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1779 event pairs, 57 based on Foata normal form. 3/478 useless extension candidates. Maximal degree in co-relation 2724. Up to 416 conditions per place. [2024-06-20 19:12:28,677 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 67 selfloop transitions, 24 changer transitions 0/93 dead transitions. [2024-06-20 19:12:28,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 93 transitions, 996 flow [2024-06-20 19:12:28,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:12:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:12:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-20 19:12:28,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3467741935483871 [2024-06-20 19:12:28,678 INFO L175 Difference]: Start difference. First operand has 89 places, 78 transitions, 706 flow. Second operand 8 states and 86 transitions. [2024-06-20 19:12:28,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 93 transitions, 996 flow [2024-06-20 19:12:28,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 93 transitions, 897 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-20 19:12:28,690 INFO L231 Difference]: Finished difference. Result has 92 places, 84 transitions, 721 flow [2024-06-20 19:12:28,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=721, PETRI_PLACES=92, PETRI_TRANSITIONS=84} [2024-06-20 19:12:28,691 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 62 predicate places. [2024-06-20 19:12:28,691 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 84 transitions, 721 flow [2024-06-20 19:12:28,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:28,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:28,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:12:28,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-20 19:12:28,692 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:12:28,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:28,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1741793749, now seen corresponding path program 5 times [2024-06-20 19:12:28,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:28,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42063200] [2024-06-20 19:12:28,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:28,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:33,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:12:33,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:33,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42063200] [2024-06-20 19:12:33,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42063200] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:33,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:33,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:12:33,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877947872] [2024-06-20 19:12:33,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:33,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:12:33,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:33,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:12:33,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:12:33,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:12:33,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 84 transitions, 721 flow. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:33,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:33,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:12:33,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:34,206 INFO L124 PetriNetUnfolderBase]: 273/485 cut-off events. [2024-06-20 19:12:34,207 INFO L125 PetriNetUnfolderBase]: For 9828/9830 co-relation queries the response was YES. [2024-06-20 19:12:34,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2804 conditions, 485 events. 273/485 cut-off events. For 9828/9830 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1824 event pairs, 54 based on Foata normal form. 4/489 useless extension candidates. Maximal degree in co-relation 2760. Up to 328 conditions per place. [2024-06-20 19:12:34,210 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 60 selfloop transitions, 42 changer transitions 0/104 dead transitions. [2024-06-20 19:12:34,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 104 transitions, 1087 flow [2024-06-20 19:12:34,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:12:34,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:12:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-20 19:12:34,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3727598566308244 [2024-06-20 19:12:34,213 INFO L175 Difference]: Start difference. First operand has 92 places, 84 transitions, 721 flow. Second operand 9 states and 104 transitions. [2024-06-20 19:12:34,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 104 transitions, 1087 flow [2024-06-20 19:12:34,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 104 transitions, 1062 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-20 19:12:34,222 INFO L231 Difference]: Finished difference. Result has 98 places, 86 transitions, 807 flow [2024-06-20 19:12:34,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=807, PETRI_PLACES=98, PETRI_TRANSITIONS=86} [2024-06-20 19:12:34,223 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 68 predicate places. [2024-06-20 19:12:34,223 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 86 transitions, 807 flow [2024-06-20 19:12:34,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:34,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:34,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:12:34,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-20 19:12:34,223 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:12:34,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:34,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1664039, now seen corresponding path program 6 times [2024-06-20 19:12:34,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:34,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731424505] [2024-06-20 19:12:34,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:34,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:12:39,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:39,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731424505] [2024-06-20 19:12:39,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731424505] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:39,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:39,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:12:39,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029798098] [2024-06-20 19:12:39,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:39,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:12:39,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:39,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:12:39,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:12:39,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:12:39,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 86 transitions, 807 flow. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:39,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:39,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:12:39,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:39,797 INFO L124 PetriNetUnfolderBase]: 269/479 cut-off events. [2024-06-20 19:12:39,797 INFO L125 PetriNetUnfolderBase]: For 10238/10240 co-relation queries the response was YES. [2024-06-20 19:12:39,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2863 conditions, 479 events. 269/479 cut-off events. For 10238/10240 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1798 event pairs, 49 based on Foata normal form. 4/483 useless extension candidates. Maximal degree in co-relation 2817. Up to 325 conditions per place. [2024-06-20 19:12:39,801 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 52 selfloop transitions, 48 changer transitions 0/102 dead transitions. [2024-06-20 19:12:39,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 102 transitions, 1099 flow [2024-06-20 19:12:39,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:12:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:12:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-20 19:12:39,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35842293906810035 [2024-06-20 19:12:39,818 INFO L175 Difference]: Start difference. First operand has 98 places, 86 transitions, 807 flow. Second operand 9 states and 100 transitions. [2024-06-20 19:12:39,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 102 transitions, 1099 flow [2024-06-20 19:12:39,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 102 transitions, 1000 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-20 19:12:39,829 INFO L231 Difference]: Finished difference. Result has 101 places, 86 transitions, 809 flow [2024-06-20 19:12:39,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=809, PETRI_PLACES=101, PETRI_TRANSITIONS=86} [2024-06-20 19:12:39,830 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 71 predicate places. [2024-06-20 19:12:39,830 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 86 transitions, 809 flow [2024-06-20 19:12:39,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:39,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:39,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:12:39,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-20 19:12:39,831 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:12:39,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:39,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1664256, now seen corresponding path program 3 times [2024-06-20 19:12:39,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:39,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717462770] [2024-06-20 19:12:39,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:39,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:44,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:12:44,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:44,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717462770] [2024-06-20 19:12:44,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717462770] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:44,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:44,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:12:44,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835977783] [2024-06-20 19:12:44,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:44,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:12:44,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:44,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:12:44,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:12:44,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:12:44,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 86 transitions, 809 flow. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:44,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:44,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:12:44,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:45,217 INFO L124 PetriNetUnfolderBase]: 272/484 cut-off events. [2024-06-20 19:12:45,217 INFO L125 PetriNetUnfolderBase]: For 10711/10713 co-relation queries the response was YES. [2024-06-20 19:12:45,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2917 conditions, 484 events. 272/484 cut-off events. For 10711/10713 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1828 event pairs, 56 based on Foata normal form. 3/487 useless extension candidates. Maximal degree in co-relation 2870. Up to 424 conditions per place. [2024-06-20 19:12:45,221 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 68 selfloop transitions, 27 changer transitions 0/97 dead transitions. [2024-06-20 19:12:45,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 97 transitions, 1091 flow [2024-06-20 19:12:45,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:12:45,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:12:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2024-06-20 19:12:45,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34274193548387094 [2024-06-20 19:12:45,222 INFO L175 Difference]: Start difference. First operand has 101 places, 86 transitions, 809 flow. Second operand 8 states and 85 transitions. [2024-06-20 19:12:45,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 97 transitions, 1091 flow [2024-06-20 19:12:45,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 97 transitions, 979 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-20 19:12:45,235 INFO L231 Difference]: Finished difference. Result has 100 places, 88 transitions, 778 flow [2024-06-20 19:12:45,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=778, PETRI_PLACES=100, PETRI_TRANSITIONS=88} [2024-06-20 19:12:45,235 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 70 predicate places. [2024-06-20 19:12:45,235 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 88 transitions, 778 flow [2024-06-20 19:12:45,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:45,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:45,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:12:45,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-20 19:12:45,236 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:12:45,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:45,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1931166, now seen corresponding path program 4 times [2024-06-20 19:12:45,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:45,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126182662] [2024-06-20 19:12:45,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:45,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:50,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:12:50,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:50,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126182662] [2024-06-20 19:12:50,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126182662] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:50,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:50,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:12:50,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962270912] [2024-06-20 19:12:50,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:50,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:12:50,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:50,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:12:50,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:12:50,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:12:50,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 88 transitions, 778 flow. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:50,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:50,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:12:50,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:50,471 INFO L124 PetriNetUnfolderBase]: 270/481 cut-off events. [2024-06-20 19:12:50,472 INFO L125 PetriNetUnfolderBase]: For 11040/11042 co-relation queries the response was YES. [2024-06-20 19:12:50,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2837 conditions, 481 events. 270/481 cut-off events. For 11040/11042 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1806 event pairs, 56 based on Foata normal form. 3/484 useless extension candidates. Maximal degree in co-relation 2789. Up to 422 conditions per place. [2024-06-20 19:12:50,475 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 65 selfloop transitions, 29 changer transitions 0/96 dead transitions. [2024-06-20 19:12:50,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 96 transitions, 986 flow [2024-06-20 19:12:50,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:12:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:12:50,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2024-06-20 19:12:50,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3346774193548387 [2024-06-20 19:12:50,478 INFO L175 Difference]: Start difference. First operand has 100 places, 88 transitions, 778 flow. Second operand 8 states and 83 transitions. [2024-06-20 19:12:50,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 96 transitions, 986 flow [2024-06-20 19:12:50,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 96 transitions, 917 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-20 19:12:50,488 INFO L231 Difference]: Finished difference. Result has 103 places, 88 transitions, 772 flow [2024-06-20 19:12:50,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=772, PETRI_PLACES=103, PETRI_TRANSITIONS=88} [2024-06-20 19:12:50,488 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2024-06-20 19:12:50,488 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 88 transitions, 772 flow [2024-06-20 19:12:50,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:50,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:50,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:12:50,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-20 19:12:50,489 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:12:50,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:50,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1941086, now seen corresponding path program 1 times [2024-06-20 19:12:50,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:50,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102952180] [2024-06-20 19:12:50,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:50,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:55,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:12:55,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:55,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102952180] [2024-06-20 19:12:55,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102952180] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:55,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:55,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:12:55,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727965761] [2024-06-20 19:12:55,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:55,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:12:55,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:55,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:12:55,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:12:55,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:12:55,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 88 transitions, 772 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:55,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:55,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:12:55,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:56,176 INFO L124 PetriNetUnfolderBase]: 268/477 cut-off events. [2024-06-20 19:12:56,176 INFO L125 PetriNetUnfolderBase]: For 11489/11489 co-relation queries the response was YES. [2024-06-20 19:12:56,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2821 conditions, 477 events. 268/477 cut-off events. For 11489/11489 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1788 event pairs, 59 based on Foata normal form. 1/478 useless extension candidates. Maximal degree in co-relation 2772. Up to 453 conditions per place. [2024-06-20 19:12:56,180 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 83 selfloop transitions, 14 changer transitions 0/99 dead transitions. [2024-06-20 19:12:56,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 99 transitions, 1000 flow [2024-06-20 19:12:56,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:12:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:12:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2024-06-20 19:12:56,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3118279569892473 [2024-06-20 19:12:56,181 INFO L175 Difference]: Start difference. First operand has 103 places, 88 transitions, 772 flow. Second operand 9 states and 87 transitions. [2024-06-20 19:12:56,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 99 transitions, 1000 flow [2024-06-20 19:12:56,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 99 transitions, 949 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-20 19:12:56,192 INFO L231 Difference]: Finished difference. Result has 106 places, 90 transitions, 770 flow [2024-06-20 19:12:56,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=770, PETRI_PLACES=106, PETRI_TRANSITIONS=90} [2024-06-20 19:12:56,193 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 76 predicate places. [2024-06-20 19:12:56,193 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 90 transitions, 770 flow [2024-06-20 19:12:56,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:56,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:56,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:12:56,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-20 19:12:56,193 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:12:56,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:56,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1493347194, now seen corresponding path program 1 times [2024-06-20 19:12:56,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:56,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838868197] [2024-06-20 19:12:56,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:56,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:13:01,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:01,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838868197] [2024-06-20 19:13:01,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838868197] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:01,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:01,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:13:01,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552407969] [2024-06-20 19:13:01,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:01,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:13:01,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:01,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:13:01,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:13:01,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:13:01,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 90 transitions, 770 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:01,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:01,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:13:01,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:01,564 INFO L124 PetriNetUnfolderBase]: 256/469 cut-off events. [2024-06-20 19:13:01,564 INFO L125 PetriNetUnfolderBase]: For 13096/13098 co-relation queries the response was YES. [2024-06-20 19:13:01,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2851 conditions, 469 events. 256/469 cut-off events. For 13096/13098 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1848 event pairs, 30 based on Foata normal form. 2/468 useless extension candidates. Maximal degree in co-relation 2801. Up to 359 conditions per place. [2024-06-20 19:13:01,570 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 76 selfloop transitions, 16 changer transitions 0/106 dead transitions. [2024-06-20 19:13:01,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 106 transitions, 1008 flow [2024-06-20 19:13:01,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:13:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:13:01,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-20 19:13:01,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-20 19:13:01,572 INFO L175 Difference]: Start difference. First operand has 106 places, 90 transitions, 770 flow. Second operand 8 states and 92 transitions. [2024-06-20 19:13:01,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 106 transitions, 1008 flow [2024-06-20 19:13:01,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 106 transitions, 927 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-20 19:13:01,585 INFO L231 Difference]: Finished difference. Result has 104 places, 91 transitions, 741 flow [2024-06-20 19:13:01,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=741, PETRI_PLACES=104, PETRI_TRANSITIONS=91} [2024-06-20 19:13:01,587 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 74 predicate places. [2024-06-20 19:13:01,588 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 91 transitions, 741 flow [2024-06-20 19:13:01,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:01,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:01,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:13:01,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-20 19:13:01,588 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:13:01,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:01,589 INFO L85 PathProgramCache]: Analyzing trace with hash -862156439, now seen corresponding path program 1 times [2024-06-20 19:13:01,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:01,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177068047] [2024-06-20 19:13:01,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:01,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:13:06,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:06,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177068047] [2024-06-20 19:13:06,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177068047] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:06,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:06,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:13:06,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952634707] [2024-06-20 19:13:06,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:06,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:13:06,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:06,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:13:06,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:13:07,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:13:07,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 91 transitions, 741 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-20 19:13:07,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:07,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:13:07,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:07,356 INFO L124 PetriNetUnfolderBase]: 278/495 cut-off events. [2024-06-20 19:13:07,356 INFO L125 PetriNetUnfolderBase]: For 13402/13402 co-relation queries the response was YES. [2024-06-20 19:13:07,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2946 conditions, 495 events. 278/495 cut-off events. For 13402/13402 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1896 event pairs, 47 based on Foata normal form. 2/497 useless extension candidates. Maximal degree in co-relation 2896. Up to 415 conditions per place. [2024-06-20 19:13:07,359 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 89 selfloop transitions, 23 changer transitions 0/114 dead transitions. [2024-06-20 19:13:07,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 114 transitions, 1047 flow [2024-06-20 19:13:07,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:13:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:13:07,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-20 19:13:07,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-20 19:13:07,361 INFO L175 Difference]: Start difference. First operand has 104 places, 91 transitions, 741 flow. Second operand 10 states and 107 transitions. [2024-06-20 19:13:07,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 114 transitions, 1047 flow [2024-06-20 19:13:07,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 114 transitions, 1005 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-20 19:13:07,372 INFO L231 Difference]: Finished difference. Result has 108 places, 93 transitions, 774 flow [2024-06-20 19:13:07,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=774, PETRI_PLACES=108, PETRI_TRANSITIONS=93} [2024-06-20 19:13:07,373 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 78 predicate places. [2024-06-20 19:13:07,373 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 93 transitions, 774 flow [2024-06-20 19:13:07,373 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-20 19:13:07,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:07,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:13:07,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-20 19:13:07,374 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:13:07,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:07,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1493407768, now seen corresponding path program 1 times [2024-06-20 19:13:07,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:07,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474820133] [2024-06-20 19:13:07,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:07,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:13:12,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:12,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474820133] [2024-06-20 19:13:12,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474820133] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:12,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:12,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:13:12,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824874005] [2024-06-20 19:13:12,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:12,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:13:12,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:12,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:13:12,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:13:12,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:13:12,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 93 transitions, 774 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:12,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:12,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:13:12,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:12,992 INFO L124 PetriNetUnfolderBase]: 276/492 cut-off events. [2024-06-20 19:13:12,992 INFO L125 PetriNetUnfolderBase]: For 13672/13672 co-relation queries the response was YES. [2024-06-20 19:13:12,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2970 conditions, 492 events. 276/492 cut-off events. For 13672/13672 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1880 event pairs, 46 based on Foata normal form. 1/493 useless extension candidates. Maximal degree in co-relation 2919. Up to 409 conditions per place. [2024-06-20 19:13:12,996 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 80 selfloop transitions, 26 changer transitions 0/108 dead transitions. [2024-06-20 19:13:12,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 108 transitions, 1030 flow [2024-06-20 19:13:13,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:13:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:13:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-20 19:13:13,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:13:13,001 INFO L175 Difference]: Start difference. First operand has 108 places, 93 transitions, 774 flow. Second operand 8 states and 88 transitions. [2024-06-20 19:13:13,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 108 transitions, 1030 flow [2024-06-20 19:13:13,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 108 transitions, 963 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-20 19:13:13,015 INFO L231 Difference]: Finished difference. Result has 108 places, 93 transitions, 769 flow [2024-06-20 19:13:13,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=100, 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=769, PETRI_PLACES=108, PETRI_TRANSITIONS=93} [2024-06-20 19:13:13,016 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 78 predicate places. [2024-06-20 19:13:13,016 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 93 transitions, 769 flow [2024-06-20 19:13:13,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:13,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:13,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:13:13,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-20 19:13:13,017 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:13:13,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:13,017 INFO L85 PathProgramCache]: Analyzing trace with hash -381931660, now seen corresponding path program 2 times [2024-06-20 19:13:13,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:13,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844729478] [2024-06-20 19:13:13,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:13,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:18,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:13:18,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:18,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844729478] [2024-06-20 19:13:18,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844729478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:18,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:18,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:13:18,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620970351] [2024-06-20 19:13:18,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:18,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:13:18,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:18,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:13:18,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:13:18,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:13:18,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 93 transitions, 769 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:18,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:18,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:13:18,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:18,611 INFO L124 PetriNetUnfolderBase]: 261/481 cut-off events. [2024-06-20 19:13:18,612 INFO L125 PetriNetUnfolderBase]: For 15894/15896 co-relation queries the response was YES. [2024-06-20 19:13:18,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2989 conditions, 481 events. 261/481 cut-off events. For 15894/15896 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1920 event pairs, 44 based on Foata normal form. 2/480 useless extension candidates. Maximal degree in co-relation 2937. Up to 371 conditions per place. [2024-06-20 19:13:18,615 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 72 selfloop transitions, 23 changer transitions 0/109 dead transitions. [2024-06-20 19:13:18,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 109 transitions, 1017 flow [2024-06-20 19:13:18,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:13:18,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:13:18,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-20 19:13:18,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2024-06-20 19:13:18,616 INFO L175 Difference]: Start difference. First operand has 108 places, 93 transitions, 769 flow. Second operand 8 states and 94 transitions. [2024-06-20 19:13:18,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 109 transitions, 1017 flow [2024-06-20 19:13:18,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 109 transitions, 938 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-20 19:13:18,631 INFO L231 Difference]: Finished difference. Result has 108 places, 94 transitions, 761 flow [2024-06-20 19:13:18,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=761, PETRI_PLACES=108, PETRI_TRANSITIONS=94} [2024-06-20 19:13:18,632 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 78 predicate places. [2024-06-20 19:13:18,632 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 94 transitions, 761 flow [2024-06-20 19:13:18,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:18,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:18,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:13:18,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-20 19:13:18,633 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:13:18,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:18,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1583103045, now seen corresponding path program 2 times [2024-06-20 19:13:18,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:18,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547716529] [2024-06-20 19:13:18,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:18,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:24,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:13:24,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:24,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547716529] [2024-06-20 19:13:24,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547716529] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:24,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:24,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:13:24,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081387681] [2024-06-20 19:13:24,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:24,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:13:24,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:24,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:13:24,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:13:24,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:13:24,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 94 transitions, 761 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-20 19:13:24,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:24,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:13:24,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:24,495 INFO L124 PetriNetUnfolderBase]: 301/534 cut-off events. [2024-06-20 19:13:24,496 INFO L125 PetriNetUnfolderBase]: For 17821/17821 co-relation queries the response was YES. [2024-06-20 19:13:24,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3303 conditions, 534 events. 301/534 cut-off events. For 17821/17821 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2103 event pairs, 51 based on Foata normal form. 2/536 useless extension candidates. Maximal degree in co-relation 3250. Up to 387 conditions per place. [2024-06-20 19:13:24,499 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 82 selfloop transitions, 37 changer transitions 0/121 dead transitions. [2024-06-20 19:13:24,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 121 transitions, 1255 flow [2024-06-20 19:13:24,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:13:24,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:13:24,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-20 19:13:24,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36451612903225805 [2024-06-20 19:13:24,500 INFO L175 Difference]: Start difference. First operand has 108 places, 94 transitions, 761 flow. Second operand 10 states and 113 transitions. [2024-06-20 19:13:24,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 121 transitions, 1255 flow [2024-06-20 19:13:24,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 121 transitions, 1200 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-20 19:13:24,518 INFO L231 Difference]: Finished difference. Result has 112 places, 100 transitions, 861 flow [2024-06-20 19:13:24,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=861, PETRI_PLACES=112, PETRI_TRANSITIONS=100} [2024-06-20 19:13:24,519 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 82 predicate places. [2024-06-20 19:13:24,519 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 100 transitions, 861 flow [2024-06-20 19:13:24,519 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-20 19:13:24,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:24,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:13:24,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-20 19:13:24,519 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:13:24,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:24,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1611679774, now seen corresponding path program 1 times [2024-06-20 19:13:24,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:24,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809194008] [2024-06-20 19:13:24,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:24,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:29,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:13:29,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:29,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809194008] [2024-06-20 19:13:29,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809194008] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:29,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:29,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:13:29,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371552633] [2024-06-20 19:13:29,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:29,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:13:29,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:29,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:13:29,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:13:29,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:13:29,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 100 transitions, 861 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:29,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:29,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:13:29,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:30,185 INFO L124 PetriNetUnfolderBase]: 307/544 cut-off events. [2024-06-20 19:13:30,186 INFO L125 PetriNetUnfolderBase]: For 19045/19045 co-relation queries the response was YES. [2024-06-20 19:13:30,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3441 conditions, 544 events. 307/544 cut-off events. For 19045/19045 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2141 event pairs, 46 based on Foata normal form. 2/546 useless extension candidates. Maximal degree in co-relation 3387. Up to 393 conditions per place. [2024-06-20 19:13:30,189 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 74 selfloop transitions, 46 changer transitions 0/122 dead transitions. [2024-06-20 19:13:30,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 122 transitions, 1251 flow [2024-06-20 19:13:30,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:13:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:13:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-20 19:13:30,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:13:30,191 INFO L175 Difference]: Start difference. First operand has 112 places, 100 transitions, 861 flow. Second operand 10 states and 110 transitions. [2024-06-20 19:13:30,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 122 transitions, 1251 flow [2024-06-20 19:13:30,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 122 transitions, 1206 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-20 19:13:30,212 INFO L231 Difference]: Finished difference. Result has 117 places, 102 transitions, 941 flow [2024-06-20 19:13:30,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=941, PETRI_PLACES=117, PETRI_TRANSITIONS=102} [2024-06-20 19:13:30,213 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 87 predicate places. [2024-06-20 19:13:30,213 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 102 transitions, 941 flow [2024-06-20 19:13:30,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:30,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:30,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:13:30,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-20 19:13:30,213 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:13:30,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:30,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1611680022, now seen corresponding path program 1 times [2024-06-20 19:13:30,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:30,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150378632] [2024-06-20 19:13:30,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:30,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:13:35,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:35,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150378632] [2024-06-20 19:13:35,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150378632] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:35,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:35,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:13:35,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912819145] [2024-06-20 19:13:35,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:35,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:13:35,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:35,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:13:35,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:13:35,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:13:35,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 102 transitions, 941 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:35,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:35,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:13:35,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:35,506 INFO L124 PetriNetUnfolderBase]: 310/549 cut-off events. [2024-06-20 19:13:35,506 INFO L125 PetriNetUnfolderBase]: For 19709/19709 co-relation queries the response was YES. [2024-06-20 19:13:35,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3579 conditions, 549 events. 310/549 cut-off events. For 19709/19709 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2177 event pairs, 57 based on Foata normal form. 1/550 useless extension candidates. Maximal degree in co-relation 3523. Up to 515 conditions per place. [2024-06-20 19:13:35,509 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 97 selfloop transitions, 16 changer transitions 0/115 dead transitions. [2024-06-20 19:13:35,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 115 transitions, 1215 flow [2024-06-20 19:13:35,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:13:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:13:35,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2024-06-20 19:13:35,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-20 19:13:35,511 INFO L175 Difference]: Start difference. First operand has 117 places, 102 transitions, 941 flow. Second operand 9 states and 90 transitions. [2024-06-20 19:13:35,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 115 transitions, 1215 flow [2024-06-20 19:13:35,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 115 transitions, 1115 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-20 19:13:35,534 INFO L231 Difference]: Finished difference. Result has 119 places, 104 transitions, 902 flow [2024-06-20 19:13:35,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=902, PETRI_PLACES=119, PETRI_TRANSITIONS=104} [2024-06-20 19:13:35,534 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 89 predicate places. [2024-06-20 19:13:35,535 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 104 transitions, 902 flow [2024-06-20 19:13:35,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:35,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:35,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:13:35,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-20 19:13:35,535 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:13:35,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:35,536 INFO L85 PathProgramCache]: Analyzing trace with hash -263843980, now seen corresponding path program 3 times [2024-06-20 19:13:35,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:35,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321373952] [2024-06-20 19:13:35,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:35,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:40,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:13:40,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:40,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321373952] [2024-06-20 19:13:40,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321373952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:40,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:40,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:13:40,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577534225] [2024-06-20 19:13:40,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:40,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:13:40,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:40,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:13:40,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:13:40,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:13:40,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 104 transitions, 902 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:40,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:40,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:13:40,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:41,249 INFO L124 PetriNetUnfolderBase]: 285/524 cut-off events. [2024-06-20 19:13:41,249 INFO L125 PetriNetUnfolderBase]: For 21633/21637 co-relation queries the response was YES. [2024-06-20 19:13:41,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3463 conditions, 524 events. 285/524 cut-off events. For 21633/21637 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2186 event pairs, 43 based on Foata normal form. 2/520 useless extension candidates. Maximal degree in co-relation 3406. Up to 409 conditions per place. [2024-06-20 19:13:41,253 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 81 selfloop transitions, 27 changer transitions 0/122 dead transitions. [2024-06-20 19:13:41,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 122 transitions, 1184 flow [2024-06-20 19:13:41,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:13:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:13:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-20 19:13:41,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2024-06-20 19:13:41,254 INFO L175 Difference]: Start difference. First operand has 119 places, 104 transitions, 902 flow. Second operand 9 states and 105 transitions. [2024-06-20 19:13:41,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 122 transitions, 1184 flow [2024-06-20 19:13:41,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 122 transitions, 1139 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-20 19:13:41,277 INFO L231 Difference]: Finished difference. Result has 121 places, 105 transitions, 935 flow [2024-06-20 19:13:41,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=935, PETRI_PLACES=121, PETRI_TRANSITIONS=105} [2024-06-20 19:13:41,277 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 91 predicate places. [2024-06-20 19:13:41,278 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 105 transitions, 935 flow [2024-06-20 19:13:41,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:41,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:41,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:13:41,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-20 19:13:41,278 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:13:41,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:41,279 INFO L85 PathProgramCache]: Analyzing trace with hash -263666040, now seen corresponding path program 2 times [2024-06-20 19:13:41,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:41,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166599140] [2024-06-20 19:13:41,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:41,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:13:46,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:46,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166599140] [2024-06-20 19:13:46,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166599140] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:46,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:46,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:13:46,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924868411] [2024-06-20 19:13:46,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:46,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:13:46,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:46,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:13:46,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:13:46,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:13:46,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 105 transitions, 935 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:46,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:46,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:13:46,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:46,772 INFO L124 PetriNetUnfolderBase]: 310/551 cut-off events. [2024-06-20 19:13:46,772 INFO L125 PetriNetUnfolderBase]: For 21180/21180 co-relation queries the response was YES. [2024-06-20 19:13:46,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3556 conditions, 551 events. 310/551 cut-off events. For 21180/21180 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2194 event pairs, 45 based on Foata normal form. 2/553 useless extension candidates. Maximal degree in co-relation 3498. Up to 403 conditions per place. [2024-06-20 19:13:46,776 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 80 selfloop transitions, 43 changer transitions 0/125 dead transitions. [2024-06-20 19:13:46,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 125 transitions, 1309 flow [2024-06-20 19:13:46,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:13:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:13:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-20 19:13:46,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3580645161290323 [2024-06-20 19:13:46,779 INFO L175 Difference]: Start difference. First operand has 121 places, 105 transitions, 935 flow. Second operand 10 states and 111 transitions. [2024-06-20 19:13:46,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 125 transitions, 1309 flow [2024-06-20 19:13:46,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 125 transitions, 1227 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-20 19:13:46,810 INFO L231 Difference]: Finished difference. Result has 124 places, 105 transitions, 944 flow [2024-06-20 19:13:46,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=944, PETRI_PLACES=124, PETRI_TRANSITIONS=105} [2024-06-20 19:13:46,810 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 94 predicate places. [2024-06-20 19:13:46,811 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 105 transitions, 944 flow [2024-06-20 19:13:46,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:46,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:46,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:13:46,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-20 19:13:46,811 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:13:46,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:46,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1839140140, now seen corresponding path program 3 times [2024-06-20 19:13:46,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:46,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747333133] [2024-06-20 19:13:46,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:46,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:13:52,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:52,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747333133] [2024-06-20 19:13:52,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747333133] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:52,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:52,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:13:52,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089523031] [2024-06-20 19:13:52,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:52,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:13:52,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:52,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:13:52,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:13:52,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:13:52,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 105 transitions, 944 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:52,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:52,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:13:52,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:52,995 INFO L124 PetriNetUnfolderBase]: 316/562 cut-off events. [2024-06-20 19:13:52,995 INFO L125 PetriNetUnfolderBase]: For 22362/22364 co-relation queries the response was YES. [2024-06-20 19:13:52,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3643 conditions, 562 events. 316/562 cut-off events. For 22362/22364 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2256 event pairs, 56 based on Foata normal form. 4/566 useless extension candidates. Maximal degree in co-relation 3584. Up to 331 conditions per place. [2024-06-20 19:13:53,000 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 70 selfloop transitions, 56 changer transitions 0/128 dead transitions. [2024-06-20 19:13:53,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 128 transitions, 1450 flow [2024-06-20 19:13:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:13:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:13:53,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-20 19:13:53,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36774193548387096 [2024-06-20 19:13:53,018 INFO L175 Difference]: Start difference. First operand has 124 places, 105 transitions, 944 flow. Second operand 10 states and 114 transitions. [2024-06-20 19:13:53,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 128 transitions, 1450 flow [2024-06-20 19:13:53,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 128 transitions, 1375 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-20 19:13:53,045 INFO L231 Difference]: Finished difference. Result has 126 places, 109 transitions, 1046 flow [2024-06-20 19:13:53,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1046, PETRI_PLACES=126, PETRI_TRANSITIONS=109} [2024-06-20 19:13:53,046 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 96 predicate places. [2024-06-20 19:13:53,046 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 109 transitions, 1046 flow [2024-06-20 19:13:53,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:53,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:53,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:13:53,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-20 19:13:53,047 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:13:53,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:53,047 INFO L85 PathProgramCache]: Analyzing trace with hash -176492412, now seen corresponding path program 4 times [2024-06-20 19:13:53,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:53,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107631217] [2024-06-20 19:13:53,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:53,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:13:58,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:58,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107631217] [2024-06-20 19:13:58,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107631217] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:58,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:58,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:13:58,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210355879] [2024-06-20 19:13:58,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:58,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:13:58,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:58,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:13:58,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:13:58,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:13:58,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 109 transitions, 1046 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:58,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:58,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:13:58,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:59,247 INFO L124 PetriNetUnfolderBase]: 282/522 cut-off events. [2024-06-20 19:13:59,247 INFO L125 PetriNetUnfolderBase]: For 22756/22762 co-relation queries the response was YES. [2024-06-20 19:13:59,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3509 conditions, 522 events. 282/522 cut-off events. For 22756/22762 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2185 event pairs, 42 based on Foata normal form. 4/521 useless extension candidates. Maximal degree in co-relation 3449. Up to 392 conditions per place. [2024-06-20 19:13:59,251 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 79 selfloop transitions, 31 changer transitions 0/124 dead transitions. [2024-06-20 19:13:59,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 124 transitions, 1308 flow [2024-06-20 19:13:59,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:13:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:13:59,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-20 19:13:59,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3727598566308244 [2024-06-20 19:13:59,253 INFO L175 Difference]: Start difference. First operand has 126 places, 109 transitions, 1046 flow. Second operand 9 states and 104 transitions. [2024-06-20 19:13:59,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 124 transitions, 1308 flow [2024-06-20 19:13:59,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 124 transitions, 1186 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-20 19:13:59,280 INFO L231 Difference]: Finished difference. Result has 128 places, 109 transitions, 990 flow [2024-06-20 19:13:59,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=990, PETRI_PLACES=128, PETRI_TRANSITIONS=109} [2024-06-20 19:13:59,280 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 98 predicate places. [2024-06-20 19:13:59,281 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 109 transitions, 990 flow [2024-06-20 19:13:59,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:13:59,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:59,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:13:59,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-20 19:13:59,281 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:13:59,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:59,282 INFO L85 PathProgramCache]: Analyzing trace with hash -176314472, now seen corresponding path program 4 times [2024-06-20 19:13:59,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:59,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636032827] [2024-06-20 19:13:59,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:59,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:04,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:14:04,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:04,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636032827] [2024-06-20 19:14:04,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636032827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:04,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:04,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:14:04,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570577922] [2024-06-20 19:14:04,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:04,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:14:04,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:04,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:14:04,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:14:04,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:14:04,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 109 transitions, 990 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:04,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:04,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:14:04,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:05,108 INFO L124 PetriNetUnfolderBase]: 329/583 cut-off events. [2024-06-20 19:14:05,109 INFO L125 PetriNetUnfolderBase]: For 24801/24803 co-relation queries the response was YES. [2024-06-20 19:14:05,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3787 conditions, 583 events. 329/583 cut-off events. For 24801/24803 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2384 event pairs, 54 based on Foata normal form. 4/587 useless extension candidates. Maximal degree in co-relation 3726. Up to 341 conditions per place. [2024-06-20 19:14:05,126 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 75 selfloop transitions, 57 changer transitions 0/134 dead transitions. [2024-06-20 19:14:05,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 134 transitions, 1590 flow [2024-06-20 19:14:05,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:14:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:14:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-20 19:14:05,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-20 19:14:05,141 INFO L175 Difference]: Start difference. First operand has 128 places, 109 transitions, 990 flow. Second operand 10 states and 118 transitions. [2024-06-20 19:14:05,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 134 transitions, 1590 flow [2024-06-20 19:14:05,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 134 transitions, 1491 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-20 19:14:05,169 INFO L231 Difference]: Finished difference. Result has 130 places, 113 transitions, 1058 flow [2024-06-20 19:14:05,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1058, PETRI_PLACES=130, PETRI_TRANSITIONS=113} [2024-06-20 19:14:05,170 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 100 predicate places. [2024-06-20 19:14:05,170 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 113 transitions, 1058 flow [2024-06-20 19:14:05,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:05,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:05,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:14:05,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-20 19:14:05,171 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:14:05,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:05,171 INFO L85 PathProgramCache]: Analyzing trace with hash -176307714, now seen corresponding path program 2 times [2024-06-20 19:14:05,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:05,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511829365] [2024-06-20 19:14:05,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:05,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:10,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:14:10,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:10,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511829365] [2024-06-20 19:14:10,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511829365] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:10,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:10,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:14:10,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405095346] [2024-06-20 19:14:10,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:10,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:14:10,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:10,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:14:10,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:14:10,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:14:10,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 113 transitions, 1058 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:10,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:10,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:14:10,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:11,044 INFO L124 PetriNetUnfolderBase]: 332/588 cut-off events. [2024-06-20 19:14:11,044 INFO L125 PetriNetUnfolderBase]: For 25297/25299 co-relation queries the response was YES. [2024-06-20 19:14:11,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3873 conditions, 588 events. 332/588 cut-off events. For 25297/25299 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2399 event pairs, 61 based on Foata normal form. 3/591 useless extension candidates. Maximal degree in co-relation 3811. Up to 512 conditions per place. [2024-06-20 19:14:11,057 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 95 selfloop transitions, 30 changer transitions 0/127 dead transitions. [2024-06-20 19:14:11,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 127 transitions, 1458 flow [2024-06-20 19:14:11,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:14:11,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:14:11,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-20 19:14:11,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-20 19:14:11,060 INFO L175 Difference]: Start difference. First operand has 130 places, 113 transitions, 1058 flow. Second operand 9 states and 96 transitions. [2024-06-20 19:14:11,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 127 transitions, 1458 flow [2024-06-20 19:14:11,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 127 transitions, 1331 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-20 19:14:11,090 INFO L231 Difference]: Finished difference. Result has 132 places, 117 transitions, 1048 flow [2024-06-20 19:14:11,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1048, PETRI_PLACES=132, PETRI_TRANSITIONS=117} [2024-06-20 19:14:11,091 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 102 predicate places. [2024-06-20 19:14:11,091 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 117 transitions, 1048 flow [2024-06-20 19:14:11,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:11,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:11,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:14:11,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-20 19:14:11,092 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:14:11,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:11,093 INFO L85 PathProgramCache]: Analyzing trace with hash 51593436, now seen corresponding path program 3 times [2024-06-20 19:14:11,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:11,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592652052] [2024-06-20 19:14:11,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:11,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:16,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:14:16,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:16,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592652052] [2024-06-20 19:14:16,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592652052] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:16,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:16,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:14:16,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103454271] [2024-06-20 19:14:16,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:16,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:14:16,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:16,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:14:16,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:14:16,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:14:16,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 117 transitions, 1048 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:16,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:16,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:14:16,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:16,883 INFO L124 PetriNetUnfolderBase]: 335/593 cut-off events. [2024-06-20 19:14:16,883 INFO L125 PetriNetUnfolderBase]: For 26436/26438 co-relation queries the response was YES. [2024-06-20 19:14:16,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3823 conditions, 593 events. 335/593 cut-off events. For 26436/26438 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2419 event pairs, 61 based on Foata normal form. 3/596 useless extension candidates. Maximal degree in co-relation 3761. Up to 516 conditions per place. [2024-06-20 19:14:16,887 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 94 selfloop transitions, 33 changer transitions 0/129 dead transitions. [2024-06-20 19:14:16,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 129 transitions, 1434 flow [2024-06-20 19:14:16,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:14:16,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:14:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2024-06-20 19:14:16,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34050179211469533 [2024-06-20 19:14:16,889 INFO L175 Difference]: Start difference. First operand has 132 places, 117 transitions, 1048 flow. Second operand 9 states and 95 transitions. [2024-06-20 19:14:16,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 129 transitions, 1434 flow [2024-06-20 19:14:16,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 129 transitions, 1387 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-20 19:14:16,940 INFO L231 Difference]: Finished difference. Result has 136 places, 119 transitions, 1100 flow [2024-06-20 19:14:16,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1100, PETRI_PLACES=136, PETRI_TRANSITIONS=119} [2024-06-20 19:14:16,945 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 106 predicate places. [2024-06-20 19:14:16,946 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 119 transitions, 1100 flow [2024-06-20 19:14:16,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:16,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:16,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:14:16,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-20 19:14:16,952 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:14:16,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:16,953 INFO L85 PathProgramCache]: Analyzing trace with hash 60164316, now seen corresponding path program 4 times [2024-06-20 19:14:16,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:16,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193389961] [2024-06-20 19:14:16,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:16,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:22,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:14:22,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:22,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193389961] [2024-06-20 19:14:22,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193389961] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:22,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:22,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:14:22,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061752664] [2024-06-20 19:14:22,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:22,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:14:22,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:22,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:14:22,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:14:22,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:14:22,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 119 transitions, 1100 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:22,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:22,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:14:22,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:22,888 INFO L124 PetriNetUnfolderBase]: 338/597 cut-off events. [2024-06-20 19:14:22,888 INFO L125 PetriNetUnfolderBase]: For 27702/27702 co-relation queries the response was YES. [2024-06-20 19:14:22,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3935 conditions, 597 events. 338/597 cut-off events. For 27702/27702 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2430 event pairs, 67 based on Foata normal form. 1/598 useless extension candidates. Maximal degree in co-relation 3871. Up to 573 conditions per place. [2024-06-20 19:14:22,892 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 114 selfloop transitions, 14 changer transitions 0/130 dead transitions. [2024-06-20 19:14:22,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 130 transitions, 1410 flow [2024-06-20 19:14:22,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:14:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:14:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2024-06-20 19:14:22,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3118279569892473 [2024-06-20 19:14:22,893 INFO L175 Difference]: Start difference. First operand has 136 places, 119 transitions, 1100 flow. Second operand 9 states and 87 transitions. [2024-06-20 19:14:22,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 130 transitions, 1410 flow [2024-06-20 19:14:22,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 130 transitions, 1318 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-20 19:14:22,939 INFO L231 Difference]: Finished difference. Result has 138 places, 121 transitions, 1077 flow [2024-06-20 19:14:22,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1077, PETRI_PLACES=138, PETRI_TRANSITIONS=121} [2024-06-20 19:14:22,940 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 108 predicate places. [2024-06-20 19:14:22,940 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 121 transitions, 1077 flow [2024-06-20 19:14:22,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:22,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:22,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:14:22,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-20 19:14:22,941 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:14:22,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:22,941 INFO L85 PathProgramCache]: Analyzing trace with hash -176307962, now seen corresponding path program 5 times [2024-06-20 19:14:22,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:22,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419007250] [2024-06-20 19:14:22,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:22,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:28,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:14:28,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:28,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419007250] [2024-06-20 19:14:28,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419007250] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:28,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:28,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:14:28,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097609592] [2024-06-20 19:14:28,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:28,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:14:28,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:28,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:14:28,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:14:28,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:14:28,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 121 transitions, 1077 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:28,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:28,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:14:28,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:28,805 INFO L124 PetriNetUnfolderBase]: 334/592 cut-off events. [2024-06-20 19:14:28,805 INFO L125 PetriNetUnfolderBase]: For 28063/28065 co-relation queries the response was YES. [2024-06-20 19:14:28,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3803 conditions, 592 events. 334/592 cut-off events. For 28063/28065 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2426 event pairs, 53 based on Foata normal form. 4/596 useless extension candidates. Maximal degree in co-relation 3738. Up to 353 conditions per place. [2024-06-20 19:14:28,809 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 81 selfloop transitions, 58 changer transitions 0/141 dead transitions. [2024-06-20 19:14:28,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 141 transitions, 1581 flow [2024-06-20 19:14:28,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:14:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:14:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-20 19:14:28,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2024-06-20 19:14:28,811 INFO L175 Difference]: Start difference. First operand has 138 places, 121 transitions, 1077 flow. Second operand 10 states and 116 transitions. [2024-06-20 19:14:28,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 141 transitions, 1581 flow [2024-06-20 19:14:28,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 141 transitions, 1522 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-20 19:14:28,847 INFO L231 Difference]: Finished difference. Result has 141 places, 121 transitions, 1139 flow [2024-06-20 19:14:28,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1139, PETRI_PLACES=141, PETRI_TRANSITIONS=121} [2024-06-20 19:14:28,847 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 111 predicate places. [2024-06-20 19:14:28,847 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 121 transitions, 1139 flow [2024-06-20 19:14:28,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:28,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:28,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:14:28,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-20 19:14:28,848 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:14:28,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:28,849 INFO L85 PathProgramCache]: Analyzing trace with hash 51593188, now seen corresponding path program 6 times [2024-06-20 19:14:28,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:28,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330855363] [2024-06-20 19:14:28,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:28,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:14:34,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:34,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330855363] [2024-06-20 19:14:34,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330855363] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:34,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:34,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:14:34,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561470990] [2024-06-20 19:14:34,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:34,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:14:34,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:34,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:14:34,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:14:34,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:14:34,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 121 transitions, 1139 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:34,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:34,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:14:34,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:34,919 INFO L124 PetriNetUnfolderBase]: 350/618 cut-off events. [2024-06-20 19:14:34,919 INFO L125 PetriNetUnfolderBase]: For 31557/31559 co-relation queries the response was YES. [2024-06-20 19:14:34,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4146 conditions, 618 events. 350/618 cut-off events. For 31557/31559 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2545 event pairs, 47 based on Foata normal form. 4/622 useless extension candidates. Maximal degree in co-relation 4080. Up to 368 conditions per place. [2024-06-20 19:14:34,923 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 77 selfloop transitions, 67 changer transitions 0/146 dead transitions. [2024-06-20 19:14:34,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 146 transitions, 1805 flow [2024-06-20 19:14:34,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:14:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:14:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-20 19:14:34,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2024-06-20 19:14:34,925 INFO L175 Difference]: Start difference. First operand has 141 places, 121 transitions, 1139 flow. Second operand 10 states and 116 transitions. [2024-06-20 19:14:34,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 146 transitions, 1805 flow [2024-06-20 19:14:34,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 146 transitions, 1676 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-20 19:14:34,973 INFO L231 Difference]: Finished difference. Result has 142 places, 125 transitions, 1209 flow [2024-06-20 19:14:34,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1209, PETRI_PLACES=142, PETRI_TRANSITIONS=125} [2024-06-20 19:14:34,976 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 112 predicate places. [2024-06-20 19:14:34,976 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 125 transitions, 1209 flow [2024-06-20 19:14:34,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:34,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:34,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:14:34,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-20 19:14:34,977 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:14:34,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:34,977 INFO L85 PathProgramCache]: Analyzing trace with hash -169821212, now seen corresponding path program 7 times [2024-06-20 19:14:34,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:34,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461158904] [2024-06-20 19:14:34,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:34,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:14:40,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:40,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461158904] [2024-06-20 19:14:40,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461158904] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:40,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:40,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:14:40,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318239853] [2024-06-20 19:14:40,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:40,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:14:40,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:40,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:14:40,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:14:40,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:14:40,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 125 transitions, 1209 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:40,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:40,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:14:40,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:41,054 INFO L124 PetriNetUnfolderBase]: 346/612 cut-off events. [2024-06-20 19:14:41,054 INFO L125 PetriNetUnfolderBase]: For 31062/31064 co-relation queries the response was YES. [2024-06-20 19:14:41,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4077 conditions, 612 events. 346/612 cut-off events. For 31062/31064 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2532 event pairs, 39 based on Foata normal form. 4/616 useless extension candidates. Maximal degree in co-relation 4010. Up to 365 conditions per place. [2024-06-20 19:14:41,068 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 66 selfloop transitions, 75 changer transitions 0/143 dead transitions. [2024-06-20 19:14:41,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 143 transitions, 1631 flow [2024-06-20 19:14:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:14:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:14:41,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-20 19:14:41,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3580645161290323 [2024-06-20 19:14:41,070 INFO L175 Difference]: Start difference. First operand has 142 places, 125 transitions, 1209 flow. Second operand 10 states and 111 transitions. [2024-06-20 19:14:41,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 143 transitions, 1631 flow [2024-06-20 19:14:41,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 143 transitions, 1467 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-20 19:14:41,115 INFO L231 Difference]: Finished difference. Result has 145 places, 125 transitions, 1200 flow [2024-06-20 19:14:41,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1200, PETRI_PLACES=145, PETRI_TRANSITIONS=125} [2024-06-20 19:14:41,129 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 115 predicate places. [2024-06-20 19:14:41,130 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 125 transitions, 1200 flow [2024-06-20 19:14:41,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:41,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:41,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:14:41,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-20 19:14:41,130 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:14:41,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:41,131 INFO L85 PathProgramCache]: Analyzing trace with hash 51586678, now seen corresponding path program 8 times [2024-06-20 19:14:41,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:41,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021528118] [2024-06-20 19:14:41,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:41,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:46,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:14:46,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:46,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021528118] [2024-06-20 19:14:46,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021528118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:46,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:46,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:14:46,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589247325] [2024-06-20 19:14:46,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:46,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:14:46,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:46,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:14:46,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:14:46,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:14:46,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 125 transitions, 1200 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:46,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:46,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:14:46,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:47,240 INFO L124 PetriNetUnfolderBase]: 342/606 cut-off events. [2024-06-20 19:14:47,240 INFO L125 PetriNetUnfolderBase]: For 30010/30012 co-relation queries the response was YES. [2024-06-20 19:14:47,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3986 conditions, 606 events. 342/606 cut-off events. For 30010/30012 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2496 event pairs, 46 based on Foata normal form. 4/610 useless extension candidates. Maximal degree in co-relation 3918. Up to 362 conditions per place. [2024-06-20 19:14:47,245 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 73 selfloop transitions, 68 changer transitions 0/143 dead transitions. [2024-06-20 19:14:47,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 143 transitions, 1624 flow [2024-06-20 19:14:47,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:14:47,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:14:47,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-20 19:14:47,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36129032258064514 [2024-06-20 19:14:47,247 INFO L175 Difference]: Start difference. First operand has 145 places, 125 transitions, 1200 flow. Second operand 10 states and 112 transitions. [2024-06-20 19:14:47,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 143 transitions, 1624 flow [2024-06-20 19:14:47,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 143 transitions, 1453 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-20 19:14:47,292 INFO L231 Difference]: Finished difference. Result has 146 places, 125 transitions, 1170 flow [2024-06-20 19:14:47,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1170, PETRI_PLACES=146, PETRI_TRANSITIONS=125} [2024-06-20 19:14:47,293 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 116 predicate places. [2024-06-20 19:14:47,293 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 125 transitions, 1170 flow [2024-06-20 19:14:47,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:47,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:47,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:14:47,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-20 19:14:47,294 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:14:47,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:47,294 INFO L85 PathProgramCache]: Analyzing trace with hash 59867646, now seen corresponding path program 5 times [2024-06-20 19:14:47,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:47,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281324998] [2024-06-20 19:14:47,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:47,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:52,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:14:52,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:52,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281324998] [2024-06-20 19:14:52,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281324998] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:52,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:52,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:14:52,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682892590] [2024-06-20 19:14:52,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:52,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:14:52,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:52,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:14:52,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:14:52,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:14:52,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 125 transitions, 1170 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:52,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:52,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:14:52,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:53,176 INFO L124 PetriNetUnfolderBase]: 340/603 cut-off events. [2024-06-20 19:14:53,177 INFO L125 PetriNetUnfolderBase]: For 29212/29214 co-relation queries the response was YES. [2024-06-20 19:14:53,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3908 conditions, 603 events. 340/603 cut-off events. For 29212/29214 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2481 event pairs, 61 based on Foata normal form. 3/606 useless extension candidates. Maximal degree in co-relation 3839. Up to 526 conditions per place. [2024-06-20 19:14:53,182 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 95 selfloop transitions, 37 changer transitions 0/134 dead transitions. [2024-06-20 19:14:53,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 134 transitions, 1456 flow [2024-06-20 19:14:53,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:14:53,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:14:53,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2024-06-20 19:14:53,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-20 19:14:53,183 INFO L175 Difference]: Start difference. First operand has 146 places, 125 transitions, 1170 flow. Second operand 9 states and 93 transitions. [2024-06-20 19:14:53,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 134 transitions, 1456 flow [2024-06-20 19:14:53,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 134 transitions, 1281 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-20 19:14:53,236 INFO L231 Difference]: Finished difference. Result has 145 places, 125 transitions, 1074 flow [2024-06-20 19:14:53,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1074, PETRI_PLACES=145, PETRI_TRANSITIONS=125} [2024-06-20 19:14:53,237 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 115 predicate places. [2024-06-20 19:14:53,237 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 125 transitions, 1074 flow [2024-06-20 19:14:53,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:53,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:53,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:14:53,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-20 19:14:53,238 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:14:53,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:53,238 INFO L85 PathProgramCache]: Analyzing trace with hash 60175228, now seen corresponding path program 1 times [2024-06-20 19:14:53,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:53,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367224771] [2024-06-20 19:14:53,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:53,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:14:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:14:59,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:14:59,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367224771] [2024-06-20 19:14:59,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367224771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:14:59,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:14:59,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:14:59,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147468575] [2024-06-20 19:14:59,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:14:59,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:14:59,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:14:59,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:14:59,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:14:59,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:14:59,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 125 transitions, 1074 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:59,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:14:59,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:14:59,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:14:59,676 INFO L124 PetriNetUnfolderBase]: 337/597 cut-off events. [2024-06-20 19:14:59,676 INFO L125 PetriNetUnfolderBase]: For 29100/29100 co-relation queries the response was YES. [2024-06-20 19:14:59,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3696 conditions, 597 events. 337/597 cut-off events. For 29100/29100 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2434 event pairs, 64 based on Foata normal form. 2/599 useless extension candidates. Maximal degree in co-relation 3626. Up to 567 conditions per place. [2024-06-20 19:14:59,680 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 119 selfloop transitions, 15 changer transitions 0/136 dead transitions. [2024-06-20 19:14:59,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 136 transitions, 1368 flow [2024-06-20 19:14:59,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:14:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:14:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2024-06-20 19:14:59,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3032258064516129 [2024-06-20 19:14:59,682 INFO L175 Difference]: Start difference. First operand has 145 places, 125 transitions, 1074 flow. Second operand 10 states and 94 transitions. [2024-06-20 19:14:59,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 136 transitions, 1368 flow [2024-06-20 19:14:59,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 136 transitions, 1279 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-20 19:14:59,731 INFO L231 Difference]: Finished difference. Result has 147 places, 125 transitions, 1019 flow [2024-06-20 19:14:59,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1019, PETRI_PLACES=147, PETRI_TRANSITIONS=125} [2024-06-20 19:14:59,731 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 117 predicate places. [2024-06-20 19:14:59,731 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 125 transitions, 1019 flow [2024-06-20 19:14:59,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:14:59,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:14:59,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:14:59,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-20 19:14:59,732 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:14:59,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:14:59,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1043147916, now seen corresponding path program 1 times [2024-06-20 19:14:59,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:14:59,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538712709] [2024-06-20 19:14:59,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:14:59,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:14:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:04,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:15:04,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:04,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538712709] [2024-06-20 19:15:04,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538712709] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:04,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:04,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:15:04,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040261718] [2024-06-20 19:15:04,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:04,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:15:04,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:04,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:15:04,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:15:05,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:15:05,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 125 transitions, 1019 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:05,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:05,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:15:05,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:05,505 INFO L124 PetriNetUnfolderBase]: 341/605 cut-off events. [2024-06-20 19:15:05,506 INFO L125 PetriNetUnfolderBase]: For 30244/30244 co-relation queries the response was YES. [2024-06-20 19:15:05,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3706 conditions, 605 events. 341/605 cut-off events. For 30244/30244 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2492 event pairs, 38 based on Foata normal form. 2/607 useless extension candidates. Maximal degree in co-relation 3635. Up to 520 conditions per place. [2024-06-20 19:15:05,510 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 124 selfloop transitions, 17 changer transitions 0/143 dead transitions. [2024-06-20 19:15:05,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 143 transitions, 1357 flow [2024-06-20 19:15:05,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:15:05,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:15:05,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2024-06-20 19:15:05,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-20 19:15:05,511 INFO L175 Difference]: Start difference. First operand has 147 places, 125 transitions, 1019 flow. Second operand 9 states and 93 transitions. [2024-06-20 19:15:05,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 143 transitions, 1357 flow [2024-06-20 19:15:05,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 143 transitions, 1319 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-20 19:15:05,557 INFO L231 Difference]: Finished difference. Result has 148 places, 126 transitions, 1033 flow [2024-06-20 19:15:05,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1033, PETRI_PLACES=148, PETRI_TRANSITIONS=126} [2024-06-20 19:15:05,557 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 118 predicate places. [2024-06-20 19:15:05,557 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 126 transitions, 1033 flow [2024-06-20 19:15:05,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:05,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:05,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:15:05,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-20 19:15:05,558 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:15:05,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:05,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1128138756, now seen corresponding path program 2 times [2024-06-20 19:15:05,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:05,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168538251] [2024-06-20 19:15:05,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:05,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:15:11,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:11,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168538251] [2024-06-20 19:15:11,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168538251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:11,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:11,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:15:11,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366376716] [2024-06-20 19:15:11,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:11,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:15:11,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:11,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:15:11,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:15:11,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:15:11,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 126 transitions, 1033 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:11,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:11,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:15:11,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:11,561 INFO L124 PetriNetUnfolderBase]: 352/626 cut-off events. [2024-06-20 19:15:11,562 INFO L125 PetriNetUnfolderBase]: For 33901/33901 co-relation queries the response was YES. [2024-06-20 19:15:11,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3939 conditions, 626 events. 352/626 cut-off events. For 33901/33901 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2630 event pairs, 54 based on Foata normal form. 2/628 useless extension candidates. Maximal degree in co-relation 3867. Up to 512 conditions per place. [2024-06-20 19:15:11,566 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 119 selfloop transitions, 25 changer transitions 0/146 dead transitions. [2024-06-20 19:15:11,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 146 transitions, 1495 flow [2024-06-20 19:15:11,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:15:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:15:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-20 19:15:11,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-20 19:15:11,567 INFO L175 Difference]: Start difference. First operand has 148 places, 126 transitions, 1033 flow. Second operand 9 states and 98 transitions. [2024-06-20 19:15:11,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 146 transitions, 1495 flow [2024-06-20 19:15:11,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 146 transitions, 1453 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-20 19:15:11,626 INFO L231 Difference]: Finished difference. Result has 150 places, 128 transitions, 1075 flow [2024-06-20 19:15:11,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1075, PETRI_PLACES=150, PETRI_TRANSITIONS=128} [2024-06-20 19:15:11,626 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 120 predicate places. [2024-06-20 19:15:11,626 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 128 transitions, 1075 flow [2024-06-20 19:15:11,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:11,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:11,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:15:11,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-20 19:15:11,627 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:15:11,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:11,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1128142631, now seen corresponding path program 3 times [2024-06-20 19:15:11,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:11,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547026815] [2024-06-20 19:15:11,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:11,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:15:16,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:16,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547026815] [2024-06-20 19:15:16,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547026815] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:16,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:16,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:15:16,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452921802] [2024-06-20 19:15:16,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:16,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:15:16,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:16,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:15:16,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:15:16,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:15:16,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 128 transitions, 1075 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:16,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:16,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:15:16,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:17,268 INFO L124 PetriNetUnfolderBase]: 350/623 cut-off events. [2024-06-20 19:15:17,268 INFO L125 PetriNetUnfolderBase]: For 33113/33113 co-relation queries the response was YES. [2024-06-20 19:15:17,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3914 conditions, 623 events. 350/623 cut-off events. For 33113/33113 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2620 event pairs, 53 based on Foata normal form. 1/624 useless extension candidates. Maximal degree in co-relation 3841. Up to 529 conditions per place. [2024-06-20 19:15:17,273 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 113 selfloop transitions, 30 changer transitions 0/145 dead transitions. [2024-06-20 19:15:17,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 145 transitions, 1411 flow [2024-06-20 19:15:17,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:15:17,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:15:17,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-20 19:15:17,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-20 19:15:17,275 INFO L175 Difference]: Start difference. First operand has 150 places, 128 transitions, 1075 flow. Second operand 9 states and 97 transitions. [2024-06-20 19:15:17,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 145 transitions, 1411 flow [2024-06-20 19:15:17,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 145 transitions, 1357 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-20 19:15:17,328 INFO L231 Difference]: Finished difference. Result has 154 places, 128 transitions, 1089 flow [2024-06-20 19:15:17,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1089, PETRI_PLACES=154, PETRI_TRANSITIONS=128} [2024-06-20 19:15:17,328 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 124 predicate places. [2024-06-20 19:15:17,329 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 128 transitions, 1089 flow [2024-06-20 19:15:17,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:17,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:17,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:15:17,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-20 19:15:17,329 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:15:17,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:17,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1045025586, now seen corresponding path program 3 times [2024-06-20 19:15:17,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:17,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452834135] [2024-06-20 19:15:17,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:17,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:22,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:15:22,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:22,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452834135] [2024-06-20 19:15:22,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452834135] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:22,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:22,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:15:22,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221111733] [2024-06-20 19:15:22,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:22,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:15:22,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:22,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:15:22,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:15:22,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:15:22,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 128 transitions, 1089 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:22,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:22,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:15:22,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:22,914 INFO L124 PetriNetUnfolderBase]: 347/618 cut-off events. [2024-06-20 19:15:22,914 INFO L125 PetriNetUnfolderBase]: For 32957/32957 co-relation queries the response was YES. [2024-06-20 19:15:22,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3839 conditions, 618 events. 347/618 cut-off events. For 32957/32957 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2587 event pairs, 52 based on Foata normal form. 2/620 useless extension candidates. Maximal degree in co-relation 3764. Up to 527 conditions per place. [2024-06-20 19:15:22,924 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 116 selfloop transitions, 27 changer transitions 0/145 dead transitions. [2024-06-20 19:15:22,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 145 transitions, 1423 flow [2024-06-20 19:15:22,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:15:22,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:15:22,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-20 19:15:22,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-20 19:15:22,930 INFO L175 Difference]: Start difference. First operand has 154 places, 128 transitions, 1089 flow. Second operand 9 states and 96 transitions. [2024-06-20 19:15:22,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 145 transitions, 1423 flow [2024-06-20 19:15:22,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 145 transitions, 1304 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-20 19:15:22,996 INFO L231 Difference]: Finished difference. Result has 153 places, 128 transitions, 1029 flow [2024-06-20 19:15:23,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1029, PETRI_PLACES=153, PETRI_TRANSITIONS=128} [2024-06-20 19:15:23,002 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 123 predicate places. [2024-06-20 19:15:23,003 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 128 transitions, 1029 flow [2024-06-20 19:15:23,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:23,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:23,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:15:23,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-20 19:15:23,004 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:15:23,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:23,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1131867498, now seen corresponding path program 1 times [2024-06-20 19:15:23,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:23,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429075959] [2024-06-20 19:15:23,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:23,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:28,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:15:28,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:28,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429075959] [2024-06-20 19:15:28,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429075959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:28,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:28,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:15:28,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581937930] [2024-06-20 19:15:28,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:28,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:15:28,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:28,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:15:28,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:15:28,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:15:28,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 128 transitions, 1029 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:28,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:28,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:15:28,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:29,095 INFO L124 PetriNetUnfolderBase]: 353/628 cut-off events. [2024-06-20 19:15:29,096 INFO L125 PetriNetUnfolderBase]: For 34151/34151 co-relation queries the response was YES. [2024-06-20 19:15:29,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3849 conditions, 628 events. 353/628 cut-off events. For 34151/34151 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2648 event pairs, 51 based on Foata normal form. 2/630 useless extension candidates. Maximal degree in co-relation 3773. Up to 540 conditions per place. [2024-06-20 19:15:29,100 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 126 selfloop transitions, 25 changer transitions 0/153 dead transitions. [2024-06-20 19:15:29,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 153 transitions, 1423 flow [2024-06-20 19:15:29,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:15:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:15:29,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-20 19:15:29,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-20 19:15:29,102 INFO L175 Difference]: Start difference. First operand has 153 places, 128 transitions, 1029 flow. Second operand 11 states and 116 transitions. [2024-06-20 19:15:29,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 153 transitions, 1423 flow [2024-06-20 19:15:29,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 153 transitions, 1364 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-20 19:15:29,168 INFO L231 Difference]: Finished difference. Result has 156 places, 130 transitions, 1053 flow [2024-06-20 19:15:29,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1053, PETRI_PLACES=156, PETRI_TRANSITIONS=130} [2024-06-20 19:15:29,168 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 126 predicate places. [2024-06-20 19:15:29,169 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 130 transitions, 1053 flow [2024-06-20 19:15:29,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:29,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:29,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:15:29,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-20 19:15:29,169 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:15:29,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:29,170 INFO L85 PathProgramCache]: Analyzing trace with hash 416490662, now seen corresponding path program 2 times [2024-06-20 19:15:29,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:29,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266763918] [2024-06-20 19:15:29,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:29,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:15:34,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:34,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266763918] [2024-06-20 19:15:34,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266763918] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:34,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:34,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:15:34,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332993453] [2024-06-20 19:15:34,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:34,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:15:34,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:34,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:15:34,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:15:34,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:15:34,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 130 transitions, 1053 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:34,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:34,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:15:34,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:35,117 INFO L124 PetriNetUnfolderBase]: 404/710 cut-off events. [2024-06-20 19:15:35,117 INFO L125 PetriNetUnfolderBase]: For 48062/48062 co-relation queries the response was YES. [2024-06-20 19:15:35,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4772 conditions, 710 events. 404/710 cut-off events. For 48062/48062 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3075 event pairs, 48 based on Foata normal form. 2/712 useless extension candidates. Maximal degree in co-relation 4695. Up to 477 conditions per place. [2024-06-20 19:15:35,123 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 109 selfloop transitions, 51 changer transitions 0/162 dead transitions. [2024-06-20 19:15:35,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 162 transitions, 1763 flow [2024-06-20 19:15:35,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:15:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:15:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-20 19:15:35,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-20 19:15:35,124 INFO L175 Difference]: Start difference. First operand has 156 places, 130 transitions, 1053 flow. Second operand 11 states and 124 transitions. [2024-06-20 19:15:35,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 162 transitions, 1763 flow [2024-06-20 19:15:35,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 162 transitions, 1696 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-20 19:15:35,206 INFO L231 Difference]: Finished difference. Result has 160 places, 138 transitions, 1230 flow [2024-06-20 19:15:35,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1230, PETRI_PLACES=160, PETRI_TRANSITIONS=138} [2024-06-20 19:15:35,206 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 130 predicate places. [2024-06-20 19:15:35,206 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 138 transitions, 1230 flow [2024-06-20 19:15:35,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:35,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:35,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:15:35,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-20 19:15:35,207 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:15:35,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:35,207 INFO L85 PathProgramCache]: Analyzing trace with hash 416498381, now seen corresponding path program 1 times [2024-06-20 19:15:35,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:35,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501124445] [2024-06-20 19:15:35,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:35,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:40,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:15:40,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:40,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501124445] [2024-06-20 19:15:40,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501124445] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:40,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:40,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:15:40,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661236246] [2024-06-20 19:15:40,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:40,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:15:40,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:40,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:15:40,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:15:40,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:15:40,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 138 transitions, 1230 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:40,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:40,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:15:40,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:41,057 INFO L124 PetriNetUnfolderBase]: 400/705 cut-off events. [2024-06-20 19:15:41,058 INFO L125 PetriNetUnfolderBase]: For 47247/47247 co-relation queries the response was YES. [2024-06-20 19:15:41,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4809 conditions, 705 events. 400/705 cut-off events. For 47247/47247 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3046 event pairs, 50 based on Foata normal form. 3/708 useless extension candidates. Maximal degree in co-relation 4729. Up to 485 conditions per place. [2024-06-20 19:15:41,063 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 104 selfloop transitions, 57 changer transitions 0/163 dead transitions. [2024-06-20 19:15:41,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 163 transitions, 1780 flow [2024-06-20 19:15:41,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:15:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:15:41,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-20 19:15:41,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:15:41,065 INFO L175 Difference]: Start difference. First operand has 160 places, 138 transitions, 1230 flow. Second operand 11 states and 121 transitions. [2024-06-20 19:15:41,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 163 transitions, 1780 flow [2024-06-20 19:15:41,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 163 transitions, 1694 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-20 19:15:41,145 INFO L231 Difference]: Finished difference. Result has 166 places, 141 transitions, 1343 flow [2024-06-20 19:15:41,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1343, PETRI_PLACES=166, PETRI_TRANSITIONS=141} [2024-06-20 19:15:41,145 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 136 predicate places. [2024-06-20 19:15:41,146 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 141 transitions, 1343 flow [2024-06-20 19:15:41,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:41,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:41,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:15:41,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-20 19:15:41,146 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:15:41,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:41,147 INFO L85 PathProgramCache]: Analyzing trace with hash 416498102, now seen corresponding path program 3 times [2024-06-20 19:15:41,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:41,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416439861] [2024-06-20 19:15:41,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:41,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:46,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:15:46,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:46,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416439861] [2024-06-20 19:15:46,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416439861] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:46,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:46,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:15:46,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445094061] [2024-06-20 19:15:46,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:46,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:15:46,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:46,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:15:46,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:15:46,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:15:46,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 141 transitions, 1343 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:46,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:46,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:15:46,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:47,135 INFO L124 PetriNetUnfolderBase]: 392/693 cut-off events. [2024-06-20 19:15:47,136 INFO L125 PetriNetUnfolderBase]: For 44367/44367 co-relation queries the response was YES. [2024-06-20 19:15:47,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4681 conditions, 693 events. 392/693 cut-off events. For 44367/44367 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3004 event pairs, 49 based on Foata normal form. 4/697 useless extension candidates. Maximal degree in co-relation 4598. Up to 472 conditions per place. [2024-06-20 19:15:47,140 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 105 selfloop transitions, 56 changer transitions 0/163 dead transitions. [2024-06-20 19:15:47,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 163 transitions, 1839 flow [2024-06-20 19:15:47,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:15:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:15:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2024-06-20 19:15:47,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35777126099706746 [2024-06-20 19:15:47,141 INFO L175 Difference]: Start difference. First operand has 166 places, 141 transitions, 1343 flow. Second operand 11 states and 122 transitions. [2024-06-20 19:15:47,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 163 transitions, 1839 flow [2024-06-20 19:15:47,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 163 transitions, 1680 flow, removed 34 selfloop flow, removed 8 redundant places. [2024-06-20 19:15:47,224 INFO L231 Difference]: Finished difference. Result has 169 places, 141 transitions, 1304 flow [2024-06-20 19:15:47,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1304, PETRI_PLACES=169, PETRI_TRANSITIONS=141} [2024-06-20 19:15:47,224 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 139 predicate places. [2024-06-20 19:15:47,224 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 141 transitions, 1304 flow [2024-06-20 19:15:47,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:47,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:47,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:15:47,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-20 19:15:47,225 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:15:47,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:47,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2063127338, now seen corresponding path program 4 times [2024-06-20 19:15:47,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:47,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024284884] [2024-06-20 19:15:47,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:47,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:15:52,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:52,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024284884] [2024-06-20 19:15:52,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024284884] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:52,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:52,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:15:52,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508760245] [2024-06-20 19:15:52,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:52,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:15:52,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:52,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:15:52,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:15:52,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:15:52,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 141 transitions, 1304 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-20 19:15:52,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:52,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:15:52,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:52,743 INFO L124 PetriNetUnfolderBase]: 396/701 cut-off events. [2024-06-20 19:15:52,744 INFO L125 PetriNetUnfolderBase]: For 43117/43117 co-relation queries the response was YES. [2024-06-20 19:15:52,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4705 conditions, 701 events. 396/701 cut-off events. For 43117/43117 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3043 event pairs, 52 based on Foata normal form. 2/703 useless extension candidates. Maximal degree in co-relation 4621. Up to 584 conditions per place. [2024-06-20 19:15:52,749 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 123 selfloop transitions, 36 changer transitions 0/161 dead transitions. [2024-06-20 19:15:52,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 161 transitions, 1692 flow [2024-06-20 19:15:52,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:15:52,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:15:52,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-20 19:15:52,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-20 19:15:52,750 INFO L175 Difference]: Start difference. First operand has 169 places, 141 transitions, 1304 flow. Second operand 10 states and 107 transitions. [2024-06-20 19:15:52,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 161 transitions, 1692 flow [2024-06-20 19:15:52,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 161 transitions, 1589 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-20 19:15:52,840 INFO L231 Difference]: Finished difference. Result has 170 places, 142 transitions, 1295 flow [2024-06-20 19:15:52,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1295, PETRI_PLACES=170, PETRI_TRANSITIONS=142} [2024-06-20 19:15:52,840 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 140 predicate places. [2024-06-20 19:15:52,840 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 142 transitions, 1295 flow [2024-06-20 19:15:52,841 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-20 19:15:52,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:52,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:15:52,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-20 19:15:52,841 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:15:52,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1577734868, now seen corresponding path program 4 times [2024-06-20 19:15:52,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:52,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102205730] [2024-06-20 19:15:52,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:52,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:15:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:15:58,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:15:58,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102205730] [2024-06-20 19:15:58,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102205730] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:15:58,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:15:58,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:15:58,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536724993] [2024-06-20 19:15:58,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:15:58,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:15:58,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:15:58,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:15:58,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:15:58,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:15:58,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 142 transitions, 1295 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:58,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:15:58,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:15:58,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:15:58,641 INFO L124 PetriNetUnfolderBase]: 402/711 cut-off events. [2024-06-20 19:15:58,641 INFO L125 PetriNetUnfolderBase]: For 44674/44674 co-relation queries the response was YES. [2024-06-20 19:15:58,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4775 conditions, 711 events. 402/711 cut-off events. For 44674/44674 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3101 event pairs, 51 based on Foata normal form. 2/713 useless extension candidates. Maximal degree in co-relation 4690. Up to 482 conditions per place. [2024-06-20 19:15:58,647 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 112 selfloop transitions, 52 changer transitions 0/166 dead transitions. [2024-06-20 19:15:58,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 166 transitions, 1839 flow [2024-06-20 19:15:58,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:15:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:15:58,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-20 19:15:58,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-20 19:15:58,665 INFO L175 Difference]: Start difference. First operand has 170 places, 142 transitions, 1295 flow. Second operand 11 states and 124 transitions. [2024-06-20 19:15:58,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 166 transitions, 1839 flow [2024-06-20 19:15:58,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 166 transitions, 1755 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-20 19:15:58,756 INFO L231 Difference]: Finished difference. Result has 173 places, 144 transitions, 1360 flow [2024-06-20 19:15:58,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1360, PETRI_PLACES=173, PETRI_TRANSITIONS=144} [2024-06-20 19:15:58,757 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 143 predicate places. [2024-06-20 19:15:58,757 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 144 transitions, 1360 flow [2024-06-20 19:15:58,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:15:58,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:15:58,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:15:58,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-20 19:15:58,758 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:15:58,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:15:58,758 INFO L85 PathProgramCache]: Analyzing trace with hash 410776370, now seen corresponding path program 5 times [2024-06-20 19:15:58,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:15:58,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486902181] [2024-06-20 19:15:58,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:15:58,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:15:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:16:04,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:16:04,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:16:04,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486902181] [2024-06-20 19:16:04,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486902181] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:16:04,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:16:04,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:16:04,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225986764] [2024-06-20 19:16:04,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:16:04,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:16:04,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:16:04,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:16:04,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:16:04,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:16:04,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 144 transitions, 1360 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:04,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:16:04,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:16:04,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:16:04,914 INFO L124 PetriNetUnfolderBase]: 406/719 cut-off events. [2024-06-20 19:16:04,914 INFO L125 PetriNetUnfolderBase]: For 46383/46383 co-relation queries the response was YES. [2024-06-20 19:16:04,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4879 conditions, 719 events. 406/719 cut-off events. For 46383/46383 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3154 event pairs, 56 based on Foata normal form. 2/721 useless extension candidates. Maximal degree in co-relation 4793. Up to 602 conditions per place. [2024-06-20 19:16:04,920 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 130 selfloop transitions, 32 changer transitions 0/164 dead transitions. [2024-06-20 19:16:04,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 164 transitions, 1756 flow [2024-06-20 19:16:04,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:16:04,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:16:04,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-20 19:16:04,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34838709677419355 [2024-06-20 19:16:04,922 INFO L175 Difference]: Start difference. First operand has 173 places, 144 transitions, 1360 flow. Second operand 10 states and 108 transitions. [2024-06-20 19:16:04,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 164 transitions, 1756 flow [2024-06-20 19:16:05,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 164 transitions, 1654 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-20 19:16:05,031 INFO L231 Difference]: Finished difference. Result has 175 places, 145 transitions, 1346 flow [2024-06-20 19:16:05,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1346, PETRI_PLACES=175, PETRI_TRANSITIONS=145} [2024-06-20 19:16:05,032 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 145 predicate places. [2024-06-20 19:16:05,032 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 145 transitions, 1346 flow [2024-06-20 19:16:05,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:05,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:16:05,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:16:05,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-20 19:16:05,033 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:16:05,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:16:05,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1583097248, now seen corresponding path program 5 times [2024-06-20 19:16:05,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:16:05,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079364571] [2024-06-20 19:16:05,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:16:05,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:16:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:16:10,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:16:10,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:16:10,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079364571] [2024-06-20 19:16:10,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079364571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:16:10,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:16:10,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:16:10,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594384305] [2024-06-20 19:16:10,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:16:10,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:16:10,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:16:10,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:16:10,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:16:10,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:16:10,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 145 transitions, 1346 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:10,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:16:10,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:16:10,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:16:10,759 INFO L124 PetriNetUnfolderBase]: 406/719 cut-off events. [2024-06-20 19:16:10,759 INFO L125 PetriNetUnfolderBase]: For 46191/46191 co-relation queries the response was YES. [2024-06-20 19:16:10,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4820 conditions, 719 events. 406/719 cut-off events. For 46191/46191 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3149 event pairs, 63 based on Foata normal form. 2/721 useless extension candidates. Maximal degree in co-relation 4733. Up to 491 conditions per place. [2024-06-20 19:16:10,765 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 117 selfloop transitions, 50 changer transitions 0/169 dead transitions. [2024-06-20 19:16:10,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 169 transitions, 1903 flow [2024-06-20 19:16:10,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:16:10,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:16:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-20 19:16:10,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36656891495601174 [2024-06-20 19:16:10,768 INFO L175 Difference]: Start difference. First operand has 175 places, 145 transitions, 1346 flow. Second operand 11 states and 125 transitions. [2024-06-20 19:16:10,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 169 transitions, 1903 flow [2024-06-20 19:16:10,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 169 transitions, 1825 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-20 19:16:10,856 INFO L231 Difference]: Finished difference. Result has 178 places, 147 transitions, 1416 flow [2024-06-20 19:16:10,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1416, PETRI_PLACES=178, PETRI_TRANSITIONS=147} [2024-06-20 19:16:10,857 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 148 predicate places. [2024-06-20 19:16:10,857 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 147 transitions, 1416 flow [2024-06-20 19:16:10,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:10,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:16:10,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:16:10,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-20 19:16:10,858 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:16:10,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:16:10,858 INFO L85 PathProgramCache]: Analyzing trace with hash 410772650, now seen corresponding path program 6 times [2024-06-20 19:16:10,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:16:10,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005892608] [2024-06-20 19:16:10,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:16:10,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:16:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:16:16,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:16:16,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:16:16,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005892608] [2024-06-20 19:16:16,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005892608] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:16:16,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:16:16,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:16:16,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200549794] [2024-06-20 19:16:16,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:16:16,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:16:16,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:16:16,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:16:16,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:16:16,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:16:16,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 147 transitions, 1416 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:16,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:16:16,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:16:16,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:16:17,117 INFO L124 PetriNetUnfolderBase]: 410/727 cut-off events. [2024-06-20 19:16:17,117 INFO L125 PetriNetUnfolderBase]: For 47949/47949 co-relation queries the response was YES. [2024-06-20 19:16:17,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4925 conditions, 727 events. 410/727 cut-off events. For 47949/47949 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3203 event pairs, 56 based on Foata normal form. 2/729 useless extension candidates. Maximal degree in co-relation 4837. Up to 590 conditions per place. [2024-06-20 19:16:17,123 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 131 selfloop transitions, 34 changer transitions 0/167 dead transitions. [2024-06-20 19:16:17,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 167 transitions, 1818 flow [2024-06-20 19:16:17,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:16:17,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:16:17,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-20 19:16:17,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34838709677419355 [2024-06-20 19:16:17,125 INFO L175 Difference]: Start difference. First operand has 178 places, 147 transitions, 1416 flow. Second operand 10 states and 108 transitions. [2024-06-20 19:16:17,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 167 transitions, 1818 flow [2024-06-20 19:16:17,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 167 transitions, 1722 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-20 19:16:17,214 INFO L231 Difference]: Finished difference. Result has 180 places, 148 transitions, 1414 flow [2024-06-20 19:16:17,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1320, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1414, PETRI_PLACES=180, PETRI_TRANSITIONS=148} [2024-06-20 19:16:17,214 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 150 predicate places. [2024-06-20 19:16:17,214 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 148 transitions, 1414 flow [2024-06-20 19:16:17,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:17,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:16:17,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:16:17,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-20 19:16:17,215 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:16:17,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:16:17,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1596764552, now seen corresponding path program 6 times [2024-06-20 19:16:17,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:16:17,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177430187] [2024-06-20 19:16:17,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:16:17,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:16:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:16:22,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-20 19:16:22,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:16:22,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177430187] [2024-06-20 19:16:22,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177430187] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:16:22,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:16:22,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:16:22,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999092844] [2024-06-20 19:16:22,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:16:22,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:16:22,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:16:22,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:16:22,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:16:22,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:16:22,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 148 transitions, 1414 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:22,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:16:22,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:16:22,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:16:23,176 INFO L124 PetriNetUnfolderBase]: 486/850 cut-off events. [2024-06-20 19:16:23,176 INFO L125 PetriNetUnfolderBase]: For 75538/75540 co-relation queries the response was YES. [2024-06-20 19:16:23,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6472 conditions, 850 events. 486/850 cut-off events. For 75538/75540 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3855 event pairs, 58 based on Foata normal form. 4/854 useless extension candidates. Maximal degree in co-relation 6383. Up to 363 conditions per place. [2024-06-20 19:16:23,184 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 109 selfloop transitions, 78 changer transitions 0/189 dead transitions. [2024-06-20 19:16:23,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 189 transitions, 2614 flow [2024-06-20 19:16:23,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:16:23,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:16:23,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-20 19:16:23,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39296187683284456 [2024-06-20 19:16:23,185 INFO L175 Difference]: Start difference. First operand has 180 places, 148 transitions, 1414 flow. Second operand 11 states and 134 transitions. [2024-06-20 19:16:23,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 189 transitions, 2614 flow [2024-06-20 19:16:23,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 189 transitions, 2530 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-20 19:16:23,317 INFO L231 Difference]: Finished difference. Result has 185 places, 160 transitions, 1697 flow [2024-06-20 19:16:23,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1330, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1697, PETRI_PLACES=185, PETRI_TRANSITIONS=160} [2024-06-20 19:16:23,318 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 155 predicate places. [2024-06-20 19:16:23,318 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 160 transitions, 1697 flow [2024-06-20 19:16:23,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:23,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:16:23,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:16:23,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-20 19:16:23,318 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:16:23,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:16:23,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1599398047, now seen corresponding path program 2 times [2024-06-20 19:16:23,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:16:23,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42362385] [2024-06-20 19:16:23,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:16:23,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:16:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:16:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:16:28,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:16:28,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42362385] [2024-06-20 19:16:28,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42362385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:16:28,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:16:28,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:16:28,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610006515] [2024-06-20 19:16:28,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:16:28,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:16:28,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:16:28,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:16:28,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:16:28,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:16:28,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 160 transitions, 1697 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:28,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:16:28,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:16:28,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:16:29,284 INFO L124 PetriNetUnfolderBase]: 482/845 cut-off events. [2024-06-20 19:16:29,285 INFO L125 PetriNetUnfolderBase]: For 74351/74353 co-relation queries the response was YES. [2024-06-20 19:16:29,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6535 conditions, 845 events. 482/845 cut-off events. For 74351/74353 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3819 event pairs, 52 based on Foata normal form. 5/850 useless extension candidates. Maximal degree in co-relation 6443. Up to 454 conditions per place. [2024-06-20 19:16:29,292 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 103 selfloop transitions, 85 changer transitions 0/190 dead transitions. [2024-06-20 19:16:29,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 190 transitions, 2661 flow [2024-06-20 19:16:29,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:16:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:16:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-20 19:16:29,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782991202346041 [2024-06-20 19:16:29,293 INFO L175 Difference]: Start difference. First operand has 185 places, 160 transitions, 1697 flow. Second operand 11 states and 129 transitions. [2024-06-20 19:16:29,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 190 transitions, 2661 flow [2024-06-20 19:16:29,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 190 transitions, 2551 flow, removed 36 selfloop flow, removed 4 redundant places. [2024-06-20 19:16:29,438 INFO L231 Difference]: Finished difference. Result has 195 places, 167 transitions, 1988 flow [2024-06-20 19:16:29,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1597, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1988, PETRI_PLACES=195, PETRI_TRANSITIONS=167} [2024-06-20 19:16:29,439 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 165 predicate places. [2024-06-20 19:16:29,439 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 167 transitions, 1988 flow [2024-06-20 19:16:29,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:29,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:16:29,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:16:29,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-20 19:16:29,440 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:16:29,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:16:29,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1599182566, now seen corresponding path program 7 times [2024-06-20 19:16:29,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:16:29,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999085345] [2024-06-20 19:16:29,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:16:29,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:16:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:16:35,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:16:35,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:16:35,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999085345] [2024-06-20 19:16:35,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999085345] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:16:35,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:16:35,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:16:35,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952766324] [2024-06-20 19:16:35,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:16:35,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:16:35,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:16:35,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:16:35,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:16:35,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:16:35,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 167 transitions, 1988 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:35,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:16:35,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:16:35,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:16:35,692 INFO L124 PetriNetUnfolderBase]: 486/853 cut-off events. [2024-06-20 19:16:35,692 INFO L125 PetriNetUnfolderBase]: For 75446/75448 co-relation queries the response was YES. [2024-06-20 19:16:35,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6867 conditions, 853 events. 486/853 cut-off events. For 75446/75448 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3879 event pairs, 56 based on Foata normal form. 4/857 useless extension candidates. Maximal degree in co-relation 6770. Up to 694 conditions per place. [2024-06-20 19:16:35,699 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 134 selfloop transitions, 49 changer transitions 0/185 dead transitions. [2024-06-20 19:16:35,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 185 transitions, 2424 flow [2024-06-20 19:16:35,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:16:35,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:16:35,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-20 19:16:35,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-20 19:16:35,701 INFO L175 Difference]: Start difference. First operand has 195 places, 167 transitions, 1988 flow. Second operand 10 states and 107 transitions. [2024-06-20 19:16:35,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 185 transitions, 2424 flow [2024-06-20 19:16:35,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 185 transitions, 2331 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-20 19:16:35,882 INFO L231 Difference]: Finished difference. Result has 200 places, 168 transitions, 2021 flow [2024-06-20 19:16:35,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2021, PETRI_PLACES=200, PETRI_TRANSITIONS=168} [2024-06-20 19:16:35,883 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 170 predicate places. [2024-06-20 19:16:35,883 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 168 transitions, 2021 flow [2024-06-20 19:16:35,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:35,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:16:35,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:16:35,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-20 19:16:35,883 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:16:35,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:16:35,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1599397768, now seen corresponding path program 7 times [2024-06-20 19:16:35,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:16:35,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209080167] [2024-06-20 19:16:35,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:16:35,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:16:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:16:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:16:41,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:16:41,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209080167] [2024-06-20 19:16:41,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209080167] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:16:41,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:16:41,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:16:41,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654485403] [2024-06-20 19:16:41,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:16:41,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:16:41,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:16:41,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:16:41,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:16:41,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:16:41,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 168 transitions, 2021 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:41,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:16:41,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:16:41,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:16:41,971 INFO L124 PetriNetUnfolderBase]: 478/841 cut-off events. [2024-06-20 19:16:41,971 INFO L125 PetriNetUnfolderBase]: For 73676/73678 co-relation queries the response was YES. [2024-06-20 19:16:41,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6599 conditions, 841 events. 478/841 cut-off events. For 73676/73678 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3829 event pairs, 54 based on Foata normal form. 6/847 useless extension candidates. Maximal degree in co-relation 6500. Up to 366 conditions per place. [2024-06-20 19:16:41,979 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 109 selfloop transitions, 82 changer transitions 0/193 dead transitions. [2024-06-20 19:16:41,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 193 transitions, 2901 flow [2024-06-20 19:16:41,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:16:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:16:41,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-20 19:16:41,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-20 19:16:41,980 INFO L175 Difference]: Start difference. First operand has 200 places, 168 transitions, 2021 flow. Second operand 11 states and 132 transitions. [2024-06-20 19:16:41,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 193 transitions, 2901 flow [2024-06-20 19:16:42,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 193 transitions, 2751 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-06-20 19:16:42,121 INFO L231 Difference]: Finished difference. Result has 203 places, 168 transitions, 2043 flow [2024-06-20 19:16:42,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2043, PETRI_PLACES=203, PETRI_TRANSITIONS=168} [2024-06-20 19:16:42,122 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 173 predicate places. [2024-06-20 19:16:42,122 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 168 transitions, 2043 flow [2024-06-20 19:16:42,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:42,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:16:42,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:16:42,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-20 19:16:42,122 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:16:42,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:16:42,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1855898278, now seen corresponding path program 8 times [2024-06-20 19:16:42,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:16:42,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298384394] [2024-06-20 19:16:42,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:16:42,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:16:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:16:47,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:16:47,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:16:47,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298384394] [2024-06-20 19:16:47,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298384394] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:16:47,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:16:47,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:16:47,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111283744] [2024-06-20 19:16:47,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:16:47,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:16:47,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:16:47,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:16:47,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:16:47,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:16:47,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 168 transitions, 2043 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:47,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:16:47,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:16:47,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:16:48,183 INFO L124 PetriNetUnfolderBase]: 517/905 cut-off events. [2024-06-20 19:16:48,183 INFO L125 PetriNetUnfolderBase]: For 86384/86386 co-relation queries the response was YES. [2024-06-20 19:16:48,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7406 conditions, 905 events. 517/905 cut-off events. For 86384/86386 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4189 event pairs, 52 based on Foata normal form. 6/911 useless extension candidates. Maximal degree in co-relation 7306. Up to 392 conditions per place. [2024-06-20 19:16:48,191 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 105 selfloop transitions, 95 changer transitions 0/202 dead transitions. [2024-06-20 19:16:48,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 202 transitions, 3119 flow [2024-06-20 19:16:48,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:16:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:16:48,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-20 19:16:48,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3841642228739003 [2024-06-20 19:16:48,195 INFO L175 Difference]: Start difference. First operand has 203 places, 168 transitions, 2043 flow. Second operand 11 states and 131 transitions. [2024-06-20 19:16:48,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 202 transitions, 3119 flow [2024-06-20 19:16:48,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 202 transitions, 2948 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-20 19:16:48,377 INFO L231 Difference]: Finished difference. Result has 206 places, 176 transitions, 2237 flow [2024-06-20 19:16:48,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1884, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2237, PETRI_PLACES=206, PETRI_TRANSITIONS=176} [2024-06-20 19:16:48,378 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 176 predicate places. [2024-06-20 19:16:48,378 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 176 transitions, 2237 flow [2024-06-20 19:16:48,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:16:48,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:16:48,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:16:48,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-20 19:16:48,378 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:16:48,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:16:48,379 INFO L85 PathProgramCache]: Analyzing trace with hash 924757726, now seen corresponding path program 8 times [2024-06-20 19:16:48,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:16:48,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563423642] [2024-06-20 19:16:48,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:16:48,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:16:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:16:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:16:53,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:16:53,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563423642] [2024-06-20 19:16:53,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563423642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:16:53,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:16:53,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:16:53,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401532972] [2024-06-20 19:16:53,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:16:53,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:16:53,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:16:53,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:16:53,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:16:54,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:16:54,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 176 transitions, 2237 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-20 19:16:54,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:16:54,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:16:54,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:16:54,365 INFO L124 PetriNetUnfolderBase]: 521/913 cut-off events. [2024-06-20 19:16:54,365 INFO L125 PetriNetUnfolderBase]: For 85607/85609 co-relation queries the response was YES. [2024-06-20 19:16:54,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7596 conditions, 913 events. 521/913 cut-off events. For 85607/85609 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4241 event pairs, 58 based on Foata normal form. 4/917 useless extension candidates. Maximal degree in co-relation 7494. Up to 754 conditions per place. [2024-06-20 19:16:54,373 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 150 selfloop transitions, 43 changer transitions 0/195 dead transitions. [2024-06-20 19:16:54,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 195 transitions, 2699 flow [2024-06-20 19:16:54,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:16:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:16:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-20 19:16:54,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:16:54,374 INFO L175 Difference]: Start difference. First operand has 206 places, 176 transitions, 2237 flow. Second operand 10 states and 110 transitions. [2024-06-20 19:16:54,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 195 transitions, 2699 flow [2024-06-20 19:16:54,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 195 transitions, 2490 flow, removed 35 selfloop flow, removed 7 redundant places. [2024-06-20 19:16:54,539 INFO L231 Difference]: Finished difference. Result has 209 places, 177 transitions, 2144 flow [2024-06-20 19:16:54,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2028, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2144, PETRI_PLACES=209, PETRI_TRANSITIONS=177} [2024-06-20 19:16:54,539 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 179 predicate places. [2024-06-20 19:16:54,540 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 177 transitions, 2144 flow [2024-06-20 19:16:54,540 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-20 19:16:54,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:16:54,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:16:54,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-20 19:16:54,540 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:16:54,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:16:54,541 INFO L85 PathProgramCache]: Analyzing trace with hash -743401492, now seen corresponding path program 9 times [2024-06-20 19:16:54,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:16:54,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808075406] [2024-06-20 19:16:54,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:16:54,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:16:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:16:59,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:16:59,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:16:59,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808075406] [2024-06-20 19:16:59,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808075406] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:16:59,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:16:59,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:16:59,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336586338] [2024-06-20 19:16:59,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:16:59,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:16:59,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:16:59,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:16:59,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:16:59,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:16:59,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 177 transitions, 2144 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-20 19:16:59,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:16:59,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:16:59,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:17:00,190 INFO L124 PetriNetUnfolderBase]: 525/921 cut-off events. [2024-06-20 19:17:00,190 INFO L125 PetriNetUnfolderBase]: For 88093/88095 co-relation queries the response was YES. [2024-06-20 19:17:00,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7484 conditions, 921 events. 525/921 cut-off events. For 88093/88095 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4301 event pairs, 68 based on Foata normal form. 4/925 useless extension candidates. Maximal degree in co-relation 7381. Up to 762 conditions per place. [2024-06-20 19:17:00,199 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 149 selfloop transitions, 44 changer transitions 0/195 dead transitions. [2024-06-20 19:17:00,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 195 transitions, 2604 flow [2024-06-20 19:17:00,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:17:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:17:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-20 19:17:00,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34838709677419355 [2024-06-20 19:17:00,200 INFO L175 Difference]: Start difference. First operand has 209 places, 177 transitions, 2144 flow. Second operand 10 states and 108 transitions. [2024-06-20 19:17:00,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 195 transitions, 2604 flow [2024-06-20 19:17:00,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 195 transitions, 2498 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-20 19:17:00,384 INFO L231 Difference]: Finished difference. Result has 211 places, 178 transitions, 2158 flow [2024-06-20 19:17:00,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2038, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2158, PETRI_PLACES=211, PETRI_TRANSITIONS=178} [2024-06-20 19:17:00,385 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 181 predicate places. [2024-06-20 19:17:00,385 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 178 transitions, 2158 flow [2024-06-20 19:17:00,385 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-20 19:17:00,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:17:00,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:17:00,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-20 19:17:00,386 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:17:00,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:17:00,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1862795981, now seen corresponding path program 3 times [2024-06-20 19:17:00,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:17:00,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001482165] [2024-06-20 19:17:00,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:17:00,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:17:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:17:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:17:06,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:17:06,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001482165] [2024-06-20 19:17:06,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001482165] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:17:06,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:17:06,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:17:06,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137999166] [2024-06-20 19:17:06,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:17:06,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:17:06,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:17:06,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:17:06,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:17:06,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:17:06,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 178 transitions, 2158 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:06,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:17:06,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:17:06,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:17:07,432 INFO L124 PetriNetUnfolderBase]: 523/917 cut-off events. [2024-06-20 19:17:07,432 INFO L125 PetriNetUnfolderBase]: For 85796/85796 co-relation queries the response was YES. [2024-06-20 19:17:07,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7402 conditions, 917 events. 523/917 cut-off events. For 85796/85796 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4282 event pairs, 95 based on Foata normal form. 1/918 useless extension candidates. Maximal degree in co-relation 7298. Up to 885 conditions per place. [2024-06-20 19:17:07,441 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 171 selfloop transitions, 18 changer transitions 0/191 dead transitions. [2024-06-20 19:17:07,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 191 transitions, 2594 flow [2024-06-20 19:17:07,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:17:07,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:17:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 103 transitions. [2024-06-20 19:17:07,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3020527859237537 [2024-06-20 19:17:07,443 INFO L175 Difference]: Start difference. First operand has 211 places, 178 transitions, 2158 flow. Second operand 11 states and 103 transitions. [2024-06-20 19:17:07,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 191 transitions, 2594 flow [2024-06-20 19:17:07,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 191 transitions, 2484 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-20 19:17:07,635 INFO L231 Difference]: Finished difference. Result has 214 places, 180 transitions, 2126 flow [2024-06-20 19:17:07,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2048, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2126, PETRI_PLACES=214, PETRI_TRANSITIONS=180} [2024-06-20 19:17:07,636 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 184 predicate places. [2024-06-20 19:17:07,636 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 180 transitions, 2126 flow [2024-06-20 19:17:07,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:07,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:17:07,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:17:07,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-20 19:17:07,637 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:17:07,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:17:07,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1118703088, now seen corresponding path program 9 times [2024-06-20 19:17:07,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:17:07,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863019747] [2024-06-20 19:17:07,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:17:07,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:17:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:17:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:17:12,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:17:12,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863019747] [2024-06-20 19:17:12,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863019747] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:17:12,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:17:12,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:17:12,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744750851] [2024-06-20 19:17:12,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:17:12,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:17:12,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:17:12,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:17:12,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:17:12,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:17:12,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 180 transitions, 2126 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:12,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:17:12,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:17:12,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:17:13,380 INFO L124 PetriNetUnfolderBase]: 527/924 cut-off events. [2024-06-20 19:17:13,381 INFO L125 PetriNetUnfolderBase]: For 89450/89452 co-relation queries the response was YES. [2024-06-20 19:17:13,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7357 conditions, 924 events. 527/924 cut-off events. For 89450/89452 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4312 event pairs, 57 based on Foata normal form. 4/928 useless extension candidates. Maximal degree in co-relation 7252. Up to 412 conditions per place. [2024-06-20 19:17:13,389 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 105 selfloop transitions, 99 changer transitions 0/206 dead transitions. [2024-06-20 19:17:13,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 206 transitions, 3070 flow [2024-06-20 19:17:13,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:17:13,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:17:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-20 19:17:13,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3841642228739003 [2024-06-20 19:17:13,391 INFO L175 Difference]: Start difference. First operand has 214 places, 180 transitions, 2126 flow. Second operand 11 states and 131 transitions. [2024-06-20 19:17:13,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 206 transitions, 3070 flow [2024-06-20 19:17:13,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 206 transitions, 2992 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-06-20 19:17:13,588 INFO L231 Difference]: Finished difference. Result has 216 places, 182 transitions, 2279 flow [2024-06-20 19:17:13,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2048, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2279, PETRI_PLACES=216, PETRI_TRANSITIONS=182} [2024-06-20 19:17:13,588 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 186 predicate places. [2024-06-20 19:17:13,588 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 182 transitions, 2279 flow [2024-06-20 19:17:13,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:13,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:17:13,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:17:13,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-20 19:17:13,589 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:17:13,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:17:13,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1853272781, now seen corresponding path program 4 times [2024-06-20 19:17:13,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:17:13,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297270285] [2024-06-20 19:17:13,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:17:13,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:17:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:17:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:17:19,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:17:19,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297270285] [2024-06-20 19:17:19,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297270285] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:17:19,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:17:19,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:17:19,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653628537] [2024-06-20 19:17:19,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:17:19,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:17:19,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:17:19,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:17:19,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:17:19,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:17:19,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 182 transitions, 2279 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:19,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:17:19,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:17:19,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:17:19,622 INFO L124 PetriNetUnfolderBase]: 521/915 cut-off events. [2024-06-20 19:17:19,622 INFO L125 PetriNetUnfolderBase]: For 88198/88200 co-relation queries the response was YES. [2024-06-20 19:17:19,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7343 conditions, 915 events. 521/915 cut-off events. For 88198/88200 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4274 event pairs, 45 based on Foata normal form. 5/920 useless extension candidates. Maximal degree in co-relation 7237. Up to 525 conditions per place. [2024-06-20 19:17:19,631 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 108 selfloop transitions, 96 changer transitions 0/206 dead transitions. [2024-06-20 19:17:19,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 206 transitions, 3194 flow [2024-06-20 19:17:19,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:17:19,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:17:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-20 19:17:19,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375366568914956 [2024-06-20 19:17:19,632 INFO L175 Difference]: Start difference. First operand has 216 places, 182 transitions, 2279 flow. Second operand 11 states and 128 transitions. [2024-06-20 19:17:19,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 206 transitions, 3194 flow [2024-06-20 19:17:19,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 206 transitions, 3021 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-20 19:17:19,835 INFO L231 Difference]: Finished difference. Result has 218 places, 183 transitions, 2327 flow [2024-06-20 19:17:19,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2108, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2327, PETRI_PLACES=218, PETRI_TRANSITIONS=183} [2024-06-20 19:17:19,835 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 188 predicate places. [2024-06-20 19:17:19,835 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 183 transitions, 2327 flow [2024-06-20 19:17:19,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:19,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:17:19,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:17:19,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-20 19:17:19,836 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:17:19,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:17:19,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1170779836, now seen corresponding path program 10 times [2024-06-20 19:17:19,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:17:19,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245476491] [2024-06-20 19:17:19,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:17:19,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:17:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:17:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:17:25,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:17:25,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245476491] [2024-06-20 19:17:25,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245476491] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:17:25,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:17:25,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:17:25,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068734047] [2024-06-20 19:17:25,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:17:25,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:17:25,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:17:25,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:17:25,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:17:25,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:17:25,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 183 transitions, 2327 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:25,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:17:25,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:17:25,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:17:25,681 INFO L124 PetriNetUnfolderBase]: 547/957 cut-off events. [2024-06-20 19:17:25,682 INFO L125 PetriNetUnfolderBase]: For 98692/98694 co-relation queries the response was YES. [2024-06-20 19:17:25,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7972 conditions, 957 events. 547/957 cut-off events. For 98692/98694 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4497 event pairs, 84 based on Foata normal form. 4/961 useless extension candidates. Maximal degree in co-relation 7865. Up to 422 conditions per place. [2024-06-20 19:17:25,691 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 123 selfloop transitions, 89 changer transitions 0/214 dead transitions. [2024-06-20 19:17:25,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 214 transitions, 3545 flow [2024-06-20 19:17:25,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:17:25,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:17:25,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-20 19:17:25,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39882697947214074 [2024-06-20 19:17:25,693 INFO L175 Difference]: Start difference. First operand has 218 places, 183 transitions, 2327 flow. Second operand 11 states and 136 transitions. [2024-06-20 19:17:25,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 214 transitions, 3545 flow [2024-06-20 19:17:25,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 214 transitions, 3372 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-20 19:17:25,910 INFO L231 Difference]: Finished difference. Result has 223 places, 190 transitions, 2512 flow [2024-06-20 19:17:25,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2158, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2512, PETRI_PLACES=223, PETRI_TRANSITIONS=190} [2024-06-20 19:17:25,910 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 193 predicate places. [2024-06-20 19:17:25,911 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 190 transitions, 2512 flow [2024-06-20 19:17:25,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:25,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:17:25,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:17:25,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-20 19:17:25,911 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:17:25,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:17:25,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1176142216, now seen corresponding path program 11 times [2024-06-20 19:17:25,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:17:25,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158396457] [2024-06-20 19:17:25,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:17:25,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:17:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:17:31,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:17:31,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:17:31,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158396457] [2024-06-20 19:17:31,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158396457] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:17:31,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:17:31,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:17:31,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096919120] [2024-06-20 19:17:31,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:17:31,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:17:31,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:17:31,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:17:31,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:17:31,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:17:31,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 190 transitions, 2512 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:31,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:17:31,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:17:31,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:17:32,025 INFO L124 PetriNetUnfolderBase]: 543/951 cut-off events. [2024-06-20 19:17:32,025 INFO L125 PetriNetUnfolderBase]: For 96582/96584 co-relation queries the response was YES. [2024-06-20 19:17:32,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7842 conditions, 951 events. 543/951 cut-off events. For 96582/96584 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4481 event pairs, 75 based on Foata normal form. 4/955 useless extension candidates. Maximal degree in co-relation 7733. Up to 421 conditions per place. [2024-06-20 19:17:32,034 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 106 selfloop transitions, 105 changer transitions 0/213 dead transitions. [2024-06-20 19:17:32,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 213 transitions, 3432 flow [2024-06-20 19:17:32,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:17:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:17:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-20 19:17:32,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-20 19:17:32,035 INFO L175 Difference]: Start difference. First operand has 223 places, 190 transitions, 2512 flow. Second operand 11 states and 132 transitions. [2024-06-20 19:17:32,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 213 transitions, 3432 flow [2024-06-20 19:17:32,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 213 transitions, 3148 flow, removed 30 selfloop flow, removed 9 redundant places. [2024-06-20 19:17:32,268 INFO L231 Difference]: Finished difference. Result has 225 places, 190 transitions, 2443 flow [2024-06-20 19:17:32,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2228, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2443, PETRI_PLACES=225, PETRI_TRANSITIONS=190} [2024-06-20 19:17:32,270 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 195 predicate places. [2024-06-20 19:17:32,270 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 190 transitions, 2443 flow [2024-06-20 19:17:32,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:32,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:17:32,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:17:32,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-20 19:17:32,270 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:17:32,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:17:32,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1855890838, now seen corresponding path program 12 times [2024-06-20 19:17:32,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:17:32,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301795459] [2024-06-20 19:17:32,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:17:32,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:17:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:17:37,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-20 19:17:37,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:17:37,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301795459] [2024-06-20 19:17:37,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301795459] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:17:37,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:17:37,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:17:37,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759267613] [2024-06-20 19:17:37,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:17:37,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:17:37,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:17:37,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:17:37,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:17:37,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:17:37,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 190 transitions, 2443 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:37,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:17:37,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:17:37,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:17:38,361 INFO L124 PetriNetUnfolderBase]: 537/941 cut-off events. [2024-06-20 19:17:38,362 INFO L125 PetriNetUnfolderBase]: For 92856/92858 co-relation queries the response was YES. [2024-06-20 19:17:38,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7546 conditions, 941 events. 537/941 cut-off events. For 92856/92858 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4443 event pairs, 53 based on Foata normal form. 4/945 useless extension candidates. Maximal degree in co-relation 7437. Up to 417 conditions per place. [2024-06-20 19:17:38,371 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 105 selfloop transitions, 106 changer transitions 0/213 dead transitions. [2024-06-20 19:17:38,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 213 transitions, 3369 flow [2024-06-20 19:17:38,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:17:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:17:38,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-20 19:17:38,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522 [2024-06-20 19:17:38,372 INFO L175 Difference]: Start difference. First operand has 225 places, 190 transitions, 2443 flow. Second operand 11 states and 130 transitions. [2024-06-20 19:17:38,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 213 transitions, 3369 flow [2024-06-20 19:17:38,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 213 transitions, 3149 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-20 19:17:38,601 INFO L231 Difference]: Finished difference. Result has 228 places, 190 transitions, 2440 flow [2024-06-20 19:17:38,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2223, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2440, PETRI_PLACES=228, PETRI_TRANSITIONS=190} [2024-06-20 19:17:38,602 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 198 predicate places. [2024-06-20 19:17:38,602 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 190 transitions, 2440 flow [2024-06-20 19:17:38,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:38,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:17:38,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:17:38,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-20 19:17:38,602 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:17:38,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:17:38,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1865095048, now seen corresponding path program 13 times [2024-06-20 19:17:38,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:17:38,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582163685] [2024-06-20 19:17:38,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:17:38,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:17:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:17:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:17:44,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:17:44,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582163685] [2024-06-20 19:17:44,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582163685] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:17:44,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:17:44,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:17:44,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980135125] [2024-06-20 19:17:44,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:17:44,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:17:44,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:17:44,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:17:44,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:17:44,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:17:44,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 190 transitions, 2440 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:44,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:17:44,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:17:44,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:17:44,821 INFO L124 PetriNetUnfolderBase]: 529/928 cut-off events. [2024-06-20 19:17:44,822 INFO L125 PetriNetUnfolderBase]: For 90308/90308 co-relation queries the response was YES. [2024-06-20 19:17:44,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7194 conditions, 928 events. 529/928 cut-off events. For 90308/90308 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4359 event pairs, 93 based on Foata normal form. 4/932 useless extension candidates. Maximal degree in co-relation 7084. Up to 873 conditions per place. [2024-06-20 19:17:44,831 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 179 selfloop transitions, 22 changer transitions 0/203 dead transitions. [2024-06-20 19:17:44,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 203 transitions, 3024 flow [2024-06-20 19:17:44,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:17:44,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:17:44,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-20 19:17:44,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32903225806451614 [2024-06-20 19:17:44,832 INFO L175 Difference]: Start difference. First operand has 228 places, 190 transitions, 2440 flow. Second operand 10 states and 102 transitions. [2024-06-20 19:17:44,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 203 transitions, 3024 flow [2024-06-20 19:17:45,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 203 transitions, 2741 flow, removed 21 selfloop flow, removed 10 redundant places. [2024-06-20 19:17:45,047 INFO L231 Difference]: Finished difference. Result has 228 places, 190 transitions, 2209 flow [2024-06-20 19:17:45,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2157, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2209, PETRI_PLACES=228, PETRI_TRANSITIONS=190} [2024-06-20 19:17:45,047 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 198 predicate places. [2024-06-20 19:17:45,047 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 190 transitions, 2209 flow [2024-06-20 19:17:45,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:45,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:17:45,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:17:45,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-20 19:17:45,048 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:17:45,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:17:45,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1176296038, now seen corresponding path program 10 times [2024-06-20 19:17:45,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:17:45,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906239606] [2024-06-20 19:17:45,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:17:45,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:17:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:17:51,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:17:51,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:17:51,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906239606] [2024-06-20 19:17:51,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906239606] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:17:51,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:17:51,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:17:51,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061133003] [2024-06-20 19:17:51,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:17:51,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:17:51,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:17:51,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:17:51,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:17:51,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:17:51,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 190 transitions, 2209 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:51,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:17:51,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:17:51,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:17:51,541 INFO L124 PetriNetUnfolderBase]: 526/924 cut-off events. [2024-06-20 19:17:51,541 INFO L125 PetriNetUnfolderBase]: For 80989/80991 co-relation queries the response was YES. [2024-06-20 19:17:51,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6728 conditions, 924 events. 526/924 cut-off events. For 80989/80991 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4346 event pairs, 60 based on Foata normal form. 4/928 useless extension candidates. Maximal degree in co-relation 6617. Up to 739 conditions per place. [2024-06-20 19:17:51,550 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 158 selfloop transitions, 47 changer transitions 0/207 dead transitions. [2024-06-20 19:17:51,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 207 transitions, 2665 flow [2024-06-20 19:17:51,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:17:51,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:17:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-20 19:17:51,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34838709677419355 [2024-06-20 19:17:51,552 INFO L175 Difference]: Start difference. First operand has 228 places, 190 transitions, 2209 flow. Second operand 10 states and 108 transitions. [2024-06-20 19:17:51,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 207 transitions, 2665 flow [2024-06-20 19:17:51,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 207 transitions, 2586 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-20 19:17:51,769 INFO L231 Difference]: Finished difference. Result has 228 places, 190 transitions, 2228 flow [2024-06-20 19:17:51,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2228, PETRI_PLACES=228, PETRI_TRANSITIONS=190} [2024-06-20 19:17:51,770 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 198 predicate places. [2024-06-20 19:17:51,770 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 190 transitions, 2228 flow [2024-06-20 19:17:51,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:51,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:17:51,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:17:51,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-20 19:17:51,771 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:17:51,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:17:51,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1170578026, now seen corresponding path program 14 times [2024-06-20 19:17:51,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:17:51,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380561421] [2024-06-20 19:17:51,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:17:51,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:17:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:17:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:17:57,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:17:57,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380561421] [2024-06-20 19:17:57,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380561421] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:17:57,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:17:57,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:17:57,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197703049] [2024-06-20 19:17:57,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:17:57,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:17:57,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:17:57,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:17:57,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:17:57,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:17:57,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 190 transitions, 2228 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:57,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:17:57,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:17:57,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:17:57,657 INFO L124 PetriNetUnfolderBase]: 532/934 cut-off events. [2024-06-20 19:17:57,658 INFO L125 PetriNetUnfolderBase]: For 82749/82751 co-relation queries the response was YES. [2024-06-20 19:17:57,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6876 conditions, 934 events. 532/934 cut-off events. For 82749/82751 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4420 event pairs, 74 based on Foata normal form. 4/938 useless extension candidates. Maximal degree in co-relation 6764. Up to 410 conditions per place. [2024-06-20 19:17:57,666 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 123 selfloop transitions, 91 changer transitions 0/216 dead transitions. [2024-06-20 19:17:57,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 216 transitions, 3375 flow [2024-06-20 19:17:57,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:17:57,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:17:57,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-20 19:17:57,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39589442815249265 [2024-06-20 19:17:57,668 INFO L175 Difference]: Start difference. First operand has 228 places, 190 transitions, 2228 flow. Second operand 11 states and 135 transitions. [2024-06-20 19:17:57,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 216 transitions, 3375 flow [2024-06-20 19:17:57,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 216 transitions, 3213 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-20 19:17:57,890 INFO L231 Difference]: Finished difference. Result has 229 places, 192 transitions, 2296 flow [2024-06-20 19:17:57,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2066, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2296, PETRI_PLACES=229, PETRI_TRANSITIONS=192} [2024-06-20 19:17:57,890 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 199 predicate places. [2024-06-20 19:17:57,890 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 192 transitions, 2296 flow [2024-06-20 19:17:57,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:17:57,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:17:57,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:17:57,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-20 19:17:57,891 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:17:57,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:17:57,891 INFO L85 PathProgramCache]: Analyzing trace with hash 924972928, now seen corresponding path program 15 times [2024-06-20 19:17:57,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:17:57,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205765] [2024-06-20 19:17:57,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:17:57,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:17:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:18:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:18:03,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:18:03,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205765] [2024-06-20 19:18:03,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205765] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:18:03,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:18:03,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:18:03,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346714259] [2024-06-20 19:18:03,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:18:03,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:18:03,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:18:03,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:18:03,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:18:03,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:18:03,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 192 transitions, 2296 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:03,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:18:03,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:18:03,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:18:03,591 INFO L124 PetriNetUnfolderBase]: 526/926 cut-off events. [2024-06-20 19:18:03,592 INFO L125 PetriNetUnfolderBase]: For 79770/79772 co-relation queries the response was YES. [2024-06-20 19:18:03,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6557 conditions, 926 events. 526/926 cut-off events. For 79770/79772 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4384 event pairs, 72 based on Foata normal form. 6/932 useless extension candidates. Maximal degree in co-relation 6445. Up to 409 conditions per place. [2024-06-20 19:18:03,599 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 121 selfloop transitions, 92 changer transitions 0/215 dead transitions. [2024-06-20 19:18:03,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 215 transitions, 3250 flow [2024-06-20 19:18:03,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:18:03,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:18:03,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-20 19:18:03,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39002932551319647 [2024-06-20 19:18:03,601 INFO L175 Difference]: Start difference. First operand has 229 places, 192 transitions, 2296 flow. Second operand 11 states and 133 transitions. [2024-06-20 19:18:03,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 215 transitions, 3250 flow [2024-06-20 19:18:03,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 215 transitions, 2926 flow, removed 33 selfloop flow, removed 11 redundant places. [2024-06-20 19:18:03,807 INFO L231 Difference]: Finished difference. Result has 229 places, 192 transitions, 2164 flow [2024-06-20 19:18:03,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1972, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2164, PETRI_PLACES=229, PETRI_TRANSITIONS=192} [2024-06-20 19:18:03,808 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 199 predicate places. [2024-06-20 19:18:03,808 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 192 transitions, 2164 flow [2024-06-20 19:18:03,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:03,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:18:03,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:18:03,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-20 19:18:03,809 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:18:03,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:18:03,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1170570307, now seen corresponding path program 5 times [2024-06-20 19:18:03,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:18:03,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751756857] [2024-06-20 19:18:03,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:18:03,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:18:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:18:09,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:18:09,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:18:09,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751756857] [2024-06-20 19:18:09,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751756857] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:18:09,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:18:09,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:18:09,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463058230] [2024-06-20 19:18:09,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:18:09,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:18:09,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:18:09,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:18:09,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:18:09,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:18:09,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 192 transitions, 2164 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:09,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:18:09,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:18:09,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:18:09,723 INFO L124 PetriNetUnfolderBase]: 518/913 cut-off events. [2024-06-20 19:18:09,724 INFO L125 PetriNetUnfolderBase]: For 68992/68994 co-relation queries the response was YES. [2024-06-20 19:18:09,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6076 conditions, 913 events. 518/913 cut-off events. For 68992/68994 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4321 event pairs, 65 based on Foata normal form. 5/918 useless extension candidates. Maximal degree in co-relation 5965. Up to 515 conditions per place. [2024-06-20 19:18:09,733 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 120 selfloop transitions, 91 changer transitions 0/213 dead transitions. [2024-06-20 19:18:09,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 213 transitions, 2804 flow [2024-06-20 19:18:09,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:18:09,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:18:09,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-20 19:18:09,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375366568914956 [2024-06-20 19:18:09,735 INFO L175 Difference]: Start difference. First operand has 229 places, 192 transitions, 2164 flow. Second operand 11 states and 128 transitions. [2024-06-20 19:18:09,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 213 transitions, 2804 flow [2024-06-20 19:18:09,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 213 transitions, 2593 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-20 19:18:09,889 INFO L231 Difference]: Finished difference. Result has 231 places, 192 transitions, 2145 flow [2024-06-20 19:18:09,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1953, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2145, PETRI_PLACES=231, PETRI_TRANSITIONS=192} [2024-06-20 19:18:09,890 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 201 predicate places. [2024-06-20 19:18:09,890 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 192 transitions, 2145 flow [2024-06-20 19:18:09,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:09,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:18:09,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:18:09,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-20 19:18:09,890 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:18:09,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:18:09,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1715349041, now seen corresponding path program 1 times [2024-06-20 19:18:09,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:18:09,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484024583] [2024-06-20 19:18:09,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:18:09,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:18:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:18:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:18:15,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:18:15,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484024583] [2024-06-20 19:18:15,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484024583] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:18:15,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:18:15,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:18:15,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112090177] [2024-06-20 19:18:15,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:18:15,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:18:15,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:18:15,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:18:15,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:18:15,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:18:15,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 192 transitions, 2145 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:15,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:18:15,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:18:15,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:18:15,947 INFO L124 PetriNetUnfolderBase]: 522/920 cut-off events. [2024-06-20 19:18:15,947 INFO L125 PetriNetUnfolderBase]: For 67421/67421 co-relation queries the response was YES. [2024-06-20 19:18:15,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6111 conditions, 920 events. 522/920 cut-off events. For 67421/67421 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4360 event pairs, 66 based on Foata normal form. 2/922 useless extension candidates. Maximal degree in co-relation 5999. Up to 827 conditions per place. [2024-06-20 19:18:15,955 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 192 selfloop transitions, 18 changer transitions 0/212 dead transitions. [2024-06-20 19:18:15,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 212 transitions, 2623 flow [2024-06-20 19:18:15,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:18:15,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:18:15,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2024-06-20 19:18:15,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3258064516129032 [2024-06-20 19:18:15,957 INFO L175 Difference]: Start difference. First operand has 231 places, 192 transitions, 2145 flow. Second operand 10 states and 101 transitions. [2024-06-20 19:18:15,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 212 transitions, 2623 flow [2024-06-20 19:18:16,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 212 transitions, 2278 flow, removed 2 selfloop flow, removed 14 redundant places. [2024-06-20 19:18:16,120 INFO L231 Difference]: Finished difference. Result has 227 places, 193 transitions, 1852 flow [2024-06-20 19:18:16,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1800, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1852, PETRI_PLACES=227, PETRI_TRANSITIONS=193} [2024-06-20 19:18:16,121 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 197 predicate places. [2024-06-20 19:18:16,121 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 193 transitions, 1852 flow [2024-06-20 19:18:16,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:16,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:18:16,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:18:16,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-20 19:18:16,121 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:18:16,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:18:16,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1072513319, now seen corresponding path program 2 times [2024-06-20 19:18:16,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:18:16,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299336056] [2024-06-20 19:18:16,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:18:16,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:18:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:18:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:18:21,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:18:21,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299336056] [2024-06-20 19:18:21,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299336056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:18:21,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:18:21,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:18:21,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451200851] [2024-06-20 19:18:21,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:18:21,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:18:21,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:18:21,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:18:21,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:18:22,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:18:22,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 193 transitions, 1852 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:22,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:18:22,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:18:22,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:18:22,528 INFO L124 PetriNetUnfolderBase]: 533/941 cut-off events. [2024-06-20 19:18:22,529 INFO L125 PetriNetUnfolderBase]: For 74253/74253 co-relation queries the response was YES. [2024-06-20 19:18:22,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6074 conditions, 941 events. 533/941 cut-off events. For 74253/74253 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4496 event pairs, 79 based on Foata normal form. 2/943 useless extension candidates. Maximal degree in co-relation 5961. Up to 820 conditions per place. [2024-06-20 19:18:22,540 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 182 selfloop transitions, 31 changer transitions 0/215 dead transitions. [2024-06-20 19:18:22,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 215 transitions, 2516 flow [2024-06-20 19:18:22,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:18:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:18:22,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-20 19:18:22,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-20 19:18:22,542 INFO L175 Difference]: Start difference. First operand has 227 places, 193 transitions, 1852 flow. Second operand 10 states and 107 transitions. [2024-06-20 19:18:22,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 215 transitions, 2516 flow [2024-06-20 19:18:22,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 215 transitions, 2474 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-20 19:18:22,721 INFO L231 Difference]: Finished difference. Result has 229 places, 195 transitions, 1902 flow [2024-06-20 19:18:22,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1810, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1902, PETRI_PLACES=229, PETRI_TRANSITIONS=195} [2024-06-20 19:18:22,722 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 199 predicate places. [2024-06-20 19:18:22,722 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 195 transitions, 1902 flow [2024-06-20 19:18:22,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:22,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:18:22,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:18:22,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-20 19:18:22,723 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:18:22,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:18:22,723 INFO L85 PathProgramCache]: Analyzing trace with hash 645835223, now seen corresponding path program 1 times [2024-06-20 19:18:22,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:18:22,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966888218] [2024-06-20 19:18:22,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:18:22,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:18:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:18:28,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:18:28,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:18:28,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966888218] [2024-06-20 19:18:28,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966888218] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:18:28,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:18:28,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:18:28,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868589076] [2024-06-20 19:18:28,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:18:28,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:18:28,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:18:28,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:18:28,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:18:28,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:18:28,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 195 transitions, 1902 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:28,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:18:28,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:18:28,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:18:28,695 INFO L124 PetriNetUnfolderBase]: 530/936 cut-off events. [2024-06-20 19:18:28,695 INFO L125 PetriNetUnfolderBase]: For 69976/69976 co-relation queries the response was YES. [2024-06-20 19:18:28,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6006 conditions, 936 events. 530/936 cut-off events. For 69976/69976 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4468 event pairs, 80 based on Foata normal form. 1/937 useless extension candidates. Maximal degree in co-relation 5892. Up to 831 conditions per place. [2024-06-20 19:18:28,704 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 178 selfloop transitions, 34 changer transitions 0/214 dead transitions. [2024-06-20 19:18:28,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 214 transitions, 2382 flow [2024-06-20 19:18:28,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:18:28,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:18:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-20 19:18:28,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-20 19:18:28,705 INFO L175 Difference]: Start difference. First operand has 229 places, 195 transitions, 1902 flow. Second operand 10 states and 106 transitions. [2024-06-20 19:18:28,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 214 transitions, 2382 flow [2024-06-20 19:18:28,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 214 transitions, 2316 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-20 19:18:28,874 INFO L231 Difference]: Finished difference. Result has 233 places, 195 transitions, 1912 flow [2024-06-20 19:18:28,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1836, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1912, PETRI_PLACES=233, PETRI_TRANSITIONS=195} [2024-06-20 19:18:28,874 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 203 predicate places. [2024-06-20 19:18:28,874 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 195 transitions, 1912 flow [2024-06-20 19:18:28,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:28,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:18:28,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:18:28,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-20 19:18:28,875 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:18:28,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:18:28,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1072508669, now seen corresponding path program 3 times [2024-06-20 19:18:28,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:18:28,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291856501] [2024-06-20 19:18:28,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:18:28,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:18:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:18:34,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-20 19:18:34,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:18:34,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291856501] [2024-06-20 19:18:34,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291856501] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:18:34,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:18:34,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:18:34,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806565697] [2024-06-20 19:18:34,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:18:34,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:18:34,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:18:34,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:18:34,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:18:34,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:18:34,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 195 transitions, 1912 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:34,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:18:34,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:18:34,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:18:34,577 INFO L124 PetriNetUnfolderBase]: 527/931 cut-off events. [2024-06-20 19:18:34,577 INFO L125 PetriNetUnfolderBase]: For 68271/68271 co-relation queries the response was YES. [2024-06-20 19:18:34,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5864 conditions, 931 events. 527/931 cut-off events. For 68271/68271 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4448 event pairs, 79 based on Foata normal form. 2/933 useless extension candidates. Maximal degree in co-relation 5748. Up to 829 conditions per place. [2024-06-20 19:18:34,586 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 181 selfloop transitions, 31 changer transitions 0/214 dead transitions. [2024-06-20 19:18:34,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 214 transitions, 2390 flow [2024-06-20 19:18:34,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:18:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:18:34,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-20 19:18:34,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-20 19:18:34,588 INFO L175 Difference]: Start difference. First operand has 233 places, 195 transitions, 1912 flow. Second operand 10 states and 105 transitions. [2024-06-20 19:18:34,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 214 transitions, 2390 flow [2024-06-20 19:18:34,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 214 transitions, 2223 flow, removed 9 selfloop flow, removed 12 redundant places. [2024-06-20 19:18:34,750 INFO L231 Difference]: Finished difference. Result has 231 places, 195 transitions, 1812 flow [2024-06-20 19:18:34,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1745, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1812, PETRI_PLACES=231, PETRI_TRANSITIONS=195} [2024-06-20 19:18:34,759 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 201 predicate places. [2024-06-20 19:18:34,759 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 195 transitions, 1812 flow [2024-06-20 19:18:34,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:34,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:18:34,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:18:34,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-20 19:18:34,761 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:18:34,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:18:34,761 INFO L85 PathProgramCache]: Analyzing trace with hash 645715067, now seen corresponding path program 4 times [2024-06-20 19:18:34,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:18:34,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392525031] [2024-06-20 19:18:34,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:18:34,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:18:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:18:40,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-20 19:18:40,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:18:40,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392525031] [2024-06-20 19:18:40,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392525031] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:18:40,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:18:40,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:18:40,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183281212] [2024-06-20 19:18:40,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:18:40,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:18:40,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:18:40,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:18:40,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:18:40,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:18:40,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 195 transitions, 1812 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:40,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:18:40,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:18:40,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:18:41,156 INFO L124 PetriNetUnfolderBase]: 531/939 cut-off events. [2024-06-20 19:18:41,156 INFO L125 PetriNetUnfolderBase]: For 69804/69804 co-relation queries the response was YES. [2024-06-20 19:18:41,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5797 conditions, 939 events. 531/939 cut-off events. For 69804/69804 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4511 event pairs, 79 based on Foata normal form. 2/941 useless extension candidates. Maximal degree in co-relation 5680. Up to 793 conditions per place. [2024-06-20 19:18:41,165 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 184 selfloop transitions, 29 changer transitions 0/215 dead transitions. [2024-06-20 19:18:41,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 215 transitions, 2302 flow [2024-06-20 19:18:41,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:18:41,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:18:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-20 19:18:41,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-20 19:18:41,166 INFO L175 Difference]: Start difference. First operand has 231 places, 195 transitions, 1812 flow. Second operand 10 states and 107 transitions. [2024-06-20 19:18:41,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 215 transitions, 2302 flow [2024-06-20 19:18:41,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 215 transitions, 2237 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-20 19:18:41,352 INFO L231 Difference]: Finished difference. Result has 232 places, 196 transitions, 1825 flow [2024-06-20 19:18:41,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1747, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1825, PETRI_PLACES=232, PETRI_TRANSITIONS=196} [2024-06-20 19:18:41,353 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 202 predicate places. [2024-06-20 19:18:41,353 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 196 transitions, 1825 flow [2024-06-20 19:18:41,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:41,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:18:41,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:18:41,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-20 19:18:41,354 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:18:41,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:18:41,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1665319045, now seen corresponding path program 5 times [2024-06-20 19:18:41,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:18:41,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407750893] [2024-06-20 19:18:41,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:18:41,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:18:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:18:46,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:18:46,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:18:46,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407750893] [2024-06-20 19:18:46,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407750893] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:18:46,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:18:46,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:18:46,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358656922] [2024-06-20 19:18:46,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:18:46,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:18:46,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:18:46,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:18:46,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:18:46,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:18:46,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 196 transitions, 1825 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-20 19:18:46,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:18:46,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:18:46,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:18:47,408 INFO L124 PetriNetUnfolderBase]: 535/947 cut-off events. [2024-06-20 19:18:47,409 INFO L125 PetriNetUnfolderBase]: For 71584/71584 co-relation queries the response was YES. [2024-06-20 19:18:47,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5864 conditions, 947 events. 535/947 cut-off events. For 71584/71584 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4550 event pairs, 69 based on Foata normal form. 2/949 useless extension candidates. Maximal degree in co-relation 5746. Up to 794 conditions per place. [2024-06-20 19:18:47,417 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 172 selfloop transitions, 44 changer transitions 0/218 dead transitions. [2024-06-20 19:18:47,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 218 transitions, 2333 flow [2024-06-20 19:18:47,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:18:47,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:18:47,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-20 19:18:47,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3460410557184751 [2024-06-20 19:18:47,421 INFO L175 Difference]: Start difference. First operand has 232 places, 196 transitions, 1825 flow. Second operand 11 states and 118 transitions. [2024-06-20 19:18:47,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 218 transitions, 2333 flow [2024-06-20 19:18:47,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 218 transitions, 2265 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-20 19:18:47,615 INFO L231 Difference]: Finished difference. Result has 235 places, 197 transitions, 1867 flow [2024-06-20 19:18:47,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1757, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1867, PETRI_PLACES=235, PETRI_TRANSITIONS=197} [2024-06-20 19:18:47,616 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 205 predicate places. [2024-06-20 19:18:47,616 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 197 transitions, 1867 flow [2024-06-20 19:18:47,616 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-20 19:18:47,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:18:47,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:18:47,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-20 19:18:47,617 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:18:47,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:18:47,617 INFO L85 PathProgramCache]: Analyzing trace with hash 19869481, now seen corresponding path program 6 times [2024-06-20 19:18:47,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:18:47,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782464659] [2024-06-20 19:18:47,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:18:47,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:18:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:18:53,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:18:53,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:18:53,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782464659] [2024-06-20 19:18:53,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782464659] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:18:53,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:18:53,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:18:53,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4800884] [2024-06-20 19:18:53,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:18:53,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:18:53,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:18:53,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:18:53,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:18:53,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:18:53,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 197 transitions, 1867 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:53,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:18:53,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:18:53,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:18:54,160 INFO L124 PetriNetUnfolderBase]: 546/968 cut-off events. [2024-06-20 19:18:54,160 INFO L125 PetriNetUnfolderBase]: For 80823/80823 co-relation queries the response was YES. [2024-06-20 19:18:54,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6201 conditions, 968 events. 546/968 cut-off events. For 80823/80823 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4715 event pairs, 70 based on Foata normal form. 2/970 useless extension candidates. Maximal degree in co-relation 6082. Up to 792 conditions per place. [2024-06-20 19:18:54,170 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 173 selfloop transitions, 46 changer transitions 0/221 dead transitions. [2024-06-20 19:18:54,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 221 transitions, 2571 flow [2024-06-20 19:18:54,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:18:54,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:18:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-20 19:18:54,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3489736070381232 [2024-06-20 19:18:54,171 INFO L175 Difference]: Start difference. First operand has 235 places, 197 transitions, 1867 flow. Second operand 11 states and 119 transitions. [2024-06-20 19:18:54,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 221 transitions, 2571 flow [2024-06-20 19:18:54,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 221 transitions, 2471 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-20 19:18:54,382 INFO L231 Difference]: Finished difference. Result has 237 places, 199 transitions, 1901 flow [2024-06-20 19:18:54,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1767, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1901, PETRI_PLACES=237, PETRI_TRANSITIONS=199} [2024-06-20 19:18:54,383 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 207 predicate places. [2024-06-20 19:18:54,383 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 199 transitions, 1901 flow [2024-06-20 19:18:54,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:18:54,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:18:54,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:18:54,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-20 19:18:54,384 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:18:54,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:18:54,384 INFO L85 PathProgramCache]: Analyzing trace with hash 26303221, now seen corresponding path program 7 times [2024-06-20 19:18:54,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:18:54,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341245929] [2024-06-20 19:18:54,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:18:54,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:18:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:19:00,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-20 19:19:00,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:19:00,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341245929] [2024-06-20 19:19:00,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341245929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:19:00,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:19:00,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:19:00,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857761977] [2024-06-20 19:19:00,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:19:00,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:19:00,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:19:00,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:19:00,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:19:00,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:19:00,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 199 transitions, 1901 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-20 19:19:00,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:19:00,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:19:00,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:19:00,497 INFO L124 PetriNetUnfolderBase]: 543/963 cut-off events. [2024-06-20 19:19:00,497 INFO L125 PetriNetUnfolderBase]: For 75296/75296 co-relation queries the response was YES. [2024-06-20 19:19:00,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6016 conditions, 963 events. 543/963 cut-off events. For 75296/75296 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4694 event pairs, 69 based on Foata normal form. 2/965 useless extension candidates. Maximal degree in co-relation 5896. Up to 810 conditions per place. [2024-06-20 19:19:00,506 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 171 selfloop transitions, 47 changer transitions 0/220 dead transitions. [2024-06-20 19:19:00,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 220 transitions, 2397 flow [2024-06-20 19:19:00,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:19:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:19:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-20 19:19:00,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34310850439882695 [2024-06-20 19:19:00,507 INFO L175 Difference]: Start difference. First operand has 237 places, 199 transitions, 1901 flow. Second operand 11 states and 117 transitions. [2024-06-20 19:19:00,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 220 transitions, 2397 flow [2024-06-20 19:19:00,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 220 transitions, 2307 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-20 19:19:00,715 INFO L231 Difference]: Finished difference. Result has 241 places, 199 transitions, 1909 flow [2024-06-20 19:19:00,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1811, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1909, PETRI_PLACES=241, PETRI_TRANSITIONS=199} [2024-06-20 19:19:00,715 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 211 predicate places. [2024-06-20 19:19:00,716 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 199 transitions, 1909 flow [2024-06-20 19:19:00,716 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-20 19:19:00,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:19:00,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:19:00,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-20 19:19:00,716 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:19:00,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:19:00,717 INFO L85 PathProgramCache]: Analyzing trace with hash 612204891, now seen corresponding path program 1 times [2024-06-20 19:19:00,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:19:00,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256112923] [2024-06-20 19:19:00,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:19:00,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:19:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:19:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:19:06,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:19:06,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256112923] [2024-06-20 19:19:06,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256112923] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:19:06,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:19:06,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:19:06,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390797319] [2024-06-20 19:19:06,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:19:06,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:19:06,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:19:06,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:19:06,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:19:06,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:19:06,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 199 transitions, 1909 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:19:06,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:19:06,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:19:06,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:19:06,829 INFO L124 PetriNetUnfolderBase]: 563/1007 cut-off events. [2024-06-20 19:19:06,829 INFO L125 PetriNetUnfolderBase]: For 113758/113758 co-relation queries the response was YES. [2024-06-20 19:19:06,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6240 conditions, 1007 events. 563/1007 cut-off events. For 113758/113758 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4970 event pairs, 77 based on Foata normal form. 12/1019 useless extension candidates. Maximal degree in co-relation 6118. Up to 739 conditions per place. [2024-06-20 19:19:06,839 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 158 selfloop transitions, 55 changer transitions 12/227 dead transitions. [2024-06-20 19:19:06,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 227 transitions, 2483 flow [2024-06-20 19:19:06,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:19:06,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:19:06,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions. [2024-06-20 19:19:06,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:19:06,844 INFO L175 Difference]: Start difference. First operand has 241 places, 199 transitions, 1909 flow. Second operand 12 states and 132 transitions. [2024-06-20 19:19:06,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 227 transitions, 2483 flow [2024-06-20 19:19:07,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 227 transitions, 2383 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-20 19:19:07,053 INFO L231 Difference]: Finished difference. Result has 243 places, 193 transitions, 1880 flow [2024-06-20 19:19:07,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1809, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1880, PETRI_PLACES=243, PETRI_TRANSITIONS=193} [2024-06-20 19:19:07,053 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 213 predicate places. [2024-06-20 19:19:07,054 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 193 transitions, 1880 flow [2024-06-20 19:19:07,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:19:07,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:19:07,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:19:07,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-20 19:19:07,054 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:19:07,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:19:07,055 INFO L85 PathProgramCache]: Analyzing trace with hash -150828299, now seen corresponding path program 8 times [2024-06-20 19:19:07,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:19:07,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602066715] [2024-06-20 19:19:07,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:19:07,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:19:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:19:12,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-20 19:19:12,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:19:12,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602066715] [2024-06-20 19:19:12,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602066715] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:19:12,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:19:12,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:19:12,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895755520] [2024-06-20 19:19:12,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:19:12,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:19:12,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:19:12,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:19:12,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:19:12,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:19:12,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 193 transitions, 1880 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:19:12,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:19:12,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:19:12,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:19:13,182 INFO L124 PetriNetUnfolderBase]: 523/947 cut-off events. [2024-06-20 19:19:13,182 INFO L125 PetriNetUnfolderBase]: For 78896/78896 co-relation queries the response was YES. [2024-06-20 19:19:13,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6009 conditions, 947 events. 523/947 cut-off events. For 78896/78896 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4711 event pairs, 83 based on Foata normal form. 2/949 useless extension candidates. Maximal degree in co-relation 5886. Up to 794 conditions per place. [2024-06-20 19:19:13,191 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 173 selfloop transitions, 40 changer transitions 0/215 dead transitions. [2024-06-20 19:19:13,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 215 transitions, 2386 flow [2024-06-20 19:19:13,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:19:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:19:13,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-20 19:19:13,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3489736070381232 [2024-06-20 19:19:13,193 INFO L175 Difference]: Start difference. First operand has 243 places, 193 transitions, 1880 flow. Second operand 11 states and 119 transitions. [2024-06-20 19:19:13,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 215 transitions, 2386 flow [2024-06-20 19:19:13,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 215 transitions, 2252 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-20 19:19:13,414 INFO L231 Difference]: Finished difference. Result has 244 places, 194 transitions, 1852 flow [2024-06-20 19:19:13,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1746, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1852, PETRI_PLACES=244, PETRI_TRANSITIONS=194} [2024-06-20 19:19:13,414 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places. [2024-06-20 19:19:13,415 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 194 transitions, 1852 flow [2024-06-20 19:19:13,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:19:13,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:19:13,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:19:13,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-20 19:19:13,415 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:19:13,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:19:13,416 INFO L85 PathProgramCache]: Analyzing trace with hash 434822457, now seen corresponding path program 9 times [2024-06-20 19:19:13,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:19:13,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726587380] [2024-06-20 19:19:13,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:19:13,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:19:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:19:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:19:19,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:19:19,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726587380] [2024-06-20 19:19:19,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726587380] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:19:19,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:19:19,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:19:19,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507561841] [2024-06-20 19:19:19,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:19:19,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:19:19,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:19:19,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:19:19,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:19:19,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:19:19,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 194 transitions, 1852 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:19:19,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:19:19,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:19:19,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:19:20,166 INFO L124 PetriNetUnfolderBase]: 527/955 cut-off events. [2024-06-20 19:19:20,166 INFO L125 PetriNetUnfolderBase]: For 80421/80421 co-relation queries the response was YES. [2024-06-20 19:19:20,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6006 conditions, 955 events. 527/955 cut-off events. For 80421/80421 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4797 event pairs, 83 based on Foata normal form. 2/957 useless extension candidates. Maximal degree in co-relation 5882. Up to 788 conditions per place. [2024-06-20 19:19:20,176 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 173 selfloop transitions, 41 changer transitions 0/216 dead transitions. [2024-06-20 19:19:20,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 216 transitions, 2360 flow [2024-06-20 19:19:20,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:19:20,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:19:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-20 19:19:20,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3519061583577713 [2024-06-20 19:19:20,177 INFO L175 Difference]: Start difference. First operand has 244 places, 194 transitions, 1852 flow. Second operand 11 states and 120 transitions. [2024-06-20 19:19:20,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 216 transitions, 2360 flow [2024-06-20 19:19:20,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 216 transitions, 2264 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-20 19:19:20,405 INFO L231 Difference]: Finished difference. Result has 246 places, 195 transitions, 1866 flow [2024-06-20 19:19:20,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1756, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1866, PETRI_PLACES=246, PETRI_TRANSITIONS=195} [2024-06-20 19:19:20,406 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 216 predicate places. [2024-06-20 19:19:20,406 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 195 transitions, 1866 flow [2024-06-20 19:19:20,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:19:20,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:19:20,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:19:20,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-20 19:19:20,407 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:19:20,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:19:20,407 INFO L85 PathProgramCache]: Analyzing trace with hash -150948269, now seen corresponding path program 10 times [2024-06-20 19:19:20,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:19:20,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953133834] [2024-06-20 19:19:20,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:19:20,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:19:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:19:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:19:26,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:19:26,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953133834] [2024-06-20 19:19:26,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953133834] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:19:26,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:19:26,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:19:26,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316324486] [2024-06-20 19:19:26,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:19:26,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:19:26,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:19:26,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:19:26,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:19:26,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:19:26,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 195 transitions, 1866 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:19:26,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:19:26,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:19:26,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:19:26,762 INFO L124 PetriNetUnfolderBase]: 531/963 cut-off events. [2024-06-20 19:19:26,762 INFO L125 PetriNetUnfolderBase]: For 82436/82436 co-relation queries the response was YES. [2024-06-20 19:19:26,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6065 conditions, 963 events. 531/963 cut-off events. For 82436/82436 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4836 event pairs, 85 based on Foata normal form. 2/965 useless extension candidates. Maximal degree in co-relation 5940. Up to 748 conditions per place. [2024-06-20 19:19:26,772 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 170 selfloop transitions, 45 changer transitions 0/217 dead transitions. [2024-06-20 19:19:26,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 217 transitions, 2376 flow [2024-06-20 19:19:26,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:19:26,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:19:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-20 19:19:26,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3489736070381232 [2024-06-20 19:19:26,773 INFO L175 Difference]: Start difference. First operand has 246 places, 195 transitions, 1866 flow. Second operand 11 states and 119 transitions. [2024-06-20 19:19:26,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 217 transitions, 2376 flow [2024-06-20 19:19:27,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 217 transitions, 2276 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-20 19:19:27,007 INFO L231 Difference]: Finished difference. Result has 248 places, 196 transitions, 1886 flow [2024-06-20 19:19:27,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1766, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1886, PETRI_PLACES=248, PETRI_TRANSITIONS=196} [2024-06-20 19:19:27,008 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2024-06-20 19:19:27,008 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 196 transitions, 1886 flow [2024-06-20 19:19:27,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:19:27,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:19:27,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:19:27,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-20 19:19:27,009 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:19:27,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:19:27,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1934614941, now seen corresponding path program 11 times [2024-06-20 19:19:27,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:19:27,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62881699] [2024-06-20 19:19:27,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:19:27,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:19:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:19:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:19:32,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:19:32,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62881699] [2024-06-20 19:19:32,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62881699] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:19:32,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:19:32,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:19:32,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20303842] [2024-06-20 19:19:32,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:19:32,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:19:32,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:19:32,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:19:32,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:19:32,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:19:32,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 196 transitions, 1886 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:19:32,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:19:32,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:19:32,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:19:33,056 INFO L124 PetriNetUnfolderBase]: 535/972 cut-off events. [2024-06-20 19:19:33,057 INFO L125 PetriNetUnfolderBase]: For 84407/84409 co-relation queries the response was YES. [2024-06-20 19:19:33,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6139 conditions, 972 events. 535/972 cut-off events. For 84407/84409 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4908 event pairs, 70 based on Foata normal form. 4/976 useless extension candidates. Maximal degree in co-relation 6013. Up to 723 conditions per place. [2024-06-20 19:19:33,066 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 153 selfloop transitions, 62 changer transitions 0/217 dead transitions. [2024-06-20 19:19:33,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 217 transitions, 2400 flow [2024-06-20 19:19:33,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:19:33,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:19:33,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2024-06-20 19:19:33,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36070381231671556 [2024-06-20 19:19:33,068 INFO L175 Difference]: Start difference. First operand has 248 places, 196 transitions, 1886 flow. Second operand 11 states and 123 transitions. [2024-06-20 19:19:33,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 217 transitions, 2400 flow [2024-06-20 19:19:33,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 217 transitions, 2290 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-20 19:19:33,315 INFO L231 Difference]: Finished difference. Result has 250 places, 197 transitions, 1932 flow [2024-06-20 19:19:33,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1776, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1932, PETRI_PLACES=250, PETRI_TRANSITIONS=197} [2024-06-20 19:19:33,315 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 220 predicate places. [2024-06-20 19:19:33,316 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 197 transitions, 1932 flow [2024-06-20 19:19:33,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:19:33,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:19:33,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:19:33,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-20 19:19:33,316 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:19:33,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:19:33,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1934619591, now seen corresponding path program 12 times [2024-06-20 19:19:33,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:19:33,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357652398] [2024-06-20 19:19:33,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:19:33,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:19:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:19:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:19:39,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:19:39,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357652398] [2024-06-20 19:19:39,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357652398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:19:39,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:19:39,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:19:39,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149007041] [2024-06-20 19:19:39,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:19:39,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:19:39,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:19:39,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:19:39,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:19:39,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:19:39,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 197 transitions, 1932 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:19:39,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:19:39,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:19:39,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:19:40,057 INFO L124 PetriNetUnfolderBase]: 546/993 cut-off events. [2024-06-20 19:19:40,057 INFO L125 PetriNetUnfolderBase]: For 95320/95322 co-relation queries the response was YES. [2024-06-20 19:19:40,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6517 conditions, 993 events. 546/993 cut-off events. For 95320/95322 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5073 event pairs, 71 based on Foata normal form. 4/997 useless extension candidates. Maximal degree in co-relation 6390. Up to 721 conditions per place. [2024-06-20 19:19:40,068 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 154 selfloop transitions, 64 changer transitions 0/220 dead transitions. [2024-06-20 19:19:40,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 220 transitions, 2666 flow [2024-06-20 19:19:40,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:19:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:19:40,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-20 19:19:40,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-20 19:19:40,069 INFO L175 Difference]: Start difference. First operand has 250 places, 197 transitions, 1932 flow. Second operand 11 states and 124 transitions. [2024-06-20 19:19:40,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 220 transitions, 2666 flow [2024-06-20 19:19:40,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 220 transitions, 2520 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-20 19:19:40,312 INFO L231 Difference]: Finished difference. Result has 252 places, 199 transitions, 1976 flow [2024-06-20 19:19:40,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1786, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1976, PETRI_PLACES=252, PETRI_TRANSITIONS=199} [2024-06-20 19:19:40,313 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 222 predicate places. [2024-06-20 19:19:40,313 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 199 transitions, 1976 flow [2024-06-20 19:19:40,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:19:40,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:19:40,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:19:40,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-20 19:19:40,322 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:19:40,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:19:40,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2105317371, now seen corresponding path program 13 times [2024-06-20 19:19:40,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:19:40,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580730616] [2024-06-20 19:19:40,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:19:40,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:19:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:19:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:19:46,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:19:46,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580730616] [2024-06-20 19:19:46,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580730616] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:19:46,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:19:46,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:19:46,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128107145] [2024-06-20 19:19:46,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:19:46,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:19:46,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:19:46,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:19:46,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:19:46,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:19:46,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 199 transitions, 1976 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:19:46,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:19:46,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:19:46,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:19:46,986 INFO L124 PetriNetUnfolderBase]: 550/1001 cut-off events. [2024-06-20 19:19:46,987 INFO L125 PetriNetUnfolderBase]: For 97580/97582 co-relation queries the response was YES. [2024-06-20 19:19:46,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6584 conditions, 1001 events. 550/1001 cut-off events. For 97580/97582 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5129 event pairs, 73 based on Foata normal form. 4/1005 useless extension candidates. Maximal degree in co-relation 6456. Up to 752 conditions per place. [2024-06-20 19:19:46,996 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 152 selfloop transitions, 65 changer transitions 0/219 dead transitions. [2024-06-20 19:19:46,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 219 transitions, 2494 flow [2024-06-20 19:19:46,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:19:46,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:19:46,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-20 19:19:46,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3519061583577713 [2024-06-20 19:19:46,998 INFO L175 Difference]: Start difference. First operand has 252 places, 199 transitions, 1976 flow. Second operand 11 states and 120 transitions. [2024-06-20 19:19:46,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 219 transitions, 2494 flow [2024-06-20 19:19:47,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 219 transitions, 2383 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-20 19:19:47,237 INFO L231 Difference]: Finished difference. Result has 256 places, 200 transitions, 2031 flow [2024-06-20 19:19:47,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1865, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2031, PETRI_PLACES=256, PETRI_TRANSITIONS=200} [2024-06-20 19:19:47,238 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 226 predicate places. [2024-06-20 19:19:47,238 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 200 transitions, 2031 flow [2024-06-20 19:19:47,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:19:47,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:19:47,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:19:47,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-20 19:19:47,239 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:19:47,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:19:47,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1698035717, now seen corresponding path program 14 times [2024-06-20 19:19:47,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:19:47,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078450248] [2024-06-20 19:19:47,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:19:47,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:19:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:19:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:19:53,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:19:53,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078450248] [2024-06-20 19:19:53,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078450248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:19:53,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:19:53,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:19:53,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556739214] [2024-06-20 19:19:53,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:19:53,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:19:53,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:19:53,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:19:53,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:19:53,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:19:53,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 200 transitions, 2031 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-20 19:19:53,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:19:53,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:19:53,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:19:53,756 INFO L124 PetriNetUnfolderBase]: 554/1009 cut-off events. [2024-06-20 19:19:53,757 INFO L125 PetriNetUnfolderBase]: For 99614/99616 co-relation queries the response was YES. [2024-06-20 19:19:53,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6738 conditions, 1009 events. 554/1009 cut-off events. For 99614/99616 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5174 event pairs, 63 based on Foata normal form. 4/1013 useless extension candidates. Maximal degree in co-relation 6608. Up to 760 conditions per place. [2024-06-20 19:19:53,767 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 142 selfloop transitions, 76 changer transitions 0/220 dead transitions. [2024-06-20 19:19:53,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 220 transitions, 2553 flow [2024-06-20 19:19:53,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:19:53,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:19:53,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-20 19:19:53,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3460410557184751 [2024-06-20 19:19:53,769 INFO L175 Difference]: Start difference. First operand has 256 places, 200 transitions, 2031 flow. Second operand 11 states and 118 transitions. [2024-06-20 19:19:53,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 220 transitions, 2553 flow [2024-06-20 19:19:54,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 220 transitions, 2397 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-20 19:19:54,021 INFO L231 Difference]: Finished difference. Result has 258 places, 201 transitions, 2065 flow [2024-06-20 19:19:54,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1875, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2065, PETRI_PLACES=258, PETRI_TRANSITIONS=201} [2024-06-20 19:19:54,021 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 228 predicate places. [2024-06-20 19:19:54,022 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 201 transitions, 2065 flow [2024-06-20 19:19:54,022 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-20 19:19:54,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:19:54,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:19:54,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-20 19:19:54,022 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:19:54,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:19:54,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1993857371, now seen corresponding path program 2 times [2024-06-20 19:19:54,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:19:54,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229543406] [2024-06-20 19:19:54,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:19:54,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:19:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:20:00,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:20:00,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:20:00,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229543406] [2024-06-20 19:20:00,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229543406] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:20:00,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:20:00,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:20:00,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851614720] [2024-06-20 19:20:00,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:20:00,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:20:00,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:20:00,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:20:00,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:20:00,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:20:00,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 201 transitions, 2065 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:00,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:20:00,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:20:00,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:20:00,819 INFO L124 PetriNetUnfolderBase]: 594/1088 cut-off events. [2024-06-20 19:20:00,820 INFO L125 PetriNetUnfolderBase]: For 154717/154717 co-relation queries the response was YES. [2024-06-20 19:20:00,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8258 conditions, 1088 events. 594/1088 cut-off events. For 154717/154717 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5597 event pairs, 120 based on Foata normal form. 2/1090 useless extension candidates. Maximal degree in co-relation 8127. Up to 948 conditions per place. [2024-06-20 19:20:00,831 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 200 selfloop transitions, 23 changer transitions 0/225 dead transitions. [2024-06-20 19:20:00,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 225 transitions, 3025 flow [2024-06-20 19:20:00,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:20:00,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:20:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2024-06-20 19:20:00,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3279569892473118 [2024-06-20 19:20:00,833 INFO L175 Difference]: Start difference. First operand has 258 places, 201 transitions, 2065 flow. Second operand 12 states and 122 transitions. [2024-06-20 19:20:00,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 225 transitions, 3025 flow [2024-06-20 19:20:01,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 225 transitions, 2845 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-20 19:20:01,267 INFO L231 Difference]: Finished difference. Result has 261 places, 203 transitions, 1997 flow [2024-06-20 19:20:01,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1997, PETRI_PLACES=261, PETRI_TRANSITIONS=203} [2024-06-20 19:20:01,267 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 231 predicate places. [2024-06-20 19:20:01,267 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 203 transitions, 1997 flow [2024-06-20 19:20:01,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:01,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:20:01,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:20:01,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-20 19:20:01,268 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:20:01,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:20:01,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1567982527, now seen corresponding path program 15 times [2024-06-20 19:20:01,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:20:01,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645165281] [2024-06-20 19:20:01,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:20:01,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:20:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:20:07,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-20 19:20:07,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:20:07,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645165281] [2024-06-20 19:20:07,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645165281] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:20:07,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:20:07,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:20:07,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197593627] [2024-06-20 19:20:07,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:20:07,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:20:07,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:20:07,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:20:07,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:20:07,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:20:07,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 203 transitions, 1997 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:07,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:20:07,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:20:07,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:20:07,694 INFO L124 PetriNetUnfolderBase]: 598/1097 cut-off events. [2024-06-20 19:20:07,694 INFO L125 PetriNetUnfolderBase]: For 157910/157912 co-relation queries the response was YES. [2024-06-20 19:20:07,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8186 conditions, 1097 events. 598/1097 cut-off events. For 157910/157912 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5699 event pairs, 100 based on Foata normal form. 4/1101 useless extension candidates. Maximal degree in co-relation 8054. Up to 834 conditions per place. [2024-06-20 19:20:07,706 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 155 selfloop transitions, 66 changer transitions 0/223 dead transitions. [2024-06-20 19:20:07,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 223 transitions, 2525 flow [2024-06-20 19:20:07,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:20:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:20:07,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-20 19:20:07,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:20:07,707 INFO L175 Difference]: Start difference. First operand has 261 places, 203 transitions, 1997 flow. Second operand 11 states and 121 transitions. [2024-06-20 19:20:07,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 223 transitions, 2525 flow [2024-06-20 19:20:08,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 223 transitions, 2458 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-20 19:20:08,116 INFO L231 Difference]: Finished difference. Result has 265 places, 204 transitions, 2102 flow [2024-06-20 19:20:08,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2102, PETRI_PLACES=265, PETRI_TRANSITIONS=204} [2024-06-20 19:20:08,117 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 235 predicate places. [2024-06-20 19:20:08,117 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 204 transitions, 2102 flow [2024-06-20 19:20:08,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:08,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:20:08,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:20:08,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-20 19:20:08,118 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:20:08,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:20:08,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1928185851, now seen corresponding path program 16 times [2024-06-20 19:20:08,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:20:08,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231201092] [2024-06-20 19:20:08,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:20:08,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:20:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:20:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:20:14,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:20:14,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231201092] [2024-06-20 19:20:14,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231201092] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:20:14,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:20:14,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:20:14,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508958564] [2024-06-20 19:20:14,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:20:14,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:20:14,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:20:14,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:20:14,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:20:14,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:20:14,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 204 transitions, 2102 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-20 19:20:14,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:20:14,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:20:14,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:20:14,555 INFO L124 PetriNetUnfolderBase]: 595/1092 cut-off events. [2024-06-20 19:20:14,555 INFO L125 PetriNetUnfolderBase]: For 151511/151513 co-relation queries the response was YES. [2024-06-20 19:20:14,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8063 conditions, 1092 events. 595/1092 cut-off events. For 151511/151513 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5697 event pairs, 97 based on Foata normal form. 4/1096 useless extension candidates. Maximal degree in co-relation 7929. Up to 843 conditions per place. [2024-06-20 19:20:14,567 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 159 selfloop transitions, 63 changer transitions 0/224 dead transitions. [2024-06-20 19:20:14,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 224 transitions, 2604 flow [2024-06-20 19:20:14,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:20:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:20:14,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2024-06-20 19:20:14,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35777126099706746 [2024-06-20 19:20:14,568 INFO L175 Difference]: Start difference. First operand has 265 places, 204 transitions, 2102 flow. Second operand 11 states and 122 transitions. [2024-06-20 19:20:14,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 224 transitions, 2604 flow [2024-06-20 19:20:14,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 224 transitions, 2426 flow, removed 24 selfloop flow, removed 9 redundant places. [2024-06-20 19:20:14,981 INFO L231 Difference]: Finished difference. Result has 267 places, 204 transitions, 2054 flow [2024-06-20 19:20:14,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1924, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2054, PETRI_PLACES=267, PETRI_TRANSITIONS=204} [2024-06-20 19:20:14,982 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 237 predicate places. [2024-06-20 19:20:14,982 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 204 transitions, 2054 flow [2024-06-20 19:20:14,982 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-20 19:20:14,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:20:14,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:20:14,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-20 19:20:14,982 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:20:14,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:20:14,983 INFO L85 PathProgramCache]: Analyzing trace with hash 319878967, now seen corresponding path program 17 times [2024-06-20 19:20:14,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:20:14,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084170671] [2024-06-20 19:20:14,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:20:14,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:20:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:20:20,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:20:20,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:20:20,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084170671] [2024-06-20 19:20:20,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084170671] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:20:20,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:20:20,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:20:20,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104611946] [2024-06-20 19:20:20,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:20:20,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:20:20,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:20:20,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:20:20,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:20:20,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:20:20,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 204 transitions, 2054 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:20,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:20:20,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:20:20,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:20:21,224 INFO L124 PetriNetUnfolderBase]: 599/1100 cut-off events. [2024-06-20 19:20:21,224 INFO L125 PetriNetUnfolderBase]: For 154371/154373 co-relation queries the response was YES. [2024-06-20 19:20:21,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8084 conditions, 1100 events. 599/1100 cut-off events. For 154371/154373 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5709 event pairs, 91 based on Foata normal form. 4/1104 useless extension candidates. Maximal degree in co-relation 7949. Up to 851 conditions per place. [2024-06-20 19:20:21,237 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 153 selfloop transitions, 69 changer transitions 0/224 dead transitions. [2024-06-20 19:20:21,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 224 transitions, 2588 flow [2024-06-20 19:20:21,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:20:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:20:21,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-20 19:20:21,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3489736070381232 [2024-06-20 19:20:21,238 INFO L175 Difference]: Start difference. First operand has 267 places, 204 transitions, 2054 flow. Second operand 11 states and 119 transitions. [2024-06-20 19:20:21,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 224 transitions, 2588 flow [2024-06-20 19:20:21,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 224 transitions, 2456 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-20 19:20:21,673 INFO L231 Difference]: Finished difference. Result has 268 places, 205 transitions, 2102 flow [2024-06-20 19:20:21,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1922, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2102, PETRI_PLACES=268, PETRI_TRANSITIONS=205} [2024-06-20 19:20:21,674 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 238 predicate places. [2024-06-20 19:20:21,674 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 205 transitions, 2102 flow [2024-06-20 19:20:21,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:21,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:20:21,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:20:21,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-20 19:20:21,674 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:20:21,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:20:21,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1927939587, now seen corresponding path program 3 times [2024-06-20 19:20:21,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:20:21,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440554992] [2024-06-20 19:20:21,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:20:21,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:20:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:20:27,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:20:27,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:20:27,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440554992] [2024-06-20 19:20:27,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440554992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:20:27,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:20:27,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:20:27,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900675686] [2024-06-20 19:20:27,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:20:27,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:20:27,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:20:27,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:20:27,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:20:27,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:20:27,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 205 transitions, 2102 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:27,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:20:27,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:20:27,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:20:28,072 INFO L124 PetriNetUnfolderBase]: 619/1144 cut-off events. [2024-06-20 19:20:28,072 INFO L125 PetriNetUnfolderBase]: For 206348/206350 co-relation queries the response was YES. [2024-06-20 19:20:28,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8325 conditions, 1144 events. 619/1144 cut-off events. For 206348/206350 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 6027 event pairs, 108 based on Foata normal form. 14/1158 useless extension candidates. Maximal degree in co-relation 8189. Up to 699 conditions per place. [2024-06-20 19:20:28,084 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 139 selfloop transitions, 81 changer transitions 10/232 dead transitions. [2024-06-20 19:20:28,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 232 transitions, 2688 flow [2024-06-20 19:20:28,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:20:28,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:20:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 139 transitions. [2024-06-20 19:20:28,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3736559139784946 [2024-06-20 19:20:28,085 INFO L175 Difference]: Start difference. First operand has 268 places, 205 transitions, 2102 flow. Second operand 12 states and 139 transitions. [2024-06-20 19:20:28,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 232 transitions, 2688 flow [2024-06-20 19:20:28,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 232 transitions, 2518 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-20 19:20:28,508 INFO L231 Difference]: Finished difference. Result has 271 places, 201 transitions, 2087 flow [2024-06-20 19:20:28,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1932, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2087, PETRI_PLACES=271, PETRI_TRANSITIONS=201} [2024-06-20 19:20:28,509 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 241 predicate places. [2024-06-20 19:20:28,509 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 201 transitions, 2087 flow [2024-06-20 19:20:28,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:28,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:20:28,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:20:28,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-20 19:20:28,509 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:20:28,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:20:28,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1568097847, now seen corresponding path program 18 times [2024-06-20 19:20:28,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:20:28,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071686996] [2024-06-20 19:20:28,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:20:28,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:20:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:20:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:20:34,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:20:34,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071686996] [2024-06-20 19:20:34,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071686996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:20:34,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:20:34,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:20:34,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197363740] [2024-06-20 19:20:34,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:20:34,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:20:34,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:20:34,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:20:34,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:20:34,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:20:34,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 201 transitions, 2087 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:34,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:20:34,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:20:34,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:20:34,917 INFO L124 PetriNetUnfolderBase]: 585/1090 cut-off events. [2024-06-20 19:20:34,917 INFO L125 PetriNetUnfolderBase]: For 161209/161211 co-relation queries the response was YES. [2024-06-20 19:20:34,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8154 conditions, 1090 events. 585/1090 cut-off events. For 161209/161211 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5768 event pairs, 103 based on Foata normal form. 4/1094 useless extension candidates. Maximal degree in co-relation 8017. Up to 748 conditions per place. [2024-06-20 19:20:34,929 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 147 selfloop transitions, 73 changer transitions 0/222 dead transitions. [2024-06-20 19:20:34,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 222 transitions, 2817 flow [2024-06-20 19:20:34,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:20:34,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:20:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-20 19:20:34,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:20:34,930 INFO L175 Difference]: Start difference. First operand has 271 places, 201 transitions, 2087 flow. Second operand 11 states and 121 transitions. [2024-06-20 19:20:34,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 222 transitions, 2817 flow [2024-06-20 19:20:35,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 222 transitions, 2627 flow, removed 15 selfloop flow, removed 10 redundant places. [2024-06-20 19:20:35,442 INFO L231 Difference]: Finished difference. Result has 272 places, 202 transitions, 2085 flow [2024-06-20 19:20:35,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2085, PETRI_PLACES=272, PETRI_TRANSITIONS=202} [2024-06-20 19:20:35,443 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 242 predicate places. [2024-06-20 19:20:35,443 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 202 transitions, 2085 flow [2024-06-20 19:20:35,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:35,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:20:35,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:20:35,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-20 19:20:35,444 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:20:35,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:20:35,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1964946537, now seen corresponding path program 19 times [2024-06-20 19:20:35,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:20:35,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010794558] [2024-06-20 19:20:35,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:20:35,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:20:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:20:41,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:20:41,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:20:41,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010794558] [2024-06-20 19:20:41,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010794558] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:20:41,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:20:41,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:20:41,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351136284] [2024-06-20 19:20:41,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:20:41,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:20:41,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:20:41,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:20:41,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:20:41,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:20:41,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 202 transitions, 2085 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:41,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:20:41,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:20:41,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:20:42,135 INFO L124 PetriNetUnfolderBase]: 589/1098 cut-off events. [2024-06-20 19:20:42,135 INFO L125 PetriNetUnfolderBase]: For 164762/164764 co-relation queries the response was YES. [2024-06-20 19:20:42,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8225 conditions, 1098 events. 589/1098 cut-off events. For 164762/164764 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5846 event pairs, 95 based on Foata normal form. 4/1102 useless extension candidates. Maximal degree in co-relation 8087. Up to 820 conditions per place. [2024-06-20 19:20:42,147 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 149 selfloop transitions, 72 changer transitions 0/223 dead transitions. [2024-06-20 19:20:42,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 223 transitions, 2823 flow [2024-06-20 19:20:42,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:20:42,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:20:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-20 19:20:42,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3519061583577713 [2024-06-20 19:20:42,152 INFO L175 Difference]: Start difference. First operand has 272 places, 202 transitions, 2085 flow. Second operand 11 states and 120 transitions. [2024-06-20 19:20:42,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 223 transitions, 2823 flow [2024-06-20 19:20:42,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 223 transitions, 2607 flow, removed 26 selfloop flow, removed 10 redundant places. [2024-06-20 19:20:42,591 INFO L231 Difference]: Finished difference. Result has 273 places, 203 transitions, 2057 flow [2024-06-20 19:20:42,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1878, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2057, PETRI_PLACES=273, PETRI_TRANSITIONS=203} [2024-06-20 19:20:42,591 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 243 predicate places. [2024-06-20 19:20:42,591 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 203 transitions, 2057 flow [2024-06-20 19:20:42,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:42,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:20:42,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:20:42,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-20 19:20:42,592 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:20:42,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:20:42,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1958266533, now seen corresponding path program 4 times [2024-06-20 19:20:42,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:20:42,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553116090] [2024-06-20 19:20:42,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:20:42,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:20:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:20:48,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:20:48,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:20:48,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553116090] [2024-06-20 19:20:48,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553116090] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:20:48,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:20:48,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:20:48,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271087232] [2024-06-20 19:20:48,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:20:48,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:20:48,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:20:48,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:20:48,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:20:48,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:20:48,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 203 transitions, 2057 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:48,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:20:48,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:20:48,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:20:48,835 INFO L124 PetriNetUnfolderBase]: 609/1142 cut-off events. [2024-06-20 19:20:48,835 INFO L125 PetriNetUnfolderBase]: For 218777/218779 co-relation queries the response was YES. [2024-06-20 19:20:48,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8256 conditions, 1142 events. 609/1142 cut-off events. For 218777/218779 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6112 event pairs, 98 based on Foata normal form. 14/1156 useless extension candidates. Maximal degree in co-relation 8119. Up to 701 conditions per place. [2024-06-20 19:20:48,847 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 137 selfloop transitions, 82 changer transitions 9/230 dead transitions. [2024-06-20 19:20:48,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 230 transitions, 2641 flow [2024-06-20 19:20:48,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:20:48,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:20:48,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2024-06-20 19:20:48,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-20 19:20:48,848 INFO L175 Difference]: Start difference. First operand has 273 places, 203 transitions, 2057 flow. Second operand 12 states and 138 transitions. [2024-06-20 19:20:48,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 230 transitions, 2641 flow [2024-06-20 19:20:49,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 230 transitions, 2346 flow, removed 19 selfloop flow, removed 12 redundant places. [2024-06-20 19:20:49,307 INFO L231 Difference]: Finished difference. Result has 273 places, 200 transitions, 1934 flow [2024-06-20 19:20:49,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1766, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1934, PETRI_PLACES=273, PETRI_TRANSITIONS=200} [2024-06-20 19:20:49,308 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 243 predicate places. [2024-06-20 19:20:49,308 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 200 transitions, 1934 flow [2024-06-20 19:20:49,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:20:49,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:20:49,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:20:49,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-20 19:20:49,309 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:20:49,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:20:49,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1958512797, now seen corresponding path program 20 times [2024-06-20 19:20:49,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:20:49,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462289450] [2024-06-20 19:20:49,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:20:49,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:20:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:20:55,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-20 19:20:55,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:20:55,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462289450] [2024-06-20 19:20:55,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462289450] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:20:55,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:20:55,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:20:55,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779362908] [2024-06-20 19:20:55,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:20:55,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:20:55,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:20:55,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:20:55,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:20:55,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:20:55,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 200 transitions, 1934 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-20 19:20:55,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:20:55,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:20:55,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:20:55,746 INFO L124 PetriNetUnfolderBase]: 572/1079 cut-off events. [2024-06-20 19:20:55,747 INFO L125 PetriNetUnfolderBase]: For 159496/159498 co-relation queries the response was YES. [2024-06-20 19:20:55,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7478 conditions, 1079 events. 572/1079 cut-off events. For 159496/159498 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5785 event pairs, 92 based on Foata normal form. 4/1083 useless extension candidates. Maximal degree in co-relation 7343. Up to 830 conditions per place. [2024-06-20 19:20:55,757 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 150 selfloop transitions, 68 changer transitions 0/220 dead transitions. [2024-06-20 19:20:55,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 220 transitions, 2428 flow [2024-06-20 19:20:55,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:20:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:20:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-20 19:20:55,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:20:55,759 INFO L175 Difference]: Start difference. First operand has 273 places, 200 transitions, 1934 flow. Second operand 11 states and 121 transitions. [2024-06-20 19:20:55,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 220 transitions, 2428 flow [2024-06-20 19:20:56,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 220 transitions, 2214 flow, removed 26 selfloop flow, removed 10 redundant places. [2024-06-20 19:20:56,108 INFO L231 Difference]: Finished difference. Result has 274 places, 200 transitions, 1860 flow [2024-06-20 19:20:56,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1720, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1860, PETRI_PLACES=274, PETRI_TRANSITIONS=200} [2024-06-20 19:20:56,109 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 244 predicate places. [2024-06-20 19:20:56,109 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 200 transitions, 1860 flow [2024-06-20 19:20:56,109 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-20 19:20:56,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:20:56,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:20:56,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-20 19:20:56,110 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-20 19:20:56,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:20:56,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1616882925, now seen corresponding path program 5 times [2024-06-20 19:20:56,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:20:56,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804788447] [2024-06-20 19:20:56,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:20:56,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:20:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:21:01,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:01,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804788447] [2024-06-20 19:21:01,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804788447] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:01,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:01,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:21:01,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852312358] [2024-06-20 19:21:01,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:01,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:21:01,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:01,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:21:01,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:21:02,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:21:02,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 200 transitions, 1860 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:02,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:02,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:21:02,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:02,541 INFO L124 PetriNetUnfolderBase]: 585/1110 cut-off events. [2024-06-20 19:21:02,541 INFO L125 PetriNetUnfolderBase]: For 204139/204141 co-relation queries the response was YES. [2024-06-20 19:21:02,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7253 conditions, 1110 events. 585/1110 cut-off events. For 204139/204141 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5979 event pairs, 88 based on Foata normal form. 14/1124 useless extension candidates. Maximal degree in co-relation 7117. Up to 673 conditions per place. [2024-06-20 19:21:02,552 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 129 selfloop transitions, 87 changer transitions 8/226 dead transitions. [2024-06-20 19:21:02,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 226 transitions, 2400 flow [2024-06-20 19:21:02,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:21:02,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:21:02,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2024-06-20 19:21:02,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3682795698924731 [2024-06-20 19:21:02,554 INFO L175 Difference]: Start difference. First operand has 274 places, 200 transitions, 1860 flow. Second operand 12 states and 137 transitions. [2024-06-20 19:21:02,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 226 transitions, 2400 flow [2024-06-20 19:21:02,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 226 transitions, 2197 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-20 19:21:02,900 INFO L231 Difference]: Finished difference. Result has 275 places, 197 transitions, 1810 flow [2024-06-20 19:21:02,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1657, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1810, PETRI_PLACES=275, PETRI_TRANSITIONS=197} [2024-06-20 19:21:02,901 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 245 predicate places. [2024-06-20 19:21:02,901 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 197 transitions, 1810 flow [2024-06-20 19:21:02,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:02,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:02,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:02,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-20 19:21:02,902 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-20 19:21:02,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:02,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1993501181, now seen corresponding path program 6 times [2024-06-20 19:21:02,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:02,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687973208] [2024-06-20 19:21:02,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:02,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:08,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:21:08,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:08,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687973208] [2024-06-20 19:21:08,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687973208] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:08,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:08,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:21:08,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542046418] [2024-06-20 19:21:08,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:08,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:21:08,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:08,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:21:08,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:21:09,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:21:09,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 197 transitions, 1810 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:09,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:09,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:21:09,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:09,550 INFO L124 PetriNetUnfolderBase]: 562/1068 cut-off events. [2024-06-20 19:21:09,551 INFO L125 PetriNetUnfolderBase]: For 154080/154080 co-relation queries the response was YES. [2024-06-20 19:21:09,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7101 conditions, 1068 events. 562/1068 cut-off events. For 154080/154080 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5779 event pairs, 113 based on Foata normal form. 2/1070 useless extension candidates. Maximal degree in co-relation 6964. Up to 1012 conditions per place. [2024-06-20 19:21:09,562 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 190 selfloop transitions, 24 changer transitions 0/216 dead transitions. [2024-06-20 19:21:09,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 216 transitions, 2525 flow [2024-06-20 19:21:09,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:21:09,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:21:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2024-06-20 19:21:09,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31451612903225806 [2024-06-20 19:21:09,563 INFO L175 Difference]: Start difference. First operand has 275 places, 197 transitions, 1810 flow. Second operand 12 states and 117 transitions. [2024-06-20 19:21:09,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 216 transitions, 2525 flow [2024-06-20 19:21:09,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 216 transitions, 2269 flow, removed 16 selfloop flow, removed 15 redundant places. [2024-06-20 19:21:09,886 INFO L231 Difference]: Finished difference. Result has 272 places, 200 transitions, 1645 flow [2024-06-20 19:21:09,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1645, PETRI_PLACES=272, PETRI_TRANSITIONS=200} [2024-06-20 19:21:09,886 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 242 predicate places. [2024-06-20 19:21:09,886 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 200 transitions, 1645 flow [2024-06-20 19:21:09,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:09,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:09,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:09,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-20 19:21:09,887 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-20 19:21:09,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:09,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1706316871, now seen corresponding path program 1 times [2024-06-20 19:21:09,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:09,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106446443] [2024-06-20 19:21:09,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:09,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:21:15,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:15,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106446443] [2024-06-20 19:21:15,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106446443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:15,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:15,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:21:15,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011482824] [2024-06-20 19:21:15,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:15,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:21:15,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:15,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:21:15,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:21:15,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:21:15,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 200 transitions, 1645 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-20 19:21:15,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:15,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:21:15,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:16,259 INFO L124 PetriNetUnfolderBase]: 558/1062 cut-off events. [2024-06-20 19:21:16,260 INFO L125 PetriNetUnfolderBase]: For 144889/144889 co-relation queries the response was YES. [2024-06-20 19:21:16,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6588 conditions, 1062 events. 558/1062 cut-off events. For 144889/144889 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5722 event pairs, 121 based on Foata normal form. 2/1064 useless extension candidates. Maximal degree in co-relation 6455. Up to 1021 conditions per place. [2024-06-20 19:21:16,271 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 191 selfloop transitions, 19 changer transitions 0/212 dead transitions. [2024-06-20 19:21:16,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 212 transitions, 2097 flow [2024-06-20 19:21:16,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:21:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:21:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2024-06-20 19:21:16,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3193548387096774 [2024-06-20 19:21:16,272 INFO L175 Difference]: Start difference. First operand has 272 places, 200 transitions, 1645 flow. Second operand 10 states and 99 transitions. [2024-06-20 19:21:16,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 212 transitions, 2097 flow [2024-06-20 19:21:16,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 212 transitions, 1998 flow, removed 16 selfloop flow, removed 10 redundant places. [2024-06-20 19:21:16,681 INFO L231 Difference]: Finished difference. Result has 272 places, 200 transitions, 1592 flow [2024-06-20 19:21:16,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1592, PETRI_PLACES=272, PETRI_TRANSITIONS=200} [2024-06-20 19:21:16,682 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 242 predicate places. [2024-06-20 19:21:16,682 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 200 transitions, 1592 flow [2024-06-20 19:21:16,683 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-20 19:21:16,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:16,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:16,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-20 19:21:16,683 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-20 19:21:16,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:16,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1728577923, now seen corresponding path program 7 times [2024-06-20 19:21:16,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:16,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782468979] [2024-06-20 19:21:16,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:16,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:23,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:21:23,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:23,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782468979] [2024-06-20 19:21:23,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782468979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:23,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:23,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:21:23,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196337511] [2024-06-20 19:21:23,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:23,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:21:23,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:23,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:21:23,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:21:23,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:21:23,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 200 transitions, 1592 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:23,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:23,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:21:23,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:23,850 INFO L124 PetriNetUnfolderBase]: 542/1034 cut-off events. [2024-06-20 19:21:23,850 INFO L125 PetriNetUnfolderBase]: For 136243/136243 co-relation queries the response was YES. [2024-06-20 19:21:23,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5134 conditions, 1034 events. 542/1034 cut-off events. For 136243/136243 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5581 event pairs, 107 based on Foata normal form. 12/1046 useless extension candidates. Maximal degree in co-relation 5001. Up to 945 conditions per place. [2024-06-20 19:21:23,861 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 191 selfloop transitions, 17 changer transitions 8/218 dead transitions. [2024-06-20 19:21:23,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 218 transitions, 2088 flow [2024-06-20 19:21:23,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:21:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:21:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2024-06-20 19:21:23,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3255131964809384 [2024-06-20 19:21:23,863 INFO L175 Difference]: Start difference. First operand has 272 places, 200 transitions, 1592 flow. Second operand 11 states and 111 transitions. [2024-06-20 19:21:23,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 218 transitions, 2088 flow [2024-06-20 19:21:24,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 218 transitions, 2021 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-20 19:21:24,117 INFO L231 Difference]: Finished difference. Result has 273 places, 197 transitions, 1540 flow [2024-06-20 19:21:24,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1525, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1540, PETRI_PLACES=273, PETRI_TRANSITIONS=197} [2024-06-20 19:21:24,118 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 243 predicate places. [2024-06-20 19:21:24,118 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 197 transitions, 1540 flow [2024-06-20 19:21:24,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:24,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:24,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:24,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-20 19:21:24,118 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-20 19:21:24,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:24,119 INFO L85 PathProgramCache]: Analyzing trace with hash -969031769, now seen corresponding path program 1 times [2024-06-20 19:21:24,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:24,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074973442] [2024-06-20 19:21:24,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:24,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:30,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-20 19:21:30,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:30,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074973442] [2024-06-20 19:21:30,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074973442] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:30,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:30,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:21:30,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084439429] [2024-06-20 19:21:30,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:30,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:21:30,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:30,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:21:30,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:21:30,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:21:30,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 197 transitions, 1540 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:30,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:30,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:21:30,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:30,687 INFO L124 PetriNetUnfolderBase]: 520/992 cut-off events. [2024-06-20 19:21:30,687 INFO L125 PetriNetUnfolderBase]: For 81541/81541 co-relation queries the response was YES. [2024-06-20 19:21:30,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4975 conditions, 992 events. 520/992 cut-off events. For 81541/81541 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5395 event pairs, 77 based on Foata normal form. 2/994 useless extension candidates. Maximal degree in co-relation 4841. Up to 891 conditions per place. [2024-06-20 19:21:30,697 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 198 selfloop transitions, 19 changer transitions 0/219 dead transitions. [2024-06-20 19:21:30,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 219 transitions, 2046 flow [2024-06-20 19:21:30,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:21:30,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:21:30,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2024-06-20 19:21:30,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3196480938416422 [2024-06-20 19:21:30,699 INFO L175 Difference]: Start difference. First operand has 273 places, 197 transitions, 1540 flow. Second operand 11 states and 109 transitions. [2024-06-20 19:21:30,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 219 transitions, 2046 flow [2024-06-20 19:21:30,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 219 transitions, 1959 flow, removed 2 selfloop flow, removed 13 redundant places. [2024-06-20 19:21:30,971 INFO L231 Difference]: Finished difference. Result has 271 places, 198 transitions, 1517 flow [2024-06-20 19:21:30,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1517, PETRI_PLACES=271, PETRI_TRANSITIONS=198} [2024-06-20 19:21:30,972 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 241 predicate places. [2024-06-20 19:21:30,972 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 198 transitions, 1517 flow [2024-06-20 19:21:30,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:30,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:30,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:30,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-20 19:21:30,973 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-20 19:21:30,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:30,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1111976709, now seen corresponding path program 2 times [2024-06-20 19:21:30,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:30,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282897006] [2024-06-20 19:21:30,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:30,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:36,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:21:36,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:36,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282897006] [2024-06-20 19:21:36,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282897006] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:36,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:36,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:21:36,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819753160] [2024-06-20 19:21:36,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:36,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:21:36,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:36,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:21:36,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:21:36,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:21:36,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 198 transitions, 1517 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:36,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:36,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:21:36,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:36,938 INFO L124 PetriNetUnfolderBase]: 524/1000 cut-off events. [2024-06-20 19:21:36,938 INFO L125 PetriNetUnfolderBase]: For 81507/81507 co-relation queries the response was YES. [2024-06-20 19:21:36,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5026 conditions, 1000 events. 524/1000 cut-off events. For 81507/81507 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5431 event pairs, 90 based on Foata normal form. 2/1002 useless extension candidates. Maximal degree in co-relation 4892. Up to 887 conditions per place. [2024-06-20 19:21:36,949 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 185 selfloop transitions, 33 changer transitions 0/220 dead transitions. [2024-06-20 19:21:36,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 220 transitions, 2035 flow [2024-06-20 19:21:36,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:21:36,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:21:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2024-06-20 19:21:36,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3313782991202346 [2024-06-20 19:21:36,950 INFO L175 Difference]: Start difference. First operand has 271 places, 198 transitions, 1517 flow. Second operand 11 states and 113 transitions. [2024-06-20 19:21:36,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 220 transitions, 2035 flow [2024-06-20 19:21:37,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 220 transitions, 1981 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-20 19:21:37,259 INFO L231 Difference]: Finished difference. Result has 273 places, 199 transitions, 1558 flow [2024-06-20 19:21:37,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1558, PETRI_PLACES=273, PETRI_TRANSITIONS=199} [2024-06-20 19:21:37,259 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 243 predicate places. [2024-06-20 19:21:37,260 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 199 transitions, 1558 flow [2024-06-20 19:21:37,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:37,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:37,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:37,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-20 19:21:37,260 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-20 19:21:37,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:37,261 INFO L85 PathProgramCache]: Analyzing trace with hash -752567929, now seen corresponding path program 3 times [2024-06-20 19:21:37,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:37,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074781832] [2024-06-20 19:21:37,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:37,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:21:43,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:43,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074781832] [2024-06-20 19:21:43,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074781832] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:43,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:43,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:21:43,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752155855] [2024-06-20 19:21:43,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:43,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:21:43,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:43,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:21:43,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:21:43,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:21:43,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 199 transitions, 1558 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:43,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:43,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:21:43,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:43,737 INFO L124 PetriNetUnfolderBase]: 528/1008 cut-off events. [2024-06-20 19:21:43,738 INFO L125 PetriNetUnfolderBase]: For 84250/84250 co-relation queries the response was YES. [2024-06-20 19:21:43,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5105 conditions, 1008 events. 528/1008 cut-off events. For 84250/84250 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5505 event pairs, 90 based on Foata normal form. 2/1010 useless extension candidates. Maximal degree in co-relation 4970. Up to 879 conditions per place. [2024-06-20 19:21:43,748 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 186 selfloop transitions, 33 changer transitions 0/221 dead transitions. [2024-06-20 19:21:43,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 221 transitions, 2078 flow [2024-06-20 19:21:43,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:21:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:21:43,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2024-06-20 19:21:43,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3343108504398827 [2024-06-20 19:21:43,750 INFO L175 Difference]: Start difference. First operand has 273 places, 199 transitions, 1558 flow. Second operand 11 states and 114 transitions. [2024-06-20 19:21:43,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 221 transitions, 2078 flow [2024-06-20 19:21:44,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 221 transitions, 1995 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-20 19:21:44,034 INFO L231 Difference]: Finished difference. Result has 275 places, 200 transitions, 1571 flow [2024-06-20 19:21:44,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1571, PETRI_PLACES=275, PETRI_TRANSITIONS=200} [2024-06-20 19:21:44,034 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 245 predicate places. [2024-06-20 19:21:44,034 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 200 transitions, 1571 flow [2024-06-20 19:21:44,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:44,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:44,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-20 19:21:44,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-20 19:21:44,035 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-20 19:21:44,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:44,035 INFO L85 PathProgramCache]: Analyzing trace with hash -885914879, now seen corresponding path program 4 times [2024-06-20 19:21:44,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:44,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530441401] [2024-06-20 19:21:44,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:44,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:49,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:21:49,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:49,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530441401] [2024-06-20 19:21:49,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530441401] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:49,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:49,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:21:49,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595102417] [2024-06-20 19:21:49,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:49,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:21:49,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:49,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:21:49,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:21:49,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:21:49,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 200 transitions, 1571 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:49,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:49,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:21:49,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:49,923 INFO L124 PetriNetUnfolderBase]: 539/1029 cut-off events. [2024-06-20 19:21:49,924 INFO L125 PetriNetUnfolderBase]: For 98288/98288 co-relation queries the response was YES. [2024-06-20 19:21:49,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5476 conditions, 1029 events. 539/1029 cut-off events. For 98288/98288 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5639 event pairs, 95 based on Foata normal form. 2/1031 useless extension candidates. Maximal degree in co-relation 5340. Up to 837 conditions per place. [2024-06-20 19:21:49,934 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 191 selfloop transitions, 31 changer transitions 0/224 dead transitions. [2024-06-20 19:21:49,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 224 transitions, 2343 flow [2024-06-20 19:21:49,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:21:49,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:21:49,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-20 19:21:49,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34310850439882695 [2024-06-20 19:21:49,937 INFO L175 Difference]: Start difference. First operand has 275 places, 200 transitions, 1571 flow. Second operand 11 states and 117 transitions. [2024-06-20 19:21:49,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 224 transitions, 2343 flow [2024-06-20 19:21:50,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 224 transitions, 2257 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-20 19:21:50,297 INFO L231 Difference]: Finished difference. Result has 277 places, 202 transitions, 1605 flow [2024-06-20 19:21:50,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1485, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1605, PETRI_PLACES=277, PETRI_TRANSITIONS=202} [2024-06-20 19:21:50,298 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 247 predicate places. [2024-06-20 19:21:50,298 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 202 transitions, 1605 flow [2024-06-20 19:21:50,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:50,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:50,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:50,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-20 19:21:50,298 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-20 19:21:50,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:50,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1813207883, now seen corresponding path program 5 times [2024-06-20 19:21:50,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:50,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508357178] [2024-06-20 19:21:50,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:50,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:21:56,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:21:56,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:21:56,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508357178] [2024-06-20 19:21:56,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508357178] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:21:56,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:21:56,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:21:56,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496741420] [2024-06-20 19:21:56,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:21:56,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:21:56,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:21:56,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:21:56,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:21:56,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:21:56,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 202 transitions, 1605 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:56,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:21:56,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:21:56,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:21:56,982 INFO L124 PetriNetUnfolderBase]: 536/1024 cut-off events. [2024-06-20 19:21:56,982 INFO L125 PetriNetUnfolderBase]: For 87703/87703 co-relation queries the response was YES. [2024-06-20 19:21:56,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5203 conditions, 1024 events. 536/1024 cut-off events. For 87703/87703 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5616 event pairs, 90 based on Foata normal form. 2/1026 useless extension candidates. Maximal degree in co-relation 5066. Up to 871 conditions per place. [2024-06-20 19:21:56,993 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 188 selfloop transitions, 33 changer transitions 0/223 dead transitions. [2024-06-20 19:21:56,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 223 transitions, 2103 flow [2024-06-20 19:21:56,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:21:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:21:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-20 19:21:56,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33724340175953077 [2024-06-20 19:21:56,994 INFO L175 Difference]: Start difference. First operand has 277 places, 202 transitions, 1605 flow. Second operand 11 states and 115 transitions. [2024-06-20 19:21:56,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 223 transitions, 2103 flow [2024-06-20 19:21:57,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 223 transitions, 2023 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-20 19:21:57,301 INFO L231 Difference]: Finished difference. Result has 281 places, 202 transitions, 1595 flow [2024-06-20 19:21:57,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1525, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1595, PETRI_PLACES=281, PETRI_TRANSITIONS=202} [2024-06-20 19:21:57,302 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 251 predicate places. [2024-06-20 19:21:57,302 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 202 transitions, 1595 flow [2024-06-20 19:21:57,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:21:57,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:21:57,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:21:57,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-20 19:21:57,303 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-20 19:21:57,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:21:57,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1872789261, now seen corresponding path program 6 times [2024-06-20 19:21:57,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:21:57,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151693488] [2024-06-20 19:21:57,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:21:57,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:21:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:22:02,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:02,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151693488] [2024-06-20 19:22:02,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151693488] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:02,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:02,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:22:02,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523979297] [2024-06-20 19:22:02,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:02,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:22:02,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:02,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:22:02,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:22:03,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:22:03,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 202 transitions, 1595 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:03,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:03,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:22:03,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:03,565 INFO L124 PetriNetUnfolderBase]: 556/1068 cut-off events. [2024-06-20 19:22:03,565 INFO L125 PetriNetUnfolderBase]: For 150852/150852 co-relation queries the response was YES. [2024-06-20 19:22:03,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5371 conditions, 1068 events. 556/1068 cut-off events. For 150852/150852 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5911 event pairs, 86 based on Foata normal form. 12/1080 useless extension candidates. Maximal degree in co-relation 5232. Up to 820 conditions per place. [2024-06-20 19:22:03,576 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 167 selfloop transitions, 54 changer transitions 7/230 dead transitions. [2024-06-20 19:22:03,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 230 transitions, 2173 flow [2024-06-20 19:22:03,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:22:03,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:22:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions. [2024-06-20 19:22:03,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:22:03,578 INFO L175 Difference]: Start difference. First operand has 281 places, 202 transitions, 1595 flow. Second operand 12 states and 132 transitions. [2024-06-20 19:22:03,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 230 transitions, 2173 flow [2024-06-20 19:22:03,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 230 transitions, 2091 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-20 19:22:03,869 INFO L231 Difference]: Finished difference. Result has 283 places, 200 transitions, 1635 flow [2024-06-20 19:22:03,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1513, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1635, PETRI_PLACES=283, PETRI_TRANSITIONS=200} [2024-06-20 19:22:03,869 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 253 predicate places. [2024-06-20 19:22:03,870 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 200 transitions, 1635 flow [2024-06-20 19:22:03,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:03,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:03,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:03,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-20 19:22:03,870 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-20 19:22:03,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:03,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1798483689, now seen corresponding path program 1 times [2024-06-20 19:22:03,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:03,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426415895] [2024-06-20 19:22:03,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:03,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:22:10,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:10,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426415895] [2024-06-20 19:22:10,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426415895] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:10,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:10,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:22:10,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795987043] [2024-06-20 19:22:10,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:10,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:22:10,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:10,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:22:10,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:22:10,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:22:10,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 200 transitions, 1635 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-20 19:22:10,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:10,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:22:10,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:10,659 INFO L124 PetriNetUnfolderBase]: 566/1094 cut-off events. [2024-06-20 19:22:10,662 INFO L125 PetriNetUnfolderBase]: For 179319/179319 co-relation queries the response was YES. [2024-06-20 19:22:10,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6438 conditions, 1094 events. 566/1094 cut-off events. For 179319/179319 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6033 event pairs, 98 based on Foata normal form. 8/1102 useless extension candidates. Maximal degree in co-relation 6298. Up to 788 conditions per place. [2024-06-20 19:22:10,671 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 169 selfloop transitions, 51 changer transitions 8/230 dead transitions. [2024-06-20 19:22:10,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 230 transitions, 2443 flow [2024-06-20 19:22:10,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:22:10,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:22:10,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 133 transitions. [2024-06-20 19:22:10,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3575268817204301 [2024-06-20 19:22:10,672 INFO L175 Difference]: Start difference. First operand has 283 places, 200 transitions, 1635 flow. Second operand 12 states and 133 transitions. [2024-06-20 19:22:10,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 230 transitions, 2443 flow [2024-06-20 19:22:11,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 230 transitions, 2272 flow, removed 17 selfloop flow, removed 13 redundant places. [2024-06-20 19:22:11,164 INFO L231 Difference]: Finished difference. Result has 282 places, 197 transitions, 1554 flow [2024-06-20 19:22:11,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1554, PETRI_PLACES=282, PETRI_TRANSITIONS=197} [2024-06-20 19:22:11,165 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 252 predicate places. [2024-06-20 19:22:11,165 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 197 transitions, 1554 flow [2024-06-20 19:22:11,165 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-20 19:22:11,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:11,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:11,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-20 19:22:11,165 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-20 19:22:11,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:11,167 INFO L85 PathProgramCache]: Analyzing trace with hash 594745509, now seen corresponding path program 7 times [2024-06-20 19:22:11,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:11,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094947990] [2024-06-20 19:22:11,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:11,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:22:17,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:17,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094947990] [2024-06-20 19:22:17,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094947990] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:17,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:17,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:22:17,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773802499] [2024-06-20 19:22:17,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:17,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:22:17,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:17,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:22:17,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:22:17,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:22:17,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 197 transitions, 1554 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:17,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:17,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:22:17,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:17,794 INFO L124 PetriNetUnfolderBase]: 551/1061 cut-off events. [2024-06-20 19:22:17,795 INFO L125 PetriNetUnfolderBase]: For 144240/144240 co-relation queries the response was YES. [2024-06-20 19:22:17,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6265 conditions, 1061 events. 551/1061 cut-off events. For 144240/144240 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5822 event pairs, 110 based on Foata normal form. 2/1063 useless extension candidates. Maximal degree in co-relation 6126. Up to 864 conditions per place. [2024-06-20 19:22:17,805 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 177 selfloop transitions, 42 changer transitions 0/221 dead transitions. [2024-06-20 19:22:17,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 221 transitions, 2084 flow [2024-06-20 19:22:17,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:22:17,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:22:17,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 127 transitions. [2024-06-20 19:22:17,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34139784946236557 [2024-06-20 19:22:17,807 INFO L175 Difference]: Start difference. First operand has 282 places, 197 transitions, 1554 flow. Second operand 12 states and 127 transitions. [2024-06-20 19:22:17,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 221 transitions, 2084 flow [2024-06-20 19:22:18,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 221 transitions, 1982 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-20 19:22:18,251 INFO L231 Difference]: Finished difference. Result has 279 places, 198 transitions, 1568 flow [2024-06-20 19:22:18,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1568, PETRI_PLACES=279, PETRI_TRANSITIONS=198} [2024-06-20 19:22:18,252 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 249 predicate places. [2024-06-20 19:22:18,252 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 198 transitions, 1568 flow [2024-06-20 19:22:18,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:18,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:18,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:18,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-20 19:22:18,253 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-20 19:22:18,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:18,253 INFO L85 PathProgramCache]: Analyzing trace with hash 594739929, now seen corresponding path program 8 times [2024-06-20 19:22:18,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:18,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849860626] [2024-06-20 19:22:18,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:18,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:22:23,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:23,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849860626] [2024-06-20 19:22:23,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849860626] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:23,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:23,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:22:23,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567000705] [2024-06-20 19:22:23,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:23,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:22:23,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:23,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:22:23,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:22:23,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:22:23,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 198 transitions, 1568 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:23,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:23,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:22:23,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:24,437 INFO L124 PetriNetUnfolderBase]: 555/1069 cut-off events. [2024-06-20 19:22:24,438 INFO L125 PetriNetUnfolderBase]: For 139574/139574 co-relation queries the response was YES. [2024-06-20 19:22:24,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6289 conditions, 1069 events. 555/1069 cut-off events. For 139574/139574 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5896 event pairs, 110 based on Foata normal form. 2/1071 useless extension candidates. Maximal degree in co-relation 6152. Up to 858 conditions per place. [2024-06-20 19:22:24,449 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 177 selfloop transitions, 43 changer transitions 0/222 dead transitions. [2024-06-20 19:22:24,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 222 transitions, 2100 flow [2024-06-20 19:22:24,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:22:24,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:22:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2024-06-20 19:22:24,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-20 19:22:24,451 INFO L175 Difference]: Start difference. First operand has 279 places, 198 transitions, 1568 flow. Second operand 12 states and 128 transitions. [2024-06-20 19:22:24,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 222 transitions, 2100 flow [2024-06-20 19:22:24,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 222 transitions, 1994 flow, removed 12 selfloop flow, removed 10 redundant places. [2024-06-20 19:22:24,900 INFO L231 Difference]: Finished difference. Result has 281 places, 199 transitions, 1582 flow [2024-06-20 19:22:24,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1582, PETRI_PLACES=281, PETRI_TRANSITIONS=199} [2024-06-20 19:22:24,901 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 251 predicate places. [2024-06-20 19:22:24,901 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 199 transitions, 1582 flow [2024-06-20 19:22:24,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:24,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:24,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:24,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-20 19:22:24,902 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-20 19:22:24,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:24,902 INFO L85 PathProgramCache]: Analyzing trace with hash 815406931, now seen corresponding path program 9 times [2024-06-20 19:22:24,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:24,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405246498] [2024-06-20 19:22:24,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:24,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:30,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:22:30,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:30,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405246498] [2024-06-20 19:22:30,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405246498] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:30,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:30,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:22:30,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894028305] [2024-06-20 19:22:30,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:30,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:22:30,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:30,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:22:30,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:22:30,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:22:30,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 199 transitions, 1582 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-20 19:22:30,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:30,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:22:30,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:31,277 INFO L124 PetriNetUnfolderBase]: 559/1077 cut-off events. [2024-06-20 19:22:31,278 INFO L125 PetriNetUnfolderBase]: For 142356/142356 co-relation queries the response was YES. [2024-06-20 19:22:31,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6356 conditions, 1077 events. 559/1077 cut-off events. For 142356/142356 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5960 event pairs, 100 based on Foata normal form. 2/1079 useless extension candidates. Maximal degree in co-relation 6218. Up to 880 conditions per place. [2024-06-20 19:22:31,289 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 172 selfloop transitions, 49 changer transitions 0/223 dead transitions. [2024-06-20 19:22:31,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 223 transitions, 2120 flow [2024-06-20 19:22:31,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:22:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:22:31,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 125 transitions. [2024-06-20 19:22:31,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33602150537634407 [2024-06-20 19:22:31,290 INFO L175 Difference]: Start difference. First operand has 281 places, 199 transitions, 1582 flow. Second operand 12 states and 125 transitions. [2024-06-20 19:22:31,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 223 transitions, 2120 flow [2024-06-20 19:22:31,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 223 transitions, 2010 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-20 19:22:31,837 INFO L231 Difference]: Finished difference. Result has 283 places, 200 transitions, 1606 flow [2024-06-20 19:22:31,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1606, PETRI_PLACES=283, PETRI_TRANSITIONS=200} [2024-06-20 19:22:31,837 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 253 predicate places. [2024-06-20 19:22:31,838 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 200 transitions, 1606 flow [2024-06-20 19:22:31,838 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-20 19:22:31,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:31,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:31,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-20 19:22:31,838 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-20 19:22:31,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:31,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1591553543, now seen corresponding path program 10 times [2024-06-20 19:22:31,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:31,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961780941] [2024-06-20 19:22:31,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:31,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:37,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:22:37,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:37,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961780941] [2024-06-20 19:22:37,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961780941] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:37,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:37,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:22:37,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779079550] [2024-06-20 19:22:37,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:37,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:22:37,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:37,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:22:37,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:22:37,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:22:37,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 200 transitions, 1606 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-20 19:22:37,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:37,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:22:37,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:38,215 INFO L124 PetriNetUnfolderBase]: 556/1072 cut-off events. [2024-06-20 19:22:38,216 INFO L125 PetriNetUnfolderBase]: For 131676/131676 co-relation queries the response was YES. [2024-06-20 19:22:38,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6095 conditions, 1072 events. 556/1072 cut-off events. For 131676/131676 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5902 event pairs, 101 based on Foata normal form. 2/1074 useless extension candidates. Maximal degree in co-relation 5956. Up to 875 conditions per place. [2024-06-20 19:22:38,228 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 176 selfloop transitions, 46 changer transitions 0/224 dead transitions. [2024-06-20 19:22:38,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 224 transitions, 2148 flow [2024-06-20 19:22:38,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:22:38,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:22:38,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2024-06-20 19:22:38,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-20 19:22:38,229 INFO L175 Difference]: Start difference. First operand has 283 places, 200 transitions, 1606 flow. Second operand 12 states and 126 transitions. [2024-06-20 19:22:38,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 224 transitions, 2148 flow [2024-06-20 19:22:38,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 224 transitions, 2024 flow, removed 14 selfloop flow, removed 10 redundant places. [2024-06-20 19:22:38,606 INFO L231 Difference]: Finished difference. Result has 285 places, 201 transitions, 1612 flow [2024-06-20 19:22:38,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1612, PETRI_PLACES=285, PETRI_TRANSITIONS=201} [2024-06-20 19:22:38,606 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 255 predicate places. [2024-06-20 19:22:38,606 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 201 transitions, 1612 flow [2024-06-20 19:22:38,606 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-20 19:22:38,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:38,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:38,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-20 19:22:38,607 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-20 19:22:38,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:38,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2079448281, now seen corresponding path program 11 times [2024-06-20 19:22:38,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:38,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731237957] [2024-06-20 19:22:38,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:38,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:44,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:22:44,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:44,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731237957] [2024-06-20 19:22:44,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731237957] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:44,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:44,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:22:44,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077404304] [2024-06-20 19:22:44,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:44,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:22:44,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:44,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:22:44,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:22:44,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:22:44,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 201 transitions, 1612 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:44,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:44,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:22:44,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:45,077 INFO L124 PetriNetUnfolderBase]: 560/1080 cut-off events. [2024-06-20 19:22:45,077 INFO L125 PetriNetUnfolderBase]: For 134040/134040 co-relation queries the response was YES. [2024-06-20 19:22:45,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6140 conditions, 1080 events. 560/1080 cut-off events. For 134040/134040 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5996 event pairs, 101 based on Foata normal form. 2/1082 useless extension candidates. Maximal degree in co-relation 6000. Up to 869 conditions per place. [2024-06-20 19:22:45,089 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 176 selfloop transitions, 47 changer transitions 0/225 dead transitions. [2024-06-20 19:22:45,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 225 transitions, 2156 flow [2024-06-20 19:22:45,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:22:45,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:22:45,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 127 transitions. [2024-06-20 19:22:45,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34139784946236557 [2024-06-20 19:22:45,091 INFO L175 Difference]: Start difference. First operand has 285 places, 201 transitions, 1612 flow. Second operand 12 states and 127 transitions. [2024-06-20 19:22:45,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 225 transitions, 2156 flow [2024-06-20 19:22:45,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 225 transitions, 2036 flow, removed 15 selfloop flow, removed 10 redundant places. [2024-06-20 19:22:45,448 INFO L231 Difference]: Finished difference. Result has 287 places, 202 transitions, 1626 flow [2024-06-20 19:22:45,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1626, PETRI_PLACES=287, PETRI_TRANSITIONS=202} [2024-06-20 19:22:45,449 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 257 predicate places. [2024-06-20 19:22:45,449 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 202 transitions, 1626 flow [2024-06-20 19:22:45,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:45,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:45,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:45,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-20 19:22:45,450 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-20 19:22:45,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:45,450 INFO L85 PathProgramCache]: Analyzing trace with hash 815401351, now seen corresponding path program 12 times [2024-06-20 19:22:45,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:45,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319429083] [2024-06-20 19:22:45,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:45,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:22:51,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:51,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319429083] [2024-06-20 19:22:51,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319429083] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:51,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:51,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:22:51,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118751850] [2024-06-20 19:22:51,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:51,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:22:51,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:51,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:22:51,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:22:51,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:22:51,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 202 transitions, 1626 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:51,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:51,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:22:51,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:51,812 INFO L124 PetriNetUnfolderBase]: 564/1088 cut-off events. [2024-06-20 19:22:51,812 INFO L125 PetriNetUnfolderBase]: For 136488/136488 co-relation queries the response was YES. [2024-06-20 19:22:51,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6199 conditions, 1088 events. 564/1088 cut-off events. For 136488/136488 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6041 event pairs, 103 based on Foata normal form. 2/1090 useless extension candidates. Maximal degree in co-relation 6058. Up to 871 conditions per place. [2024-06-20 19:22:51,823 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 173 selfloop transitions, 51 changer transitions 0/226 dead transitions. [2024-06-20 19:22:51,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 226 transitions, 2174 flow [2024-06-20 19:22:51,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:22:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:22:51,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2024-06-20 19:22:51,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-20 19:22:51,824 INFO L175 Difference]: Start difference. First operand has 287 places, 202 transitions, 1626 flow. Second operand 12 states and 126 transitions. [2024-06-20 19:22:51,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 226 transitions, 2174 flow [2024-06-20 19:22:52,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 226 transitions, 2050 flow, removed 16 selfloop flow, removed 10 redundant places. [2024-06-20 19:22:52,322 INFO L231 Difference]: Finished difference. Result has 289 places, 203 transitions, 1646 flow [2024-06-20 19:22:52,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1646, PETRI_PLACES=289, PETRI_TRANSITIONS=203} [2024-06-20 19:22:52,322 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 259 predicate places. [2024-06-20 19:22:52,323 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 203 transitions, 1646 flow [2024-06-20 19:22:52,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:52,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:52,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:52,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-20 19:22:52,323 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-20 19:22:52,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:52,324 INFO L85 PathProgramCache]: Analyzing trace with hash 615955411, now seen corresponding path program 13 times [2024-06-20 19:22:52,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:52,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361006979] [2024-06-20 19:22:52,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:52,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:22:58,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:22:58,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:22:58,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361006979] [2024-06-20 19:22:58,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361006979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:22:58,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:22:58,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:22:58,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397726388] [2024-06-20 19:22:58,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:22:58,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:22:58,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:22:58,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:22:58,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:22:58,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:22:58,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 203 transitions, 1646 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:58,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:22:58,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:22:58,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:22:58,680 INFO L124 PetriNetUnfolderBase]: 568/1096 cut-off events. [2024-06-20 19:22:58,680 INFO L125 PetriNetUnfolderBase]: For 139012/139012 co-relation queries the response was YES. [2024-06-20 19:22:58,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6270 conditions, 1096 events. 568/1096 cut-off events. For 139012/139012 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 6076 event pairs, 107 based on Foata normal form. 2/1098 useless extension candidates. Maximal degree in co-relation 6128. Up to 837 conditions per place. [2024-06-20 19:22:58,691 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 174 selfloop transitions, 51 changer transitions 0/227 dead transitions. [2024-06-20 19:22:58,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 227 transitions, 2196 flow [2024-06-20 19:22:58,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:22:58,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:22:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 127 transitions. [2024-06-20 19:22:58,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34139784946236557 [2024-06-20 19:22:58,693 INFO L175 Difference]: Start difference. First operand has 289 places, 203 transitions, 1646 flow. Second operand 12 states and 127 transitions. [2024-06-20 19:22:58,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 227 transitions, 2196 flow [2024-06-20 19:22:59,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 227 transitions, 2062 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-06-20 19:22:59,104 INFO L231 Difference]: Finished difference. Result has 291 places, 204 transitions, 1658 flow [2024-06-20 19:22:59,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1512, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1658, PETRI_PLACES=291, PETRI_TRANSITIONS=204} [2024-06-20 19:22:59,104 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 261 predicate places. [2024-06-20 19:22:59,104 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 204 transitions, 1658 flow [2024-06-20 19:22:59,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:22:59,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:22:59,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:22:59,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-20 19:22:59,105 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-20 19:22:59,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:22:59,105 INFO L85 PathProgramCache]: Analyzing trace with hash -380852623, now seen corresponding path program 14 times [2024-06-20 19:22:59,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:22:59,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199948962] [2024-06-20 19:22:59,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:22:59,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:22:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:23:04,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:04,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199948962] [2024-06-20 19:23:04,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199948962] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:04,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:04,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:23:04,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719488424] [2024-06-20 19:23:04,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:04,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:23:04,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:04,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:23:04,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:23:04,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:23:05,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 204 transitions, 1658 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:05,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:05,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:23:05,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:05,495 INFO L124 PetriNetUnfolderBase]: 572/1104 cut-off events. [2024-06-20 19:23:05,495 INFO L125 PetriNetUnfolderBase]: For 141602/141602 co-relation queries the response was YES. [2024-06-20 19:23:05,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6329 conditions, 1104 events. 572/1104 cut-off events. For 141602/141602 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6148 event pairs, 115 based on Foata normal form. 2/1106 useless extension candidates. Maximal degree in co-relation 6186. Up to 871 conditions per place. [2024-06-20 19:23:05,506 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 182 selfloop transitions, 44 changer transitions 0/228 dead transitions. [2024-06-20 19:23:05,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 228 transitions, 2212 flow [2024-06-20 19:23:05,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:23:05,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:23:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 129 transitions. [2024-06-20 19:23:05,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3467741935483871 [2024-06-20 19:23:05,507 INFO L175 Difference]: Start difference. First operand has 291 places, 204 transitions, 1658 flow. Second operand 12 states and 129 transitions. [2024-06-20 19:23:05,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 228 transitions, 2212 flow [2024-06-20 19:23:05,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 228 transitions, 2076 flow, removed 18 selfloop flow, removed 10 redundant places. [2024-06-20 19:23:05,997 INFO L231 Difference]: Finished difference. Result has 293 places, 205 transitions, 1656 flow [2024-06-20 19:23:05,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1522, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1656, PETRI_PLACES=293, PETRI_TRANSITIONS=205} [2024-06-20 19:23:05,998 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 263 predicate places. [2024-06-20 19:23:05,998 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 205 transitions, 1656 flow [2024-06-20 19:23:05,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:05,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:05,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:05,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-20 19:23:05,998 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-20 19:23:05,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:05,999 INFO L85 PathProgramCache]: Analyzing trace with hash -384427543, now seen corresponding path program 15 times [2024-06-20 19:23:05,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:05,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375832964] [2024-06-20 19:23:05,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:05,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:11,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-20 19:23:11,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:11,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375832964] [2024-06-20 19:23:11,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375832964] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:11,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:11,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:23:11,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778474162] [2024-06-20 19:23:11,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:11,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:23:11,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:11,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:23:11,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:23:11,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:23:11,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 205 transitions, 1656 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:11,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:11,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:23:11,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:12,346 INFO L124 PetriNetUnfolderBase]: 576/1112 cut-off events. [2024-06-20 19:23:12,347 INFO L125 PetriNetUnfolderBase]: For 144313/144313 co-relation queries the response was YES. [2024-06-20 19:23:12,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6362 conditions, 1112 events. 576/1112 cut-off events. For 144313/144313 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6201 event pairs, 119 based on Foata normal form. 2/1114 useless extension candidates. Maximal degree in co-relation 6218. Up to 781 conditions per place. [2024-06-20 19:23:12,357 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 176 selfloop transitions, 51 changer transitions 0/229 dead transitions. [2024-06-20 19:23:12,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 229 transitions, 2212 flow [2024-06-20 19:23:12,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:23:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:23:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2024-06-20 19:23:12,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-20 19:23:12,359 INFO L175 Difference]: Start difference. First operand has 293 places, 205 transitions, 1656 flow. Second operand 12 states and 128 transitions. [2024-06-20 19:23:12,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 229 transitions, 2212 flow [2024-06-20 19:23:12,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 229 transitions, 2088 flow, removed 19 selfloop flow, removed 10 redundant places. [2024-06-20 19:23:12,777 INFO L231 Difference]: Finished difference. Result has 295 places, 206 transitions, 1682 flow [2024-06-20 19:23:12,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1532, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1682, PETRI_PLACES=295, PETRI_TRANSITIONS=206} [2024-06-20 19:23:12,777 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 265 predicate places. [2024-06-20 19:23:12,778 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 206 transitions, 1682 flow [2024-06-20 19:23:12,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:12,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:12,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:12,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-20 19:23:12,778 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-20 19:23:12,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:12,779 INFO L85 PathProgramCache]: Analyzing trace with hash -159205377, now seen corresponding path program 16 times [2024-06-20 19:23:12,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:12,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895090422] [2024-06-20 19:23:12,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:12,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:18,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:23:18,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:18,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895090422] [2024-06-20 19:23:18,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895090422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:18,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:18,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:23:18,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928842718] [2024-06-20 19:23:18,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:18,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:23:18,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:18,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:23:18,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:23:18,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:23:18,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 206 transitions, 1682 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:18,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:18,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:23:18,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:19,008 INFO L124 PetriNetUnfolderBase]: 596/1157 cut-off events. [2024-06-20 19:23:19,008 INFO L125 PetriNetUnfolderBase]: For 218077/218079 co-relation queries the response was YES. [2024-06-20 19:23:19,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6560 conditions, 1157 events. 596/1157 cut-off events. For 218077/218079 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6510 event pairs, 120 based on Foata normal form. 14/1171 useless extension candidates. Maximal degree in co-relation 6415. Up to 691 conditions per place. [2024-06-20 19:23:19,020 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 143 selfloop transitions, 81 changer transitions 7/233 dead transitions. [2024-06-20 19:23:19,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 233 transitions, 2280 flow [2024-06-20 19:23:19,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:23:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:23:19,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-20 19:23:19,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2024-06-20 19:23:19,021 INFO L175 Difference]: Start difference. First operand has 295 places, 206 transitions, 1682 flow. Second operand 12 states and 141 transitions. [2024-06-20 19:23:19,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 233 transitions, 2280 flow [2024-06-20 19:23:19,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 233 transitions, 2140 flow, removed 20 selfloop flow, removed 10 redundant places. [2024-06-20 19:23:19,500 INFO L231 Difference]: Finished difference. Result has 297 places, 204 transitions, 1737 flow [2024-06-20 19:23:19,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1737, PETRI_PLACES=297, PETRI_TRANSITIONS=204} [2024-06-20 19:23:19,501 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 267 predicate places. [2024-06-20 19:23:19,501 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 204 transitions, 1737 flow [2024-06-20 19:23:19,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:19,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:19,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:19,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-20 19:23:19,502 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-20 19:23:19,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:19,502 INFO L85 PathProgramCache]: Analyzing trace with hash -240327727, now seen corresponding path program 2 times [2024-06-20 19:23:19,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:19,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689384258] [2024-06-20 19:23:19,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:19,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:25,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:23:25,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:25,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689384258] [2024-06-20 19:23:25,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689384258] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:25,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:25,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:23:25,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915635220] [2024-06-20 19:23:25,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:25,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:23:25,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:25,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:23:25,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:23:25,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:23:25,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 204 transitions, 1737 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-20 19:23:25,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:25,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:23:25,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:26,341 INFO L124 PetriNetUnfolderBase]: 606/1183 cut-off events. [2024-06-20 19:23:26,342 INFO L125 PetriNetUnfolderBase]: For 249237/249239 co-relation queries the response was YES. [2024-06-20 19:23:26,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7700 conditions, 1183 events. 606/1183 cut-off events. For 249237/249239 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 6696 event pairs, 128 based on Foata normal form. 10/1193 useless extension candidates. Maximal degree in co-relation 7554. Up to 671 conditions per place. [2024-06-20 19:23:26,355 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 145 selfloop transitions, 78 changer transitions 8/233 dead transitions. [2024-06-20 19:23:26,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 233 transitions, 2581 flow [2024-06-20 19:23:26,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:23:26,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:23:26,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 142 transitions. [2024-06-20 19:23:26,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3817204301075269 [2024-06-20 19:23:26,356 INFO L175 Difference]: Start difference. First operand has 297 places, 204 transitions, 1737 flow. Second operand 12 states and 142 transitions. [2024-06-20 19:23:26,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 233 transitions, 2581 flow [2024-06-20 19:23:26,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 233 transitions, 2332 flow, removed 21 selfloop flow, removed 12 redundant places. [2024-06-20 19:23:27,013 INFO L231 Difference]: Finished difference. Result has 297 places, 201 transitions, 1629 flow [2024-06-20 19:23:27,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1488, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1629, PETRI_PLACES=297, PETRI_TRANSITIONS=201} [2024-06-20 19:23:27,014 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 267 predicate places. [2024-06-20 19:23:27,014 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 201 transitions, 1629 flow [2024-06-20 19:23:27,014 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-20 19:23:27,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:27,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:27,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-20 19:23:27,018 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-20 19:23:27,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:27,019 INFO L85 PathProgramCache]: Analyzing trace with hash 156486053, now seen corresponding path program 17 times [2024-06-20 19:23:27,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:27,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703246827] [2024-06-20 19:23:27,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:27,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:33,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:23:33,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:33,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703246827] [2024-06-20 19:23:33,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703246827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:33,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:33,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:23:33,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578772256] [2024-06-20 19:23:33,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:33,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:23:33,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:33,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:23:33,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:23:33,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:23:33,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 201 transitions, 1629 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:33,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:33,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:23:33,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:33,953 INFO L124 PetriNetUnfolderBase]: 591/1150 cut-off events. [2024-06-20 19:23:33,953 INFO L125 PetriNetUnfolderBase]: For 207796/207798 co-relation queries the response was YES. [2024-06-20 19:23:33,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7538 conditions, 1150 events. 591/1150 cut-off events. For 207796/207798 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 6419 event pairs, 128 based on Foata normal form. 4/1154 useless extension candidates. Maximal degree in co-relation 7392. Up to 735 conditions per place. [2024-06-20 19:23:33,963 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 145 selfloop transitions, 77 changer transitions 0/224 dead transitions. [2024-06-20 19:23:33,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 224 transitions, 2183 flow [2024-06-20 19:23:33,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:23:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:23:33,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2024-06-20 19:23:33,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-06-20 19:23:33,965 INFO L175 Difference]: Start difference. First operand has 297 places, 201 transitions, 1629 flow. Second operand 12 states and 135 transitions. [2024-06-20 19:23:33,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 224 transitions, 2183 flow [2024-06-20 19:23:34,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 224 transitions, 2025 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-20 19:23:34,706 INFO L231 Difference]: Finished difference. Result has 294 places, 202 transitions, 1677 flow [2024-06-20 19:23:34,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1677, PETRI_PLACES=294, PETRI_TRANSITIONS=202} [2024-06-20 19:23:34,707 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 264 predicate places. [2024-06-20 19:23:34,707 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 202 transitions, 1677 flow [2024-06-20 19:23:34,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:34,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:34,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:34,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-20 19:23:34,708 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-20 19:23:34,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:34,708 INFO L85 PathProgramCache]: Analyzing trace with hash -185964447, now seen corresponding path program 18 times [2024-06-20 19:23:34,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:34,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106877185] [2024-06-20 19:23:34,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:34,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:40,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-20 19:23:40,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:40,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106877185] [2024-06-20 19:23:40,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106877185] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:40,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:40,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:23:40,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202330156] [2024-06-20 19:23:40,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:40,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:23:40,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:40,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:23:40,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:23:40,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:23:40,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 202 transitions, 1677 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:40,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:40,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:23:40,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:41,032 INFO L124 PetriNetUnfolderBase]: 611/1194 cut-off events. [2024-06-20 19:23:41,033 INFO L125 PetriNetUnfolderBase]: For 277000/277002 co-relation queries the response was YES. [2024-06-20 19:23:41,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7722 conditions, 1194 events. 611/1194 cut-off events. For 277000/277002 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 6762 event pairs, 112 based on Foata normal form. 14/1208 useless extension candidates. Maximal degree in co-relation 7578. Up to 737 conditions per place. [2024-06-20 19:23:41,045 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 131 selfloop transitions, 89 changer transitions 7/229 dead transitions. [2024-06-20 19:23:41,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 229 transitions, 2271 flow [2024-06-20 19:23:41,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:23:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:23:41,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 139 transitions. [2024-06-20 19:23:41,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3736559139784946 [2024-06-20 19:23:41,046 INFO L175 Difference]: Start difference. First operand has 294 places, 202 transitions, 1677 flow. Second operand 12 states and 139 transitions. [2024-06-20 19:23:41,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 229 transitions, 2271 flow [2024-06-20 19:23:41,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 229 transitions, 2075 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-06-20 19:23:41,646 INFO L231 Difference]: Finished difference. Result has 296 places, 200 transitions, 1696 flow [2024-06-20 19:23:41,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1481, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1696, PETRI_PLACES=296, PETRI_TRANSITIONS=200} [2024-06-20 19:23:41,647 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 266 predicate places. [2024-06-20 19:23:41,648 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 200 transitions, 1696 flow [2024-06-20 19:23:41,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:41,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:41,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:41,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-20 19:23:41,648 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-20 19:23:41,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:41,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2127384403, now seen corresponding path program 19 times [2024-06-20 19:23:41,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:41,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857708586] [2024-06-20 19:23:41,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:41,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:23:47,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:47,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857708586] [2024-06-20 19:23:47,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857708586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:47,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:47,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:23:47,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983533513] [2024-06-20 19:23:47,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:47,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:23:47,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:47,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:23:47,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:23:47,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:23:47,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 200 transitions, 1696 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:47,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:47,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:23:47,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:48,084 INFO L124 PetriNetUnfolderBase]: 591/1154 cut-off events. [2024-06-20 19:23:48,084 INFO L125 PetriNetUnfolderBase]: For 205399/205401 co-relation queries the response was YES. [2024-06-20 19:23:48,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7673 conditions, 1154 events. 591/1154 cut-off events. For 205399/205401 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6482 event pairs, 130 based on Foata normal form. 4/1158 useless extension candidates. Maximal degree in co-relation 7528. Up to 745 conditions per place. [2024-06-20 19:23:48,096 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 145 selfloop transitions, 76 changer transitions 0/223 dead transitions. [2024-06-20 19:23:48,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 223 transitions, 2252 flow [2024-06-20 19:23:48,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:23:48,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:23:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 134 transitions. [2024-06-20 19:23:48,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3602150537634409 [2024-06-20 19:23:48,098 INFO L175 Difference]: Start difference. First operand has 296 places, 200 transitions, 1696 flow. Second operand 12 states and 134 transitions. [2024-06-20 19:23:48,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 223 transitions, 2252 flow [2024-06-20 19:23:48,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 223 transitions, 2025 flow, removed 23 selfloop flow, removed 11 redundant places. [2024-06-20 19:23:48,881 INFO L231 Difference]: Finished difference. Result has 297 places, 201 transitions, 1677 flow [2024-06-20 19:23:48,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1469, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1677, PETRI_PLACES=297, PETRI_TRANSITIONS=201} [2024-06-20 19:23:48,882 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 267 predicate places. [2024-06-20 19:23:48,882 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 201 transitions, 1677 flow [2024-06-20 19:23:48,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:48,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:48,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:48,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-20 19:23:48,883 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-20 19:23:48,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:48,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1444065907, now seen corresponding path program 20 times [2024-06-20 19:23:48,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:48,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408848148] [2024-06-20 19:23:48,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:48,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:23:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:23:54,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:23:54,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408848148] [2024-06-20 19:23:54,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408848148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:23:54,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:23:54,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:23:54,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149035593] [2024-06-20 19:23:54,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:23:54,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:23:54,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:23:54,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:23:54,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:23:54,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:23:54,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 201 transitions, 1677 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:54,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:23:54,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:23:54,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:23:55,093 INFO L124 PetriNetUnfolderBase]: 588/1149 cut-off events. [2024-06-20 19:23:55,094 INFO L125 PetriNetUnfolderBase]: For 197576/197578 co-relation queries the response was YES. [2024-06-20 19:23:55,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7276 conditions, 1149 events. 588/1149 cut-off events. For 197576/197578 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6459 event pairs, 131 based on Foata normal form. 4/1153 useless extension candidates. Maximal degree in co-relation 7130. Up to 740 conditions per place. [2024-06-20 19:23:55,106 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 137 selfloop transitions, 84 changer transitions 0/223 dead transitions. [2024-06-20 19:23:55,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 223 transitions, 2231 flow [2024-06-20 19:23:55,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:23:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:23:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 133 transitions. [2024-06-20 19:23:55,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3575268817204301 [2024-06-20 19:23:55,107 INFO L175 Difference]: Start difference. First operand has 297 places, 201 transitions, 1677 flow. Second operand 12 states and 133 transitions. [2024-06-20 19:23:55,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 223 transitions, 2231 flow [2024-06-20 19:23:55,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 223 transitions, 2033 flow, removed 24 selfloop flow, removed 10 redundant places. [2024-06-20 19:23:55,722 INFO L231 Difference]: Finished difference. Result has 299 places, 202 transitions, 1705 flow [2024-06-20 19:23:55,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1479, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1705, PETRI_PLACES=299, PETRI_TRANSITIONS=202} [2024-06-20 19:23:55,722 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 269 predicate places. [2024-06-20 19:23:55,722 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 202 transitions, 1705 flow [2024-06-20 19:23:55,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:23:55,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:23:55,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:23:55,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-06-20 19:23:55,723 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-20 19:23:55,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:23:55,723 INFO L85 PathProgramCache]: Analyzing trace with hash 355782263, now seen corresponding path program 21 times [2024-06-20 19:23:55,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:23:55,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88719341] [2024-06-20 19:23:55,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:23:55,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:23:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:24:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:24:01,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:24:01,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88719341] [2024-06-20 19:24:01,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88719341] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:24:01,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:24:01,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:24:01,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619547815] [2024-06-20 19:24:01,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:24:01,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:24:01,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:24:01,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:24:01,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:24:02,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:24:02,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 202 transitions, 1705 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:24:02,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:24:02,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:24:02,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:24:02,628 INFO L124 PetriNetUnfolderBase]: 592/1157 cut-off events. [2024-06-20 19:24:02,629 INFO L125 PetriNetUnfolderBase]: For 201023/201025 co-relation queries the response was YES. [2024-06-20 19:24:02,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7351 conditions, 1157 events. 592/1157 cut-off events. For 201023/201025 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6530 event pairs, 125 based on Foata normal form. 4/1161 useless extension candidates. Maximal degree in co-relation 7204. Up to 728 conditions per place. [2024-06-20 19:24:02,641 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 145 selfloop transitions, 78 changer transitions 0/225 dead transitions. [2024-06-20 19:24:02,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 225 transitions, 2267 flow [2024-06-20 19:24:02,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:24:02,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:24:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2024-06-20 19:24:02,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-06-20 19:24:02,642 INFO L175 Difference]: Start difference. First operand has 299 places, 202 transitions, 1705 flow. Second operand 12 states and 135 transitions. [2024-06-20 19:24:02,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 225 transitions, 2267 flow [2024-06-20 19:24:03,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 225 transitions, 2051 flow, removed 25 selfloop flow, removed 10 redundant places. [2024-06-20 19:24:03,283 INFO L231 Difference]: Finished difference. Result has 301 places, 203 transitions, 1705 flow [2024-06-20 19:24:03,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1705, PETRI_PLACES=301, PETRI_TRANSITIONS=203} [2024-06-20 19:24:03,289 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 271 predicate places. [2024-06-20 19:24:03,289 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 203 transitions, 1705 flow [2024-06-20 19:24:03,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:24:03,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:24:03,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:24:03,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-06-20 19:24:03,289 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-20 19:24:03,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:24:03,290 INFO L85 PathProgramCache]: Analyzing trace with hash -576995833, now seen corresponding path program 22 times [2024-06-20 19:24:03,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:24:03,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708664301] [2024-06-20 19:24:03,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:24:03,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:24:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:24:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:24:09,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:24:09,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708664301] [2024-06-20 19:24:09,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708664301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:24:09,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:24:09,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:24:09,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274819030] [2024-06-20 19:24:09,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:24:09,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:24:09,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:24:09,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:24:09,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:24:09,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:24:09,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 203 transitions, 1705 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:24:09,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:24:09,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:24:09,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:24:10,154 INFO L124 PetriNetUnfolderBase]: 612/1201 cut-off events. [2024-06-20 19:24:10,154 INFO L125 PetriNetUnfolderBase]: For 280208/280210 co-relation queries the response was YES. [2024-06-20 19:24:10,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7518 conditions, 1201 events. 612/1201 cut-off events. For 280208/280210 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6845 event pairs, 119 based on Foata normal form. 14/1215 useless extension candidates. Maximal degree in co-relation 7370. Up to 750 conditions per place. [2024-06-20 19:24:10,165 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 141 selfloop transitions, 80 changer transitions 7/230 dead transitions. [2024-06-20 19:24:10,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 230 transitions, 2309 flow [2024-06-20 19:24:10,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:24:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:24:10,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions. [2024-06-20 19:24:10,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2024-06-20 19:24:10,166 INFO L175 Difference]: Start difference. First operand has 301 places, 203 transitions, 1705 flow. Second operand 12 states and 140 transitions. [2024-06-20 19:24:10,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 230 transitions, 2309 flow [2024-06-20 19:24:10,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 230 transitions, 2103 flow, removed 26 selfloop flow, removed 10 redundant places. [2024-06-20 19:24:10,841 INFO L231 Difference]: Finished difference. Result has 303 places, 201 transitions, 1700 flow [2024-06-20 19:24:10,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1700, PETRI_PLACES=303, PETRI_TRANSITIONS=201} [2024-06-20 19:24:10,842 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 273 predicate places. [2024-06-20 19:24:10,842 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 201 transitions, 1700 flow [2024-06-20 19:24:10,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:24:10,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:24:10,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:24:10,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-06-20 19:24:10,842 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-20 19:24:10,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:24:10,843 INFO L85 PathProgramCache]: Analyzing trace with hash 156480473, now seen corresponding path program 23 times [2024-06-20 19:24:10,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:24:10,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726164682] [2024-06-20 19:24:10,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:24:10,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:24:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:24:16,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:24:16,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:24:16,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726164682] [2024-06-20 19:24:16,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726164682] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:24:16,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:24:16,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:24:16,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98309594] [2024-06-20 19:24:16,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:24:16,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:24:16,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:24:16,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:24:16,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:24:16,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:24:16,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 201 transitions, 1700 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-20 19:24:16,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:24:16,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:24:16,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:24:16,891 INFO L124 PetriNetUnfolderBase]: 592/1161 cut-off events. [2024-06-20 19:24:16,891 INFO L125 PetriNetUnfolderBase]: For 207908/207910 co-relation queries the response was YES. [2024-06-20 19:24:16,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7421 conditions, 1161 events. 592/1161 cut-off events. For 207908/207910 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6580 event pairs, 135 based on Foata normal form. 4/1165 useless extension candidates. Maximal degree in co-relation 7272. Up to 744 conditions per place. [2024-06-20 19:24:16,904 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 148 selfloop transitions, 74 changer transitions 0/224 dead transitions. [2024-06-20 19:24:16,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 224 transitions, 2264 flow [2024-06-20 19:24:16,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:24:16,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:24:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 136 transitions. [2024-06-20 19:24:16,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3655913978494624 [2024-06-20 19:24:16,905 INFO L175 Difference]: Start difference. First operand has 303 places, 201 transitions, 1700 flow. Second operand 12 states and 136 transitions. [2024-06-20 19:24:16,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 224 transitions, 2264 flow [2024-06-20 19:24:17,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 224 transitions, 2029 flow, removed 29 selfloop flow, removed 13 redundant places. [2024-06-20 19:24:17,626 INFO L231 Difference]: Finished difference. Result has 302 places, 202 transitions, 1677 flow [2024-06-20 19:24:17,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1677, PETRI_PLACES=302, PETRI_TRANSITIONS=202} [2024-06-20 19:24:17,627 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 272 predicate places. [2024-06-20 19:24:17,627 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 202 transitions, 1677 flow [2024-06-20 19:24:17,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-20 19:24:17,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:24:17,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-20 19:24:17,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-06-20 19:24:17,636 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-20 19:24:17,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:24:17,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1362672431, now seen corresponding path program 24 times [2024-06-20 19:24:17,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:24:17,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968574491] [2024-06-20 19:24:17,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:24:17,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:24:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:24:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:24:23,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:24:23,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968574491] [2024-06-20 19:24:23,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968574491] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:24:23,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:24:23,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:24:23,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612311324] [2024-06-20 19:24:23,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:24:23,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:24:23,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:24:23,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:24:23,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:24:23,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:24:23,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 202 transitions, 1677 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:24:23,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:24:23,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:24:23,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:24:24,095 INFO L124 PetriNetUnfolderBase]: 596/1169 cut-off events. [2024-06-20 19:24:24,096 INFO L125 PetriNetUnfolderBase]: For 211258/211260 co-relation queries the response was YES. [2024-06-20 19:24:24,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7422 conditions, 1169 events. 596/1169 cut-off events. For 211258/211260 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6637 event pairs, 139 based on Foata normal form. 4/1173 useless extension candidates. Maximal degree in co-relation 7274. Up to 752 conditions per place. [2024-06-20 19:24:24,108 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 140 selfloop transitions, 82 changer transitions 0/224 dead transitions. [2024-06-20 19:24:24,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 224 transitions, 2237 flow [2024-06-20 19:24:24,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:24:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:24:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 134 transitions. [2024-06-20 19:24:24,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3602150537634409 [2024-06-20 19:24:24,110 INFO L175 Difference]: Start difference. First operand has 302 places, 202 transitions, 1677 flow. Second operand 12 states and 134 transitions. [2024-06-20 19:24:24,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 224 transitions, 2237 flow [2024-06-20 19:24:24,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 224 transitions, 2037 flow, removed 27 selfloop flow, removed 10 redundant places. [2024-06-20 19:24:24,696 INFO L231 Difference]: Finished difference. Result has 304 places, 203 transitions, 1705 flow [2024-06-20 19:24:24,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1477, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1705, PETRI_PLACES=304, PETRI_TRANSITIONS=203} [2024-06-20 19:24:24,696 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 274 predicate places. [2024-06-20 19:24:24,697 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 203 transitions, 1705 flow [2024-06-20 19:24:24,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:24:24,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:24:24,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:24:24,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2024-06-20 19:24:24,697 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:24:24,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:24:24,697 INFO L85 PathProgramCache]: Analyzing trace with hash -783649273, now seen corresponding path program 25 times [2024-06-20 19:24:24,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:24:24,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560994924] [2024-06-20 19:24:24,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:24:24,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:24:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:24:30,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:24:30,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:24:30,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560994924] [2024-06-20 19:24:30,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560994924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:24:30,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:24:30,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:24:30,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760461216] [2024-06-20 19:24:30,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:24:30,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:24:30,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:24:30,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:24:30,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:24:31,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:24:31,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 203 transitions, 1705 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:24:31,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:24:31,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:24:31,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:24:31,674 INFO L124 PetriNetUnfolderBase]: 600/1177 cut-off events. [2024-06-20 19:24:31,674 INFO L125 PetriNetUnfolderBase]: For 214865/214867 co-relation queries the response was YES. [2024-06-20 19:24:31,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7501 conditions, 1177 events. 600/1177 cut-off events. For 214865/214867 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6691 event pairs, 127 based on Foata normal form. 4/1181 useless extension candidates. Maximal degree in co-relation 7352. Up to 774 conditions per place. [2024-06-20 19:24:31,688 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 139 selfloop transitions, 84 changer transitions 0/225 dead transitions. [2024-06-20 19:24:31,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 225 transitions, 2271 flow [2024-06-20 19:24:31,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:24:31,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:24:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions. [2024-06-20 19:24:31,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:24:31,689 INFO L175 Difference]: Start difference. First operand has 304 places, 203 transitions, 1705 flow. Second operand 12 states and 132 transitions. [2024-06-20 19:24:31,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 225 transitions, 2271 flow [2024-06-20 19:24:32,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 225 transitions, 2053 flow, removed 28 selfloop flow, removed 10 redundant places. [2024-06-20 19:24:32,293 INFO L231 Difference]: Finished difference. Result has 306 places, 204 transitions, 1721 flow [2024-06-20 19:24:32,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1721, PETRI_PLACES=306, PETRI_TRANSITIONS=204} [2024-06-20 19:24:32,307 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 276 predicate places. [2024-06-20 19:24:32,307 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 204 transitions, 1721 flow [2024-06-20 19:24:32,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:24:32,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:24:32,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:24:32,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2024-06-20 19:24:32,308 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:24:32,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:24:32,308 INFO L85 PathProgramCache]: Analyzing trace with hash 156336323, now seen corresponding path program 26 times [2024-06-20 19:24:32,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:24:32,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859570170] [2024-06-20 19:24:32,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:24:32,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:24:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15