./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi001_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/rfi001_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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi001_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:30:42,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 19:30:42,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 19:30:42,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 19:30:42,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 19:30:42,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 19:30:42,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 19:30:42,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 19:30:42,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 19:30:42,861 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 19:30:42,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 19:30:42,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 19:30:42,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 19:30:42,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 19:30:42,862 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 19:30:42,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 19:30:42,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 19:30:42,864 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 19:30:42,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 19:30:42,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 19:30:42,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 19:30:42,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 19:30:42,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 19:30:42,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 19:30:42,866 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 19:30:42,867 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 19:30:42,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 19:30:42,867 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 19:30:42,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 19:30:42,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 19:30:42,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 19:30:42,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 19:30:42,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:30:42,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 19:30:42,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 19:30:42,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 19:30:42,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 19:30:42,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 19:30:42,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 19:30:42,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 19:30:42,872 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 19:30:42,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 19:30:42,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 19:30:42,873 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:30:43,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 19:30:43,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 19:30:43,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 19:30:43,132 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 19:30:43,133 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 19:30:43,134 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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.yml/witness.yml [2024-06-20 19:30:43,373 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 19:30:43,373 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 19:30:43,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-20 19:30:44,513 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 19:30:44,805 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 19:30:44,806 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-20 19:30:44,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e95fac7a/2594869a6657403288781ef1708e4d4b/FLAGbe332fb11 [2024-06-20 19:30:44,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e95fac7a/2594869a6657403288781ef1708e4d4b [2024-06-20 19:30:44,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 19:30:44,839 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 19:30:44,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 19:30:44,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 19:30:44,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 19:30:44,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:30:43" (1/2) ... [2024-06-20 19:30:44,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3673ab87 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:30:44, skipping insertion in model container [2024-06-20 19:30:44,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:30:43" (1/2) ... [2024-06-20 19:30:44,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6a78dc84 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:30:44, skipping insertion in model container [2024-06-20 19:30:44,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:30:44" (2/2) ... [2024-06-20 19:30:44,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3673ab87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:30:44, skipping insertion in model container [2024-06-20 19:30:44,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:30:44" (2/2) ... [2024-06-20 19:30:44,856 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 19:30:44,917 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 19:30:44,918 INFO L97 edCorrectnessWitness]: Location invariant before [L806-L806] ((((((((((((((((! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$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 )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )z >= 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 )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )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 )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )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 )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )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 )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (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 )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (z == 0 || z == 1)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-20 19:30:44,919 INFO L97 edCorrectnessWitness]: Location invariant before [L805-L805] ((((((((((((((((! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$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 )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )z >= 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 )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )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 )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )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 )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )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 )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (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 )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && (z == 0 || z == 1)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-20 19:30:44,920 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 19:30:44,920 INFO L106 edCorrectnessWitness]: ghost_update [L803-L803] multithreaded = 1; [2024-06-20 19:30:44,960 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 19:30:45,344 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:30:45,358 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-20 19:30:45,647 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:30:45,687 INFO L206 MainTranslator]: Completed translation [2024-06-20 19:30:45,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:30:45 WrapperNode [2024-06-20 19:30:45,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 19:30:45,689 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 19:30:45,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 19:30:45,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 19:30:45,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:30:45" (1/1) ... [2024-06-20 19:30:45,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:30:45" (1/1) ... [2024-06-20 19:30:45,805 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 139 [2024-06-20 19:30:45,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 19:30:45,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 19:30:45,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 19:30:45,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 19:30:45,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:30:45" (1/1) ... [2024-06-20 19:30:45,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:30:45" (1/1) ... [2024-06-20 19:30:45,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:30:45" (1/1) ... [2024-06-20 19:30:45,888 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:30:45,889 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:30:45" (1/1) ... [2024-06-20 19:30:45,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:30:45" (1/1) ... [2024-06-20 19:30:45,929 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:30:45" (1/1) ... [2024-06-20 19:30:45,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:30:45" (1/1) ... [2024-06-20 19:30:45,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:30:45" (1/1) ... [2024-06-20 19:30:45,953 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:30:45" (1/1) ... [2024-06-20 19:30:45,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 19:30:45,973 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 19:30:45,973 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 19:30:45,973 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 19:30:45,974 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:30:45" (1/1) ... [2024-06-20 19:30:45,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:30:45,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 19:30:46,001 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:30:46,032 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:30:46,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-20 19:30:46,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 19:30:46,051 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-20 19:30:46,051 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-20 19:30:46,052 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-20 19:30:46,052 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-20 19:30:46,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 19:30:46,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-20 19:30:46,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 19:30:46,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 19:30:46,054 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:30:46,195 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 19:30:46,197 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 19:30:47,124 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 19:30:47,124 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 19:30:47,362 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 19:30:47,362 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-20 19:30:47,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:30:47 BoogieIcfgContainer [2024-06-20 19:30:47,365 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 19:30:47,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 19:30:47,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 19:30:47,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 19:30:47,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:30:43" (1/4) ... [2024-06-20 19:30:47,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e320927 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:30:47, skipping insertion in model container [2024-06-20 19:30:47,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:30:44" (2/4) ... [2024-06-20 19:30:47,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e320927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:30:47, skipping insertion in model container [2024-06-20 19:30:47,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:30:45" (3/4) ... [2024-06-20 19:30:47,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e320927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:30:47, skipping insertion in model container [2024-06-20 19:30:47,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:30:47" (4/4) ... [2024-06-20 19:30:47,381 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-20 19:30:47,398 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 19:30:47,398 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-20 19:30:47,398 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 19:30:47,494 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-20 19:30:47,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 70 flow [2024-06-20 19:30:47,600 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-06-20 19:30:47,600 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:30:47,602 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:30:47,602 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 70 flow [2024-06-20 19:30:47,606 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 52 flow [2024-06-20 19:30:47,620 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 19:30:47,627 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;@2edc7c9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 19:30:47,628 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-20 19:30:47,636 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 19:30:47,636 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-20 19:30:47,637 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:30:47,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:30:47,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 19:30:47,638 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:30:47,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:30:47,646 INFO L85 PathProgramCache]: Analyzing trace with hash 330507394, now seen corresponding path program 1 times [2024-06-20 19:30:47,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:30:47,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476451469] [2024-06-20 19:30:47,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:30:47,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:30:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:30:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:30:53,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:30:53,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476451469] [2024-06-20 19:30:53,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476451469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:30:53,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:30:53,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 19:30:53,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524031621] [2024-06-20 19:30:53,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:30:53,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 19:30:53,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:30:53,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 19:30:53,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 19:30:53,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-20 19:30:53,361 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:30:53,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:30:53,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-20 19:30:53,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:30:53,649 INFO L124 PetriNetUnfolderBase]: 162/320 cut-off events. [2024-06-20 19:30:53,649 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-20 19:30:53,653 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:30:53,672 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 21 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-20 19:30:53,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 115 flow [2024-06-20 19:30:53,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 19:30:53,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 19:30:53,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2024-06-20 19:30:53,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5698924731182796 [2024-06-20 19:30:53,686 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:30:53,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 115 flow [2024-06-20 19:30:53,689 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:30:53,691 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 71 flow [2024-06-20 19:30:53,693 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:30:53,697 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-06-20 19:30:53,698 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 71 flow [2024-06-20 19:30:53,698 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:30:53,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:30:53,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:30:53,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 19:30:53,699 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:30:53,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:30:53,700 INFO L85 PathProgramCache]: Analyzing trace with hash -209632469, now seen corresponding path program 1 times [2024-06-20 19:30:53,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:30:53,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158029372] [2024-06-20 19:30:53,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:30:53,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:30:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:30:57,812 INFO 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:30:57,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:30:57,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158029372] [2024-06-20 19:30:57,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158029372] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:30:57,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:30:57,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 19:30:57,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55759159] [2024-06-20 19:30:57,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:30:57,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 19:30:57,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:30:57,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 19:30:57,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-20 19:30:57,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:30:57,901 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:30:57,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:30:57,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:30:57,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:30:58,124 INFO L124 PetriNetUnfolderBase]: 186/348 cut-off events. [2024-06-20 19:30:58,124 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-06-20 19:30:58,126 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:30:58,128 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 26 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-20 19:30:58,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 159 flow [2024-06-20 19:30:58,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 19:30:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 19:30:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-06-20 19:30:58,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5241935483870968 [2024-06-20 19:30:58,131 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:30:58,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 159 flow [2024-06-20 19:30:58,132 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:30:58,133 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow [2024-06-20 19:30:58,133 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:30:58,134 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2024-06-20 19:30:58,134 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow [2024-06-20 19:30:58,134 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:30:58,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:30:58,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:30:58,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 19:30:58,135 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:30:58,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:30:58,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2091328885, now seen corresponding path program 1 times [2024-06-20 19:30:58,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:30:58,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165042415] [2024-06-20 19:30:58,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:30:58,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:30:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:02,144 INFO 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:31:02,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:02,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165042415] [2024-06-20 19:31:02,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165042415] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:02,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:02,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 19:31:02,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173686492] [2024-06-20 19:31:02,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:02,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 19:31:02,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:02,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 19:31:02,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-20 19:31:02,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:31:02,248 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:31:02,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:02,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:31:02,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:02,465 INFO L124 PetriNetUnfolderBase]: 180/340 cut-off events. [2024-06-20 19:31:02,466 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2024-06-20 19:31:02,467 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:31:02,469 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 31 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2024-06-20 19:31:02,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 211 flow [2024-06-20 19:31:02,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:31:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:31:02,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-06-20 19:31:02,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2024-06-20 19:31:02,471 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:31:02,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 211 flow [2024-06-20 19:31:02,473 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:31:02,474 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 119 flow [2024-06-20 19:31:02,474 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:31:02,476 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2024-06-20 19:31:02,476 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 119 flow [2024-06-20 19:31:02,476 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:31:02,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:02,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:02,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 19:31:02,477 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:31:02,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:02,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1135293634, now seen corresponding path program 1 times [2024-06-20 19:31:02,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:02,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887332913] [2024-06-20 19:31:02,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:02,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:07,232 INFO 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:31:07,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:07,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887332913] [2024-06-20 19:31:07,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887332913] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:07,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:07,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:31:07,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296498030] [2024-06-20 19:31:07,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:07,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:31:07,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:07,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:31:07,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:31:07,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 19:31:07,348 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:31:07,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:07,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 19:31:07,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:07,670 INFO L124 PetriNetUnfolderBase]: 176/330 cut-off events. [2024-06-20 19:31:07,671 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2024-06-20 19:31:07,672 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:31:07,674 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 31 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2024-06-20 19:31:07,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 225 flow [2024-06-20 19:31:07,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:31:07,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:31:07,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2024-06-20 19:31:07,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.478494623655914 [2024-06-20 19:31:07,676 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:31:07,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 225 flow [2024-06-20 19:31:07,677 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:31:07,678 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 116 flow [2024-06-20 19:31:07,679 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:31:07,679 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-20 19:31:07,679 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 116 flow [2024-06-20 19:31:07,680 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:31:07,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:07,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:07,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 19:31:07,680 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:31:07,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:07,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1523058016, now seen corresponding path program 1 times [2024-06-20 19:31:07,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:07,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026187467] [2024-06-20 19:31:07,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:07,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:13,665 INFO 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:31:13,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:13,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026187467] [2024-06-20 19:31:13,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026187467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:13,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:13,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:31:13,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512972044] [2024-06-20 19:31:13,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:13,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:31:13,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:13,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:31:13,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:31:13,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:31:13,734 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:31:13,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:13,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:31:13,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:13,975 INFO L124 PetriNetUnfolderBase]: 147/294 cut-off events. [2024-06-20 19:31:13,975 INFO L125 PetriNetUnfolderBase]: For 377/377 co-relation queries the response was YES. [2024-06-20 19:31:13,976 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:31:13,978 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 25 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2024-06-20 19:31:13,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 196 flow [2024-06-20 19:31:13,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:31:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:31:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2024-06-20 19:31:13,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-06-20 19:31:13,980 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:31:13,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 196 flow [2024-06-20 19:31:13,982 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:31:13,983 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 123 flow [2024-06-20 19:31:13,983 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:31:13,984 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2024-06-20 19:31:13,984 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 123 flow [2024-06-20 19:31:13,984 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:31:13,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:13,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:13,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 19:31:13,985 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:31:13,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:13,986 INFO L85 PathProgramCache]: Analyzing trace with hash 29843198, now seen corresponding path program 1 times [2024-06-20 19:31:13,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:13,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924703061] [2024-06-20 19:31:13,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:13,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:19,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:31:19,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:19,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924703061] [2024-06-20 19:31:19,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924703061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:19,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:19,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:31:19,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987268960] [2024-06-20 19:31:19,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:19,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:31:19,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:19,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:31:19,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:31:19,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:31:19,193 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:31:19,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:19,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:31:19,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:19,496 INFO L124 PetriNetUnfolderBase]: 172/329 cut-off events. [2024-06-20 19:31:19,496 INFO L125 PetriNetUnfolderBase]: For 581/581 co-relation queries the response was YES. [2024-06-20 19:31:19,504 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 1178 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:31:19,506 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 27 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2024-06-20 19:31:19,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 215 flow [2024-06-20 19:31:19,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:31:19,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:31:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2024-06-20 19:31:19,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3655913978494624 [2024-06-20 19:31:19,518 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:31:19,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 215 flow [2024-06-20 19:31:19,520 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:31:19,521 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 145 flow [2024-06-20 19:31:19,521 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:31:19,522 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2024-06-20 19:31:19,522 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 145 flow [2024-06-20 19:31:19,523 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:31:19,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:19,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:19,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 19:31:19,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:31:19,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:19,524 INFO L85 PathProgramCache]: Analyzing trace with hash -553846937, now seen corresponding path program 1 times [2024-06-20 19:31:19,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:19,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303741624] [2024-06-20 19:31:19,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:19,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:25,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:31:25,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:25,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303741624] [2024-06-20 19:31:25,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303741624] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:25,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:25,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:31:25,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478923022] [2024-06-20 19:31:25,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:25,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:31:25,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:25,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:31:25,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:31:25,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:31:25,253 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:31:25,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:25,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:31:25,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:25,552 INFO L124 PetriNetUnfolderBase]: 188/348 cut-off events. [2024-06-20 19:31:25,553 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2024-06-20 19:31:25,554 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 1218 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:31:25,556 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 31 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2024-06-20 19:31:25,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 253 flow [2024-06-20 19:31:25,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:31:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:31:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2024-06-20 19:31:25,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3817204301075269 [2024-06-20 19:31:25,558 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:31:25,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 253 flow [2024-06-20 19:31:25,562 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:31:25,563 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 161 flow [2024-06-20 19:31:25,563 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:31:25,565 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2024-06-20 19:31:25,565 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 161 flow [2024-06-20 19:31:25,565 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:31:25,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:25,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:25,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 19:31:25,566 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:31:25,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:25,566 INFO L85 PathProgramCache]: Analyzing trace with hash 703487631, now seen corresponding path program 2 times [2024-06-20 19:31:25,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:25,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680843056] [2024-06-20 19:31:25,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:25,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:30,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:31:30,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:30,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680843056] [2024-06-20 19:31:30,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680843056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:30,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:30,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:31:30,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466536555] [2024-06-20 19:31:30,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:30,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:31:30,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:30,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:31:30,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:31:30,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:31:30,671 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:31:30,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:30,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:31:30,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:30,902 INFO L124 PetriNetUnfolderBase]: 186/346 cut-off events. [2024-06-20 19:31:30,902 INFO L125 PetriNetUnfolderBase]: For 1246/1248 co-relation queries the response was YES. [2024-06-20 19:31:30,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 346 events. 186/346 cut-off events. For 1246/1248 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1230 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:31:30,904 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 27 selfloop transitions, 11 changer transitions 0/42 dead transitions. [2024-06-20 19:31:30,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 263 flow [2024-06-20 19:31:30,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:31:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:31:30,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2024-06-20 19:31:30,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2024-06-20 19:31:30,906 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:31:30,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 263 flow [2024-06-20 19:31:30,908 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:31:30,909 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 187 flow [2024-06-20 19:31:30,909 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:31:30,909 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2024-06-20 19:31:30,910 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 187 flow [2024-06-20 19:31:30,910 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:31:30,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:30,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:30,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 19:31:30,910 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:31:30,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:30,911 INFO L85 PathProgramCache]: Analyzing trace with hash 703495567, now seen corresponding path program 1 times [2024-06-20 19:31:30,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:30,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910290967] [2024-06-20 19:31:30,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:30,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:31:36,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:36,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910290967] [2024-06-20 19:31:36,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910290967] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:36,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:36,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:31:36,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544597776] [2024-06-20 19:31:36,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:36,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:31:36,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:36,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:31:36,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:31:36,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:31:36,893 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:31:36,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:36,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:31:36,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:37,121 INFO L124 PetriNetUnfolderBase]: 171/323 cut-off events. [2024-06-20 19:31:37,121 INFO L125 PetriNetUnfolderBase]: For 1225/1225 co-relation queries the response was YES. [2024-06-20 19:31:37,122 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 1132 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:31:37,124 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 32 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2024-06-20 19:31:37,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 297 flow [2024-06-20 19:31:37,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:31:37,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:31:37,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2024-06-20 19:31:37,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:31:37,125 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:31:37,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 297 flow [2024-06-20 19:31:37,127 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:31:37,128 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 199 flow [2024-06-20 19:31:37,128 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:31:37,129 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2024-06-20 19:31:37,129 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 199 flow [2024-06-20 19:31:37,130 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:31:37,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:37,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:37,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 19:31:37,130 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:31:37,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:37,131 INFO L85 PathProgramCache]: Analyzing trace with hash 156029843, now seen corresponding path program 1 times [2024-06-20 19:31:37,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:37,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783068016] [2024-06-20 19:31:37,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:37,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:41,715 INFO 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:31:41,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:41,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783068016] [2024-06-20 19:31:41,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783068016] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:41,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:41,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:31:41,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862749551] [2024-06-20 19:31:41,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:41,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:31:41,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:41,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:31:41,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:31:41,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:31:41,816 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:31:41,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:41,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:31:41,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:42,194 INFO L124 PetriNetUnfolderBase]: 188/349 cut-off events. [2024-06-20 19:31:42,195 INFO L125 PetriNetUnfolderBase]: For 1837/1837 co-relation queries the response was YES. [2024-06-20 19:31:42,196 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 1225 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:31:42,198 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 40 selfloop transitions, 12 changer transitions 0/56 dead transitions. [2024-06-20 19:31:42,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 56 transitions, 355 flow [2024-06-20 19:31:42,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:31:42,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:31:42,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-06-20 19:31:42,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.391705069124424 [2024-06-20 19:31:42,199 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 199 flow. Second operand 7 states and 85 transitions. [2024-06-20 19:31:42,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 56 transitions, 355 flow [2024-06-20 19:31:42,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 332 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-20 19:31:42,202 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 232 flow [2024-06-20 19:31:42,202 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=7, PETRI_FLOW=232, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2024-06-20 19:31:42,203 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2024-06-20 19:31:42,203 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 232 flow [2024-06-20 19:31:42,204 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:31:42,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:42,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:42,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-20 19:31:42,204 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:31:42,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:42,205 INFO L85 PathProgramCache]: Analyzing trace with hash 156149813, now seen corresponding path program 2 times [2024-06-20 19:31:42,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:42,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058487785] [2024-06-20 19:31:42,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:42,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:47,062 INFO 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:31:47,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:47,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058487785] [2024-06-20 19:31:47,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058487785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:47,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:47,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:31:47,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749766987] [2024-06-20 19:31:47,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:47,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:31:47,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:47,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:31:47,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:31:47,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 19:31:47,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 232 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:31:47,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:47,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 19:31:47,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:47,473 INFO L124 PetriNetUnfolderBase]: 199/367 cut-off events. [2024-06-20 19:31:47,473 INFO L125 PetriNetUnfolderBase]: For 2340/2340 co-relation queries the response was YES. [2024-06-20 19:31:47,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1522 conditions, 367 events. 199/367 cut-off events. For 2340/2340 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1299 event pairs, 49 based on Foata normal form. 2/369 useless extension candidates. Maximal degree in co-relation 1497. Up to 296 conditions per place. [2024-06-20 19:31:47,476 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 39 selfloop transitions, 16 changer transitions 0/59 dead transitions. [2024-06-20 19:31:47,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 59 transitions, 428 flow [2024-06-20 19:31:47,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:31:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:31:47,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2024-06-20 19:31:47,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-20 19:31:47,478 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 232 flow. Second operand 7 states and 93 transitions. [2024-06-20 19:31:47,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 59 transitions, 428 flow [2024-06-20 19:31:47,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 408 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-20 19:31:47,482 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 285 flow [2024-06-20 19:31:47,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=285, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-06-20 19:31:47,483 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 27 predicate places. [2024-06-20 19:31:47,483 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 285 flow [2024-06-20 19:31:47,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:31:47,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:47,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:47,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-20 19:31:47,484 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:31:47,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:47,484 INFO L85 PathProgramCache]: Analyzing trace with hash 326852429, now seen corresponding path program 1 times [2024-06-20 19:31:47,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:47,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771713246] [2024-06-20 19:31:47,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:47,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:31:52,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:52,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771713246] [2024-06-20 19:31:52,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771713246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:52,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:52,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:31:52,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866234953] [2024-06-20 19:31:52,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:52,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:31:52,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:52,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:31:52,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:31:53,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:31:53,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 285 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:31:53,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:53,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:31:53,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:53,387 INFO L124 PetriNetUnfolderBase]: 216/386 cut-off events. [2024-06-20 19:31:53,388 INFO L125 PetriNetUnfolderBase]: For 2783/2783 co-relation queries the response was YES. [2024-06-20 19:31:53,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1684 conditions, 386 events. 216/386 cut-off events. For 2783/2783 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1337 event pairs, 51 based on Foata normal form. 1/387 useless extension candidates. Maximal degree in co-relation 1658. Up to 363 conditions per place. [2024-06-20 19:31:53,391 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 46 selfloop transitions, 10 changer transitions 0/58 dead transitions. [2024-06-20 19:31:53,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 58 transitions, 433 flow [2024-06-20 19:31:53,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:31:53,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:31:53,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2024-06-20 19:31:53,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34101382488479265 [2024-06-20 19:31:53,393 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 285 flow. Second operand 7 states and 74 transitions. [2024-06-20 19:31:53,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 58 transitions, 433 flow [2024-06-20 19:31:53,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 58 transitions, 411 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-20 19:31:53,397 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 304 flow [2024-06-20 19:31:53,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=304, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2024-06-20 19:31:53,400 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 31 predicate places. [2024-06-20 19:31:53,400 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 304 flow [2024-06-20 19:31:53,400 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:31:53,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:53,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:53,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-20 19:31:53,401 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:31:53,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:53,401 INFO L85 PathProgramCache]: Analyzing trace with hash 333281519, now seen corresponding path program 2 times [2024-06-20 19:31:53,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:53,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534164216] [2024-06-20 19:31:53,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:53,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:57,913 INFO 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:31:57,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:57,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534164216] [2024-06-20 19:31:57,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534164216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:57,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:57,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:31:57,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582382314] [2024-06-20 19:31:57,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:57,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:31:57,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:57,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:31:57,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:31:57,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:31:57,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 304 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:31:57,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:57,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:31:57,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:58,245 INFO L124 PetriNetUnfolderBase]: 219/392 cut-off events. [2024-06-20 19:31:58,246 INFO L125 PetriNetUnfolderBase]: For 3250/3250 co-relation queries the response was YES. [2024-06-20 19:31:58,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 392 events. 219/392 cut-off events. For 3250/3250 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1357 event pairs, 52 based on Foata normal form. 1/393 useless extension candidates. Maximal degree in co-relation 1753. Up to 352 conditions per place. [2024-06-20 19:31:58,249 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 41 selfloop transitions, 19 changer transitions 0/62 dead transitions. [2024-06-20 19:31:58,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 62 transitions, 518 flow [2024-06-20 19:31:58,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:31:58,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:31:58,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2024-06-20 19:31:58,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3346774193548387 [2024-06-20 19:31:58,251 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 304 flow. Second operand 8 states and 83 transitions. [2024-06-20 19:31:58,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 62 transitions, 518 flow [2024-06-20 19:31:58,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 489 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-20 19:31:58,255 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 374 flow [2024-06-20 19:31:58,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=374, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2024-06-20 19:31:58,256 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 35 predicate places. [2024-06-20 19:31:58,256 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 374 flow [2024-06-20 19:31:58,256 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:31:58,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:58,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:58,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-20 19:31:58,257 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:31:58,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:58,257 INFO L85 PathProgramCache]: Analyzing trace with hash 333281333, now seen corresponding path program 3 times [2024-06-20 19:31:58,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:58,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790662402] [2024-06-20 19:31:58,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:58,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:32:02,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:02,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790662402] [2024-06-20 19:32:02,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790662402] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:02,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:02,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:32:02,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752076662] [2024-06-20 19:32:02,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:02,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:32:02,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:02,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:32:02,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:32:02,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:32:02,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 374 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:32:02,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:02,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:32:02,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:02,910 INFO L124 PetriNetUnfolderBase]: 202/373 cut-off events. [2024-06-20 19:32:02,910 INFO L125 PetriNetUnfolderBase]: For 3779/3779 co-relation queries the response was YES. [2024-06-20 19:32:02,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1762 conditions, 373 events. 202/373 cut-off events. For 3779/3779 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1322 event pairs, 56 based on Foata normal form. 2/375 useless extension candidates. Maximal degree in co-relation 1732. Up to 285 conditions per place. [2024-06-20 19:32:02,912 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 39 selfloop transitions, 20 changer transitions 0/66 dead transitions. [2024-06-20 19:32:02,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 66 transitions, 566 flow [2024-06-20 19:32:02,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:32:02,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:32:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-06-20 19:32:02,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.391705069124424 [2024-06-20 19:32:02,913 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 374 flow. Second operand 7 states and 85 transitions. [2024-06-20 19:32:02,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 66 transitions, 566 flow [2024-06-20 19:32:02,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 544 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-20 19:32:02,916 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 421 flow [2024-06-20 19:32:02,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=421, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2024-06-20 19:32:02,917 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 40 predicate places. [2024-06-20 19:32:02,917 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 421 flow [2024-06-20 19:32:02,918 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:32:02,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:02,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:02,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-20 19:32:02,918 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:32:02,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:02,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1385419683, now seen corresponding path program 3 times [2024-06-20 19:32:02,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:02,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602100515] [2024-06-20 19:32:02,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:02,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:08,438 INFO 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:32:08,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:08,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602100515] [2024-06-20 19:32:08,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602100515] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:08,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:08,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:32:08,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019516447] [2024-06-20 19:32:08,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:08,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:32:08,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:08,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:32:08,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:32:08,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:32:08,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 421 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:32:08,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:08,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:32:08,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:08,839 INFO L124 PetriNetUnfolderBase]: 213/383 cut-off events. [2024-06-20 19:32:08,840 INFO L125 PetriNetUnfolderBase]: For 4125/4125 co-relation queries the response was YES. [2024-06-20 19:32:08,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 383 events. 213/383 cut-off events. For 4125/4125 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1343 event pairs, 54 based on Foata normal form. 1/384 useless extension candidates. Maximal degree in co-relation 1856. Up to 344 conditions per place. [2024-06-20 19:32:08,843 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 41 selfloop transitions, 19 changer transitions 0/62 dead transitions. [2024-06-20 19:32:08,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 62 transitions, 555 flow [2024-06-20 19:32:08,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:32:08,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:32:08,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2024-06-20 19:32:08,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34101382488479265 [2024-06-20 19:32:08,845 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 421 flow. Second operand 7 states and 74 transitions. [2024-06-20 19:32:08,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 62 transitions, 555 flow [2024-06-20 19:32:08,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 62 transitions, 492 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-20 19:32:08,850 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 401 flow [2024-06-20 19:32:08,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2024-06-20 19:32:08,851 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 42 predicate places. [2024-06-20 19:32:08,851 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 401 flow [2024-06-20 19:32:08,852 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:32:08,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:08,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:08,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-20 19:32:08,852 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:32:08,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:08,853 INFO L85 PathProgramCache]: Analyzing trace with hash -45321528, now seen corresponding path program 1 times [2024-06-20 19:32:08,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:08,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407858696] [2024-06-20 19:32:08,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:08,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:13,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:32:13,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:13,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407858696] [2024-06-20 19:32:13,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407858696] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:13,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:13,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:32:13,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198497206] [2024-06-20 19:32:13,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:13,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:32:13,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:13,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:32:13,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:32:13,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:32:13,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 401 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:32:13,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:13,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:32:13,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:14,200 INFO L124 PetriNetUnfolderBase]: 229/422 cut-off events. [2024-06-20 19:32:14,200 INFO L125 PetriNetUnfolderBase]: For 4682/4682 co-relation queries the response was YES. [2024-06-20 19:32:14,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2046 conditions, 422 events. 229/422 cut-off events. For 4682/4682 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1564 event pairs, 47 based on Foata normal form. 1/423 useless extension candidates. Maximal degree in co-relation 2012. Up to 336 conditions per place. [2024-06-20 19:32:14,203 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 55 selfloop transitions, 22 changer transitions 0/84 dead transitions. [2024-06-20 19:32:14,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 84 transitions, 710 flow [2024-06-20 19:32:14,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:32:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:32:14,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-20 19:32:14,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911290322580645 [2024-06-20 19:32:14,205 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 401 flow. Second operand 8 states and 97 transitions. [2024-06-20 19:32:14,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 84 transitions, 710 flow [2024-06-20 19:32:14,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 84 transitions, 663 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-20 19:32:14,211 INFO L231 Difference]: Finished difference. Result has 76 places, 70 transitions, 545 flow [2024-06-20 19:32:14,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=545, PETRI_PLACES=76, PETRI_TRANSITIONS=70} [2024-06-20 19:32:14,212 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2024-06-20 19:32:14,212 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 70 transitions, 545 flow [2024-06-20 19:32:14,212 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:32:14,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:14,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:14,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-20 19:32:14,213 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:32:14,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:14,214 INFO L85 PathProgramCache]: Analyzing trace with hash 325269062, now seen corresponding path program 2 times [2024-06-20 19:32:14,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:14,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118279316] [2024-06-20 19:32:14,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:14,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:18,987 INFO 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:32:18,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:18,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118279316] [2024-06-20 19:32:18,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118279316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:18,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:18,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:32:18,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575138272] [2024-06-20 19:32:18,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:18,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:32:18,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:18,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:32:18,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:32:19,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:32:19,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 545 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:32:19,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:19,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:32:19,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:19,428 INFO L124 PetriNetUnfolderBase]: 228/420 cut-off events. [2024-06-20 19:32:19,428 INFO L125 PetriNetUnfolderBase]: For 5189/5189 co-relation queries the response was YES. [2024-06-20 19:32:19,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2114 conditions, 420 events. 228/420 cut-off events. For 5189/5189 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1560 event pairs, 50 based on Foata normal form. 1/421 useless extension candidates. Maximal degree in co-relation 2077. Up to 321 conditions per place. [2024-06-20 19:32:19,432 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 48 selfloop transitions, 26 changer transitions 0/81 dead transitions. [2024-06-20 19:32:19,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 723 flow [2024-06-20 19:32:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:32:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:32:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-06-20 19:32:19,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.391705069124424 [2024-06-20 19:32:19,434 INFO L175 Difference]: Start difference. First operand has 76 places, 70 transitions, 545 flow. Second operand 7 states and 85 transitions. [2024-06-20 19:32:19,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 81 transitions, 723 flow [2024-06-20 19:32:19,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 81 transitions, 689 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-20 19:32:19,442 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 579 flow [2024-06-20 19:32:19,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=579, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2024-06-20 19:32:19,442 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 50 predicate places. [2024-06-20 19:32:19,443 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 579 flow [2024-06-20 19:32:19,443 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:32:19,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:19,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:19,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-20 19:32:19,443 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:32:19,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:19,444 INFO L85 PathProgramCache]: Analyzing trace with hash 325359427, now seen corresponding path program 1 times [2024-06-20 19:32:19,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:19,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313630549] [2024-06-20 19:32:19,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:19,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:24,825 INFO 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:32:24,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:24,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313630549] [2024-06-20 19:32:24,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313630549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:24,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:24,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:32:24,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23913615] [2024-06-20 19:32:24,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:24,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:32:24,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:24,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:32:24,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:32:24,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:32:24,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 579 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:32:24,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:24,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:32:24,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:25,337 INFO L124 PetriNetUnfolderBase]: 246/442 cut-off events. [2024-06-20 19:32:25,337 INFO L125 PetriNetUnfolderBase]: For 5968/5968 co-relation queries the response was YES. [2024-06-20 19:32:25,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2278 conditions, 442 events. 246/442 cut-off events. For 5968/5968 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1617 event pairs, 50 based on Foata normal form. 2/444 useless extension candidates. Maximal degree in co-relation 2240. Up to 359 conditions per place. [2024-06-20 19:32:25,342 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 59 selfloop transitions, 25 changer transitions 0/86 dead transitions. [2024-06-20 19:32:25,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 86 transitions, 809 flow [2024-06-20 19:32:25,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:32:25,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:32:25,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-20 19:32:25,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:32:25,344 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 579 flow. Second operand 8 states and 88 transitions. [2024-06-20 19:32:25,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 86 transitions, 809 flow [2024-06-20 19:32:25,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 86 transitions, 749 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-20 19:32:25,352 INFO L231 Difference]: Finished difference. Result has 82 places, 72 transitions, 597 flow [2024-06-20 19:32:25,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=597, PETRI_PLACES=82, PETRI_TRANSITIONS=72} [2024-06-20 19:32:25,353 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 52 predicate places. [2024-06-20 19:32:25,353 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 72 transitions, 597 flow [2024-06-20 19:32:25,355 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:32:25,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:25,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:25,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-20 19:32:25,356 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:32:25,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:25,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1512759876, now seen corresponding path program 1 times [2024-06-20 19:32:25,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:25,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067723469] [2024-06-20 19:32:25,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:25,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:32:31,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:31,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067723469] [2024-06-20 19:32:31,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067723469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:31,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:31,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:32:31,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791904761] [2024-06-20 19:32:31,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:31,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:32:31,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:31,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:32:31,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:32:31,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:32:31,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 72 transitions, 597 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:32:31,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:31,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:32:31,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:31,696 INFO L124 PetriNetUnfolderBase]: 249/447 cut-off events. [2024-06-20 19:32:31,696 INFO L125 PetriNetUnfolderBase]: For 5937/5937 co-relation queries the response was YES. [2024-06-20 19:32:31,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2338 conditions, 447 events. 249/447 cut-off events. For 5937/5937 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1648 event pairs, 52 based on Foata normal form. 1/448 useless extension candidates. Maximal degree in co-relation 2299. Up to 414 conditions per place. [2024-06-20 19:32:31,701 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 66 selfloop transitions, 15 changer transitions 0/83 dead transitions. [2024-06-20 19:32:31,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 83 transitions, 795 flow [2024-06-20 19:32:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:32:31,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:32:31,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-06-20 19:32:31,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33064516129032256 [2024-06-20 19:32:31,703 INFO L175 Difference]: Start difference. First operand has 82 places, 72 transitions, 597 flow. Second operand 8 states and 82 transitions. [2024-06-20 19:32:31,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 83 transitions, 795 flow [2024-06-20 19:32:31,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 83 transitions, 735 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-20 19:32:31,711 INFO L231 Difference]: Finished difference. Result has 84 places, 74 transitions, 590 flow [2024-06-20 19:32:31,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=590, PETRI_PLACES=84, PETRI_TRANSITIONS=74} [2024-06-20 19:32:31,712 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2024-06-20 19:32:31,712 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 590 flow [2024-06-20 19:32:31,712 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:32:31,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:31,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:31,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-20 19:32:31,713 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:32:31,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:31,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1512759659, now seen corresponding path program 2 times [2024-06-20 19:32:31,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:31,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857813770] [2024-06-20 19:32:31,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:31,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:37,091 INFO 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:32:37,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:37,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857813770] [2024-06-20 19:32:37,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857813770] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:37,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:37,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:32:37,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191599867] [2024-06-20 19:32:37,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:37,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:32:37,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:37,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:32:37,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:32:37,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:32:37,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 74 transitions, 590 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:32:37,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:37,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:32:37,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:37,542 INFO L124 PetriNetUnfolderBase]: 265/473 cut-off events. [2024-06-20 19:32:37,542 INFO L125 PetriNetUnfolderBase]: For 7063/7063 co-relation queries the response was YES. [2024-06-20 19:32:37,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2515 conditions, 473 events. 265/473 cut-off events. For 7063/7063 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1761 event pairs, 50 based on Foata normal form. 2/475 useless extension candidates. Maximal degree in co-relation 2475. Up to 347 conditions per place. [2024-06-20 19:32:37,548 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 55 selfloop transitions, 34 changer transitions 0/91 dead transitions. [2024-06-20 19:32:37,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 91 transitions, 884 flow [2024-06-20 19:32:37,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:32:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:32:37,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2024-06-20 19:32:37,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-06-20 19:32:37,550 INFO L175 Difference]: Start difference. First operand has 84 places, 74 transitions, 590 flow. Second operand 8 states and 90 transitions. [2024-06-20 19:32:37,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 91 transitions, 884 flow [2024-06-20 19:32:37,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 91 transitions, 847 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-20 19:32:37,565 INFO L231 Difference]: Finished difference. Result has 86 places, 78 transitions, 674 flow [2024-06-20 19:32:37,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=674, PETRI_PLACES=86, PETRI_TRANSITIONS=78} [2024-06-20 19:32:37,566 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 56 predicate places. [2024-06-20 19:32:37,566 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 78 transitions, 674 flow [2024-06-20 19:32:37,566 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:32:37,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:37,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:37,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-20 19:32:37,567 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:32:37,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:37,568 INFO L85 PathProgramCache]: Analyzing trace with hash 545678345, now seen corresponding path program 3 times [2024-06-20 19:32:37,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:37,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602778159] [2024-06-20 19:32:37,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:37,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:43,108 INFO 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:32:43,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:43,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602778159] [2024-06-20 19:32:43,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602778159] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:43,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:43,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:32:43,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217114279] [2024-06-20 19:32:43,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:43,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:32:43,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:43,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:32:43,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:32:43,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:32:43,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 78 transitions, 674 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:32:43,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:43,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:32:43,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:43,534 INFO L124 PetriNetUnfolderBase]: 266/475 cut-off events. [2024-06-20 19:32:43,534 INFO L125 PetriNetUnfolderBase]: For 7786/7786 co-relation queries the response was YES. [2024-06-20 19:32:43,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2637 conditions, 475 events. 266/475 cut-off events. For 7786/7786 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1777 event pairs, 56 based on Foata normal form. 2/477 useless extension candidates. Maximal degree in co-relation 2596. Up to 350 conditions per place. [2024-06-20 19:32:43,539 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 59 selfloop transitions, 32 changer transitions 0/93 dead transitions. [2024-06-20 19:32:43,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 93 transitions, 956 flow [2024-06-20 19:32:43,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:32:43,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:32:43,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-20 19:32:43,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36693548387096775 [2024-06-20 19:32:43,542 INFO L175 Difference]: Start difference. First operand has 86 places, 78 transitions, 674 flow. Second operand 8 states and 91 transitions. [2024-06-20 19:32:43,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 93 transitions, 956 flow [2024-06-20 19:32:43,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 93 transitions, 898 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-20 19:32:43,553 INFO L231 Difference]: Finished difference. Result has 90 places, 80 transitions, 711 flow [2024-06-20 19:32:43,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=711, PETRI_PLACES=90, PETRI_TRANSITIONS=80} [2024-06-20 19:32:43,553 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 60 predicate places. [2024-06-20 19:32:43,553 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 80 transitions, 711 flow [2024-06-20 19:32:43,554 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:32:43,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:43,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:43,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-20 19:32:43,554 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:32:43,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:43,555 INFO L85 PathProgramCache]: Analyzing trace with hash -5687611, now seen corresponding path program 4 times [2024-06-20 19:32:43,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:43,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404944734] [2024-06-20 19:32:43,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:43,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:49,410 INFO 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:32:49,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:49,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404944734] [2024-06-20 19:32:49,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404944734] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:49,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:49,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:32:49,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898901598] [2024-06-20 19:32:49,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:49,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:32:49,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:49,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:32:49,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:32:49,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:32:49,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 80 transitions, 711 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:32:49,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:49,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:32:49,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:49,791 INFO L124 PetriNetUnfolderBase]: 282/502 cut-off events. [2024-06-20 19:32:49,791 INFO L125 PetriNetUnfolderBase]: For 9048/9048 co-relation queries the response was YES. [2024-06-20 19:32:49,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2884 conditions, 502 events. 282/502 cut-off events. For 9048/9048 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1912 event pairs, 67 based on Foata normal form. 2/504 useless extension candidates. Maximal degree in co-relation 2841. Up to 329 conditions per place. [2024-06-20 19:32:49,796 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 55 selfloop transitions, 43 changer transitions 0/100 dead transitions. [2024-06-20 19:32:49,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 100 transitions, 1143 flow [2024-06-20 19:32:49,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:32:49,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:32:49,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-20 19:32:49,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38306451612903225 [2024-06-20 19:32:49,797 INFO L175 Difference]: Start difference. First operand has 90 places, 80 transitions, 711 flow. Second operand 8 states and 95 transitions. [2024-06-20 19:32:49,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 100 transitions, 1143 flow [2024-06-20 19:32:49,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 100 transitions, 1085 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-20 19:32:49,805 INFO L231 Difference]: Finished difference. Result has 93 places, 86 transitions, 826 flow [2024-06-20 19:32:49,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=826, PETRI_PLACES=93, PETRI_TRANSITIONS=86} [2024-06-20 19:32:49,806 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 63 predicate places. [2024-06-20 19:32:49,806 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 86 transitions, 826 flow [2024-06-20 19:32:49,806 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:32:49,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:49,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:49,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-20 19:32:49,807 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:32:49,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:49,807 INFO L85 PathProgramCache]: Analyzing trace with hash -5687394, now seen corresponding path program 2 times [2024-06-20 19:32:49,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:49,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458798433] [2024-06-20 19:32:49,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:49,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:55,715 INFO 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:32:55,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:55,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458798433] [2024-06-20 19:32:55,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458798433] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:55,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:55,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:32:55,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006383438] [2024-06-20 19:32:55,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:55,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:32:55,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:55,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:32:55,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:32:55,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:32:55,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 86 transitions, 826 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:32:55,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:55,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:32:55,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:56,061 INFO L124 PetriNetUnfolderBase]: 285/507 cut-off events. [2024-06-20 19:32:56,061 INFO L125 PetriNetUnfolderBase]: For 9811/9811 co-relation queries the response was YES. [2024-06-20 19:32:56,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3000 conditions, 507 events. 285/507 cut-off events. For 9811/9811 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1928 event pairs, 61 based on Foata normal form. 1/508 useless extension candidates. Maximal degree in co-relation 2956. Up to 446 conditions per place. [2024-06-20 19:32:56,065 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 73 selfloop transitions, 25 changer transitions 0/100 dead transitions. [2024-06-20 19:32:56,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 100 transitions, 1126 flow [2024-06-20 19:32:56,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:32:56,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:32:56,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-20 19:32:56,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3467741935483871 [2024-06-20 19:32:56,066 INFO L175 Difference]: Start difference. First operand has 93 places, 86 transitions, 826 flow. Second operand 8 states and 86 transitions. [2024-06-20 19:32:56,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 100 transitions, 1126 flow [2024-06-20 19:32:56,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 100 transitions, 1028 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-06-20 19:32:56,077 INFO L231 Difference]: Finished difference. Result has 98 places, 92 transitions, 844 flow [2024-06-20 19:32:56,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=844, PETRI_PLACES=98, PETRI_TRANSITIONS=92} [2024-06-20 19:32:56,077 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 68 predicate places. [2024-06-20 19:32:56,077 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 92 transitions, 844 flow [2024-06-20 19:32:56,078 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:32:56,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:56,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:56,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-20 19:32:56,078 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:32:56,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:56,079 INFO L85 PathProgramCache]: Analyzing trace with hash -5693191, now seen corresponding path program 5 times [2024-06-20 19:32:56,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:56,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380117664] [2024-06-20 19:32:56,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:56,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:01,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:33:01,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:01,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380117664] [2024-06-20 19:33:01,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380117664] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:01,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:01,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:33:01,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309715628] [2024-06-20 19:33:01,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:01,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:33:01,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:01,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:33:01,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:33:01,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:33:01,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 92 transitions, 844 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:33:01,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:01,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:33:01,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:02,217 INFO L124 PetriNetUnfolderBase]: 281/501 cut-off events. [2024-06-20 19:33:02,217 INFO L125 PetriNetUnfolderBase]: For 10068/10068 co-relation queries the response was YES. [2024-06-20 19:33:02,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2919 conditions, 501 events. 281/501 cut-off events. For 10068/10068 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1908 event pairs, 67 based on Foata normal form. 2/503 useless extension candidates. Maximal degree in co-relation 2873. Up to 331 conditions per place. [2024-06-20 19:33:02,220 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 58 selfloop transitions, 44 changer transitions 0/104 dead transitions. [2024-06-20 19:33:02,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 104 transitions, 1168 flow [2024-06-20 19:33:02,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:33:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:33:02,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-20 19:33:02,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-20 19:33:02,221 INFO L175 Difference]: Start difference. First operand has 98 places, 92 transitions, 844 flow. Second operand 8 states and 92 transitions. [2024-06-20 19:33:02,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 104 transitions, 1168 flow [2024-06-20 19:33:02,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 104 transitions, 1128 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-20 19:33:02,235 INFO L231 Difference]: Finished difference. Result has 103 places, 92 transitions, 897 flow [2024-06-20 19:33:02,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=897, PETRI_PLACES=103, PETRI_TRANSITIONS=92} [2024-06-20 19:33:02,236 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2024-06-20 19:33:02,236 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 92 transitions, 897 flow [2024-06-20 19:33:02,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:33:02,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:02,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:33:02,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-20 19:33:02,237 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:33:02,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:02,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1931166, now seen corresponding path program 3 times [2024-06-20 19:33:02,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:02,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697068975] [2024-06-20 19:33:02,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:02,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:08,048 INFO 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:33:08,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:08,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697068975] [2024-06-20 19:33:08,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697068975] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:08,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:08,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:33:08,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300160506] [2024-06-20 19:33:08,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:08,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:33:08,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:08,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:33:08,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:33:08,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:33:08,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 92 transitions, 897 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:33:08,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:08,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:33:08,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:08,411 INFO L124 PetriNetUnfolderBase]: 284/506 cut-off events. [2024-06-20 19:33:08,412 INFO L125 PetriNetUnfolderBase]: For 10792/10792 co-relation queries the response was YES. [2024-06-20 19:33:08,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3062 conditions, 506 events. 284/506 cut-off events. For 10792/10792 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1917 event pairs, 60 based on Foata normal form. 1/507 useless extension candidates. Maximal degree in co-relation 3014. Up to 444 conditions per place. [2024-06-20 19:33:08,415 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 70 selfloop transitions, 30 changer transitions 0/102 dead transitions. [2024-06-20 19:33:08,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 102 transitions, 1183 flow [2024-06-20 19:33:08,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:33:08,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:33:08,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2024-06-20 19:33:08,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-20 19:33:08,417 INFO L175 Difference]: Start difference. First operand has 103 places, 92 transitions, 897 flow. Second operand 8 states and 84 transitions. [2024-06-20 19:33:08,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 102 transitions, 1183 flow [2024-06-20 19:33:08,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 102 transitions, 1097 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-20 19:33:08,428 INFO L231 Difference]: Finished difference. Result has 105 places, 94 transitions, 898 flow [2024-06-20 19:33:08,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=898, PETRI_PLACES=105, PETRI_TRANSITIONS=94} [2024-06-20 19:33:08,428 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 75 predicate places. [2024-06-20 19:33:08,428 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 94 transitions, 898 flow [2024-06-20 19:33:08,428 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:33:08,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:08,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:33:08,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-20 19:33:08,429 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:33:08,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:08,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1664256, now seen corresponding path program 4 times [2024-06-20 19:33:08,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:08,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142586271] [2024-06-20 19:33:08,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:08,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:14,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:33:14,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:14,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142586271] [2024-06-20 19:33:14,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142586271] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:14,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:14,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:33:14,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83306711] [2024-06-20 19:33:14,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:14,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:33:14,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:14,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:33:14,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:33:14,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:33:14,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 94 transitions, 898 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:33:14,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:14,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:33:14,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:14,906 INFO L124 PetriNetUnfolderBase]: 282/503 cut-off events. [2024-06-20 19:33:14,906 INFO L125 PetriNetUnfolderBase]: For 11203/11203 co-relation queries the response was YES. [2024-06-20 19:33:14,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3007 conditions, 503 events. 282/503 cut-off events. For 11203/11203 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1928 event pairs, 60 based on Foata normal form. 1/504 useless extension candidates. Maximal degree in co-relation 2958. Up to 442 conditions per place. [2024-06-20 19:33:14,912 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 71 selfloop transitions, 28 changer transitions 0/101 dead transitions. [2024-06-20 19:33:14,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 101 transitions, 1112 flow [2024-06-20 19:33:14,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:33:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:33:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2024-06-20 19:33:14,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-20 19:33:14,921 INFO L175 Difference]: Start difference. First operand has 105 places, 94 transitions, 898 flow. Second operand 8 states and 84 transitions. [2024-06-20 19:33:14,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 101 transitions, 1112 flow [2024-06-20 19:33:14,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 101 transitions, 1039 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-20 19:33:14,932 INFO L231 Difference]: Finished difference. Result has 108 places, 94 transitions, 886 flow [2024-06-20 19:33:14,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=886, PETRI_PLACES=108, PETRI_TRANSITIONS=94} [2024-06-20 19:33:14,932 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 78 predicate places. [2024-06-20 19:33:14,933 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 94 transitions, 886 flow [2024-06-20 19:33:14,933 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:33:14,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:14,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:33:14,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-20 19:33:14,933 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:33:14,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:14,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1664039, now seen corresponding path program 6 times [2024-06-20 19:33:14,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:14,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984126490] [2024-06-20 19:33:14,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:14,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:20,691 INFO 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:33:20,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:20,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984126490] [2024-06-20 19:33:20,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984126490] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:20,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:20,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:33:20,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013210757] [2024-06-20 19:33:20,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:20,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:33:20,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:20,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:33:20,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:33:20,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:33:20,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 94 transitions, 886 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:33:20,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:20,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:33:20,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:21,054 INFO L124 PetriNetUnfolderBase]: 278/497 cut-off events. [2024-06-20 19:33:21,054 INFO L125 PetriNetUnfolderBase]: For 11675/11675 co-relation queries the response was YES. [2024-06-20 19:33:21,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2948 conditions, 497 events. 278/497 cut-off events. For 11675/11675 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1890 event pairs, 62 based on Foata normal form. 2/499 useless extension candidates. Maximal degree in co-relation 2898. Up to 330 conditions per place. [2024-06-20 19:33:21,059 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 54 selfloop transitions, 49 changer transitions 0/105 dead transitions. [2024-06-20 19:33:21,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 105 transitions, 1172 flow [2024-06-20 19:33:21,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:33:21,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:33:21,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2024-06-20 19:33:21,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-06-20 19:33:21,060 INFO L175 Difference]: Start difference. First operand has 108 places, 94 transitions, 886 flow. Second operand 8 states and 90 transitions. [2024-06-20 19:33:21,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 105 transitions, 1172 flow [2024-06-20 19:33:21,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 105 transitions, 1109 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-20 19:33:21,076 INFO L231 Difference]: Finished difference. Result has 110 places, 94 transitions, 926 flow [2024-06-20 19:33:21,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=926, PETRI_PLACES=110, PETRI_TRANSITIONS=94} [2024-06-20 19:33:21,076 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 80 predicate places. [2024-06-20 19:33:21,076 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 94 transitions, 926 flow [2024-06-20 19:33:21,077 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:33:21,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:21,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:33:21,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-20 19:33:21,077 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:33:21,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:21,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1941086, now seen corresponding path program 1 times [2024-06-20 19:33:21,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:21,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983558222] [2024-06-20 19:33:21,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:21,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:27,030 INFO 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:33:27,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:27,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983558222] [2024-06-20 19:33:27,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983558222] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:27,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:27,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:33:27,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337921817] [2024-06-20 19:33:27,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:27,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:33:27,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:27,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:33:27,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:33:27,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:33:27,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 94 transitions, 926 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:33:27,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:27,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:33:27,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:27,451 INFO L124 PetriNetUnfolderBase]: 276/493 cut-off events. [2024-06-20 19:33:27,451 INFO L125 PetriNetUnfolderBase]: For 11953/11953 co-relation queries the response was YES. [2024-06-20 19:33:27,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3001 conditions, 493 events. 276/493 cut-off events. For 11953/11953 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1869 event pairs, 62 based on Foata normal form. 1/494 useless extension candidates. Maximal degree in co-relation 2950. Up to 467 conditions per place. [2024-06-20 19:33:27,455 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 88 selfloop transitions, 14 changer transitions 0/104 dead transitions. [2024-06-20 19:33:27,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 104 transitions, 1160 flow [2024-06-20 19:33:27,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:33:27,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:33:27,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2024-06-20 19:33:27,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3118279569892473 [2024-06-20 19:33:27,457 INFO L175 Difference]: Start difference. First operand has 110 places, 94 transitions, 926 flow. Second operand 9 states and 87 transitions. [2024-06-20 19:33:27,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 104 transitions, 1160 flow [2024-06-20 19:33:27,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 104 transitions, 1046 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-20 19:33:27,471 INFO L231 Difference]: Finished difference. Result has 111 places, 96 transitions, 861 flow [2024-06-20 19:33:27,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=861, PETRI_PLACES=111, PETRI_TRANSITIONS=96} [2024-06-20 19:33:27,472 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 81 predicate places. [2024-06-20 19:33:27,472 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 96 transitions, 861 flow [2024-06-20 19:33:27,472 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:33:27,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:27,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:33:27,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-20 19:33:27,473 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:33:27,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:27,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1493347194, now seen corresponding path program 1 times [2024-06-20 19:33:27,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:27,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755219531] [2024-06-20 19:33:27,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:27,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:32,434 INFO 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:33:32,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:32,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755219531] [2024-06-20 19:33:32,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755219531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:32,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:32,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:33:32,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963494204] [2024-06-20 19:33:32,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:32,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:33:32,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:32,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:33:32,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:33:32,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:33:32,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 96 transitions, 861 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:33:32,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:32,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:33:32,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:32,951 INFO L124 PetriNetUnfolderBase]: 261/482 cut-off events. [2024-06-20 19:33:32,951 INFO L125 PetriNetUnfolderBase]: For 12886/12886 co-relation queries the response was YES. [2024-06-20 19:33:32,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2907 conditions, 482 events. 261/482 cut-off events. For 12886/12886 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1916 event pairs, 33 based on Foata normal form. 2/484 useless extension candidates. Maximal degree in co-relation 2855. Up to 358 conditions per place. [2024-06-20 19:33:32,954 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 76 selfloop transitions, 20 changer transitions 0/110 dead transitions. [2024-06-20 19:33:32,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 110 transitions, 1099 flow [2024-06-20 19:33:32,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:33:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:33:32,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2024-06-20 19:33:32,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-20 19:33:32,955 INFO L175 Difference]: Start difference. First operand has 111 places, 96 transitions, 861 flow. Second operand 8 states and 92 transitions. [2024-06-20 19:33:32,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 110 transitions, 1099 flow [2024-06-20 19:33:32,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 110 transitions, 1018 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-20 19:33:32,967 INFO L231 Difference]: Finished difference. Result has 109 places, 97 transitions, 840 flow [2024-06-20 19:33:32,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=840, PETRI_PLACES=109, PETRI_TRANSITIONS=97} [2024-06-20 19:33:32,968 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 79 predicate places. [2024-06-20 19:33:32,968 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 97 transitions, 840 flow [2024-06-20 19:33:32,968 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:33:32,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:32,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:33:32,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-20 19:33:32,969 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:33:32,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:32,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1606911478, now seen corresponding path program 1 times [2024-06-20 19:33:32,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:32,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55724284] [2024-06-20 19:33:32,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:32,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:38,500 INFO 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:33:38,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:38,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55724284] [2024-06-20 19:33:38,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55724284] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:38,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:38,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:33:38,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714007969] [2024-06-20 19:33:38,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:38,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:33:38,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:38,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:33:38,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:33:38,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:33:38,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 97 transitions, 840 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:33:38,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:38,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:33:38,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:38,975 INFO L124 PetriNetUnfolderBase]: 278/498 cut-off events. [2024-06-20 19:33:38,976 INFO L125 PetriNetUnfolderBase]: For 12866/12866 co-relation queries the response was YES. [2024-06-20 19:33:38,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2970 conditions, 498 events. 278/498 cut-off events. For 12866/12866 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1912 event pairs, 50 based on Foata normal form. 1/499 useless extension candidates. Maximal degree in co-relation 2918. Up to 402 conditions per place. [2024-06-20 19:33:38,979 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 78 selfloop transitions, 30 changer transitions 0/110 dead transitions. [2024-06-20 19:33:38,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 110 transitions, 1092 flow [2024-06-20 19:33:38,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:33:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:33:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-20 19:33:38,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:33:38,980 INFO L175 Difference]: Start difference. First operand has 109 places, 97 transitions, 840 flow. Second operand 8 states and 88 transitions. [2024-06-20 19:33:38,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 110 transitions, 1092 flow [2024-06-20 19:33:38,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 110 transitions, 1034 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-20 19:33:38,992 INFO L231 Difference]: Finished difference. Result has 111 places, 97 transitions, 852 flow [2024-06-20 19:33:38,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=852, PETRI_PLACES=111, PETRI_TRANSITIONS=97} [2024-06-20 19:33:38,992 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 81 predicate places. [2024-06-20 19:33:38,992 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 97 transitions, 852 flow [2024-06-20 19:33:38,993 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:33:38,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:38,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:33:38,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-20 19:33:38,993 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:33:38,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:38,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1493407644, now seen corresponding path program 2 times [2024-06-20 19:33:38,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:38,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377294959] [2024-06-20 19:33:38,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:38,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:44,715 INFO 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:33:44,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:44,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377294959] [2024-06-20 19:33:44,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377294959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:44,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:44,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:33:44,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710607936] [2024-06-20 19:33:44,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:44,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:33:44,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:44,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:33:44,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:33:44,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:33:44,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 97 transitions, 852 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:33:44,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:44,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:33:44,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:45,166 INFO L124 PetriNetUnfolderBase]: 264/488 cut-off events. [2024-06-20 19:33:45,166 INFO L125 PetriNetUnfolderBase]: For 14637/14637 co-relation queries the response was YES. [2024-06-20 19:33:45,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2965 conditions, 488 events. 264/488 cut-off events. For 14637/14637 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1935 event pairs, 48 based on Foata normal form. 2/490 useless extension candidates. Maximal degree in co-relation 2912. Up to 363 conditions per place. [2024-06-20 19:33:45,170 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 70 selfloop transitions, 27 changer transitions 0/111 dead transitions. [2024-06-20 19:33:45,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 111 transitions, 1096 flow [2024-06-20 19:33:45,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:33:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:33:45,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-20 19:33:45,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2024-06-20 19:33:45,171 INFO L175 Difference]: Start difference. First operand has 111 places, 97 transitions, 852 flow. Second operand 8 states and 94 transitions. [2024-06-20 19:33:45,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 111 transitions, 1096 flow [2024-06-20 19:33:45,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 111 transitions, 1007 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-20 19:33:45,185 INFO L231 Difference]: Finished difference. Result has 111 places, 98 transitions, 842 flow [2024-06-20 19:33:45,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=842, PETRI_PLACES=111, PETRI_TRANSITIONS=98} [2024-06-20 19:33:45,186 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 81 predicate places. [2024-06-20 19:33:45,186 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 98 transitions, 842 flow [2024-06-20 19:33:45,186 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:33:45,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:45,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:33:45,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-20 19:33:45,186 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:33:45,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:45,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1496209114, now seen corresponding path program 1 times [2024-06-20 19:33:45,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:45,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145521267] [2024-06-20 19:33:45,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:45,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:50,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:33:50,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:50,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145521267] [2024-06-20 19:33:50,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145521267] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:50,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:50,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:33:50,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548183261] [2024-06-20 19:33:50,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:50,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:33:50,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:50,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:33:50,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:33:50,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:33:50,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 98 transitions, 842 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:33:50,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:50,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:33:50,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:50,911 INFO L124 PetriNetUnfolderBase]: 288/516 cut-off events. [2024-06-20 19:33:50,911 INFO L125 PetriNetUnfolderBase]: For 15495/15495 co-relation queries the response was YES. [2024-06-20 19:33:50,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3100 conditions, 516 events. 288/516 cut-off events. For 15495/15495 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2009 event pairs, 48 based on Foata normal form. 2/518 useless extension candidates. Maximal degree in co-relation 3046. Up to 425 conditions per place. [2024-06-20 19:33:50,914 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 87 selfloop transitions, 27 changer transitions 0/116 dead transitions. [2024-06-20 19:33:50,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 116 transitions, 1140 flow [2024-06-20 19:33:50,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:33:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:33:50,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-20 19:33:50,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-20 19:33:50,916 INFO L175 Difference]: Start difference. First operand has 111 places, 98 transitions, 842 flow. Second operand 9 states and 97 transitions. [2024-06-20 19:33:50,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 116 transitions, 1140 flow [2024-06-20 19:33:50,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 116 transitions, 1077 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-20 19:33:50,940 INFO L231 Difference]: Finished difference. Result has 114 places, 100 transitions, 862 flow [2024-06-20 19:33:50,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=862, PETRI_PLACES=114, PETRI_TRANSITIONS=100} [2024-06-20 19:33:50,941 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 84 predicate places. [2024-06-20 19:33:50,941 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 100 transitions, 862 flow [2024-06-20 19:33:50,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:33:50,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:50,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:33:50,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-20 19:33:50,942 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:33:50,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:50,942 INFO L85 PathProgramCache]: Analyzing trace with hash -263666040, now seen corresponding path program 2 times [2024-06-20 19:33:50,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:50,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176334493] [2024-06-20 19:33:50,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:50,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:56,481 INFO 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:33:56,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:56,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176334493] [2024-06-20 19:33:56,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176334493] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:56,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:56,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:33:56,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480137679] [2024-06-20 19:33:56,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:56,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:33:56,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:56,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:33:56,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:33:56,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:33:56,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 100 transitions, 862 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:33:56,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:56,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:33:56,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:56,935 INFO L124 PetriNetUnfolderBase]: 314/558 cut-off events. [2024-06-20 19:33:56,936 INFO L125 PetriNetUnfolderBase]: For 18451/18451 co-relation queries the response was YES. [2024-06-20 19:33:56,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3475 conditions, 558 events. 314/558 cut-off events. For 18451/18451 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2201 event pairs, 54 based on Foata normal form. 2/560 useless extension candidates. Maximal degree in co-relation 3420. Up to 393 conditions per place. [2024-06-20 19:33:56,941 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 78 selfloop transitions, 42 changer transitions 0/122 dead transitions. [2024-06-20 19:33:56,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 122 transitions, 1342 flow [2024-06-20 19:33:56,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:33:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:33:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-20 19:33:56,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3655913978494624 [2024-06-20 19:33:56,942 INFO L175 Difference]: Start difference. First operand has 114 places, 100 transitions, 862 flow. Second operand 9 states and 102 transitions. [2024-06-20 19:33:56,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 122 transitions, 1342 flow [2024-06-20 19:33:56,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 122 transitions, 1275 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-20 19:33:56,966 INFO L231 Difference]: Finished difference. Result has 116 places, 106 transitions, 960 flow [2024-06-20 19:33:56,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=960, PETRI_PLACES=116, PETRI_TRANSITIONS=106} [2024-06-20 19:33:56,967 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 86 predicate places. [2024-06-20 19:33:56,967 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 106 transitions, 960 flow [2024-06-20 19:33:56,967 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:33:56,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:56,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:33:56,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-20 19:33:56,968 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:33:56,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:56,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1463532176, now seen corresponding path program 1 times [2024-06-20 19:33:56,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:56,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624290757] [2024-06-20 19:33:56,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:56,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:34:01,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:01,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624290757] [2024-06-20 19:34:01,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624290757] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:01,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:01,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:34:01,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922093593] [2024-06-20 19:34:01,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:01,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:34:01,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:01,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:34:01,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:34:01,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:34:01,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 106 transitions, 960 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:34:01,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:01,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:34:01,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:02,180 INFO L124 PetriNetUnfolderBase]: 317/563 cut-off events. [2024-06-20 19:34:02,181 INFO L125 PetriNetUnfolderBase]: For 19329/19329 co-relation queries the response was YES. [2024-06-20 19:34:02,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3586 conditions, 563 events. 317/563 cut-off events. For 19329/19329 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2240 event pairs, 58 based on Foata normal form. 1/564 useless extension candidates. Maximal degree in co-relation 3530. Up to 527 conditions per place. [2024-06-20 19:34:02,184 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 99 selfloop transitions, 17 changer transitions 0/118 dead transitions. [2024-06-20 19:34:02,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 118 transitions, 1236 flow [2024-06-20 19:34:02,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:34:02,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:34:02,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2024-06-20 19:34:02,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-20 19:34:02,185 INFO L175 Difference]: Start difference. First operand has 116 places, 106 transitions, 960 flow. Second operand 9 states and 90 transitions. [2024-06-20 19:34:02,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 118 transitions, 1236 flow [2024-06-20 19:34:02,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 118 transitions, 1174 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-20 19:34:02,207 INFO L231 Difference]: Finished difference. Result has 121 places, 108 transitions, 961 flow [2024-06-20 19:34:02,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=961, PETRI_PLACES=121, PETRI_TRANSITIONS=108} [2024-06-20 19:34:02,207 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 91 predicate places. [2024-06-20 19:34:02,207 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 108 transitions, 961 flow [2024-06-20 19:34:02,207 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:34:02,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:02,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:34:02,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-20 19:34:02,208 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:34:02,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:02,208 INFO L85 PathProgramCache]: Analyzing trace with hash -263659530, now seen corresponding path program 3 times [2024-06-20 19:34:02,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:02,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596408927] [2024-06-20 19:34:02,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:02,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:07,764 INFO 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:34:07,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:07,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596408927] [2024-06-20 19:34:07,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596408927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:07,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:07,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:34:07,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964232266] [2024-06-20 19:34:07,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:07,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:34:07,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:07,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:34:07,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:34:07,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:34:07,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 108 transitions, 961 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:34:07,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:07,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:34:07,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:08,238 INFO L124 PetriNetUnfolderBase]: 313/557 cut-off events. [2024-06-20 19:34:08,238 INFO L125 PetriNetUnfolderBase]: For 19616/19616 co-relation queries the response was YES. [2024-06-20 19:34:08,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3537 conditions, 557 events. 313/557 cut-off events. For 19616/19616 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2213 event pairs, 52 based on Foata normal form. 2/559 useless extension candidates. Maximal degree in co-relation 3479. Up to 395 conditions per place. [2024-06-20 19:34:08,242 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 76 selfloop transitions, 45 changer transitions 0/123 dead transitions. [2024-06-20 19:34:08,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 123 transitions, 1311 flow [2024-06-20 19:34:08,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:34:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:34:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-20 19:34:08,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35842293906810035 [2024-06-20 19:34:08,243 INFO L175 Difference]: Start difference. First operand has 121 places, 108 transitions, 961 flow. Second operand 9 states and 100 transitions. [2024-06-20 19:34:08,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 123 transitions, 1311 flow [2024-06-20 19:34:08,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 123 transitions, 1250 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-20 19:34:08,264 INFO L231 Difference]: Finished difference. Result has 123 places, 108 transitions, 995 flow [2024-06-20 19:34:08,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=995, PETRI_PLACES=123, PETRI_TRANSITIONS=108} [2024-06-20 19:34:08,264 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 93 predicate places. [2024-06-20 19:34:08,265 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 108 transitions, 995 flow [2024-06-20 19:34:08,265 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:34:08,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:08,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:34:08,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-20 19:34:08,266 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:34:08,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:08,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1611495324, now seen corresponding path program 3 times [2024-06-20 19:34:08,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:08,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162560413] [2024-06-20 19:34:08,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:08,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:13,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:34:13,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:13,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162560413] [2024-06-20 19:34:13,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162560413] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:13,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:13,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:34:13,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140791815] [2024-06-20 19:34:13,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:13,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:34:13,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:13,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:34:13,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:34:14,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:34:14,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 108 transitions, 995 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:34:14,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:14,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:34:14,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:14,436 INFO L124 PetriNetUnfolderBase]: 289/533 cut-off events. [2024-06-20 19:34:14,436 INFO L125 PetriNetUnfolderBase]: For 21322/21326 co-relation queries the response was YES. [2024-06-20 19:34:14,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3550 conditions, 533 events. 289/533 cut-off events. For 21322/21326 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2208 event pairs, 49 based on Foata normal form. 2/530 useless extension candidates. Maximal degree in co-relation 3491. Up to 405 conditions per place. [2024-06-20 19:34:14,439 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 79 selfloop transitions, 28 changer transitions 0/121 dead transitions. [2024-06-20 19:34:14,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 121 transitions, 1259 flow [2024-06-20 19:34:14,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:34:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:34:14,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-20 19:34:14,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2024-06-20 19:34:14,442 INFO L175 Difference]: Start difference. First operand has 123 places, 108 transitions, 995 flow. Second operand 8 states and 94 transitions. [2024-06-20 19:34:14,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 121 transitions, 1259 flow [2024-06-20 19:34:14,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 121 transitions, 1175 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-20 19:34:14,462 INFO L231 Difference]: Finished difference. Result has 124 places, 109 transitions, 991 flow [2024-06-20 19:34:14,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=991, PETRI_PLACES=124, PETRI_TRANSITIONS=109} [2024-06-20 19:34:14,462 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 94 predicate places. [2024-06-20 19:34:14,462 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 109 transitions, 991 flow [2024-06-20 19:34:14,463 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:34:14,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:14,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:34:14,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-20 19:34:14,463 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:34:14,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:14,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1611500284, now seen corresponding path program 4 times [2024-06-20 19:34:14,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:14,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377392594] [2024-06-20 19:34:14,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:14,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:19,965 INFO 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:34:19,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:19,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377392594] [2024-06-20 19:34:19,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377392594] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:19,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:19,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:34:19,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267777391] [2024-06-20 19:34:19,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:19,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:34:19,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:19,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:34:19,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:34:20,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:34:20,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 109 transitions, 991 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:34:20,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:20,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:34:20,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:20,372 INFO L124 PetriNetUnfolderBase]: 318/567 cut-off events. [2024-06-20 19:34:20,373 INFO L125 PetriNetUnfolderBase]: For 21440/21440 co-relation queries the response was YES. [2024-06-20 19:34:20,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3661 conditions, 567 events. 318/567 cut-off events. For 21440/21440 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2261 event pairs, 58 based on Foata normal form. 2/569 useless extension candidates. Maximal degree in co-relation 3601. Up to 406 conditions per place. [2024-06-20 19:34:20,377 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 84 selfloop transitions, 40 changer transitions 0/126 dead transitions. [2024-06-20 19:34:20,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 126 transitions, 1377 flow [2024-06-20 19:34:20,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:34:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:34:20,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-20 19:34:20,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3655913978494624 [2024-06-20 19:34:20,387 INFO L175 Difference]: Start difference. First operand has 124 places, 109 transitions, 991 flow. Second operand 9 states and 102 transitions. [2024-06-20 19:34:20,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 126 transitions, 1377 flow [2024-06-20 19:34:20,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 126 transitions, 1307 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-20 19:34:20,423 INFO L231 Difference]: Finished difference. Result has 127 places, 111 transitions, 1032 flow [2024-06-20 19:34:20,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1032, PETRI_PLACES=127, PETRI_TRANSITIONS=111} [2024-06-20 19:34:20,424 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 97 predicate places. [2024-06-20 19:34:20,424 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 111 transitions, 1032 flow [2024-06-20 19:34:20,425 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:34:20,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:20,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:34:20,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-20 19:34:20,425 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:34:20,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:20,426 INFO L85 PathProgramCache]: Analyzing trace with hash -176314472, now seen corresponding path program 5 times [2024-06-20 19:34:20,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:20,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185313064] [2024-06-20 19:34:20,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:20,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:26,347 INFO 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:34:26,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:26,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185313064] [2024-06-20 19:34:26,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185313064] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:26,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:26,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:34:26,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091637026] [2024-06-20 19:34:26,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:26,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:34:26,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:26,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:34:26,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:34:26,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:34:26,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 111 transitions, 1032 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:34:26,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:26,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:34:26,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:26,755 INFO L124 PetriNetUnfolderBase]: 344/610 cut-off events. [2024-06-20 19:34:26,756 INFO L125 PetriNetUnfolderBase]: For 25429/25429 co-relation queries the response was YES. [2024-06-20 19:34:26,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4064 conditions, 610 events. 344/610 cut-off events. For 25429/25429 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2514 event pairs, 68 based on Foata normal form. 2/612 useless extension candidates. Maximal degree in co-relation 4003. Up to 352 conditions per place. [2024-06-20 19:34:26,760 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 76 selfloop transitions, 58 changer transitions 0/136 dead transitions. [2024-06-20 19:34:26,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 136 transitions, 1746 flow [2024-06-20 19:34:26,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:34:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:34:26,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-20 19:34:26,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-20 19:34:26,762 INFO L175 Difference]: Start difference. First operand has 127 places, 111 transitions, 1032 flow. Second operand 9 states and 109 transitions. [2024-06-20 19:34:26,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 136 transitions, 1746 flow [2024-06-20 19:34:26,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 136 transitions, 1675 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-20 19:34:26,789 INFO L231 Difference]: Finished difference. Result has 130 places, 119 transitions, 1198 flow [2024-06-20 19:34:26,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1198, PETRI_PLACES=130, PETRI_TRANSITIONS=119} [2024-06-20 19:34:26,790 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 100 predicate places. [2024-06-20 19:34:26,790 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 119 transitions, 1198 flow [2024-06-20 19:34:26,790 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:34:26,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:26,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:34:26,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-20 19:34:26,790 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:34:26,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:26,791 INFO L85 PathProgramCache]: Analyzing trace with hash -176307714, now seen corresponding path program 2 times [2024-06-20 19:34:26,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:26,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702634374] [2024-06-20 19:34:26,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:26,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:33,091 INFO 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:34:33,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:33,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702634374] [2024-06-20 19:34:33,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702634374] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:33,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:33,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:34:33,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304249092] [2024-06-20 19:34:33,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:33,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:34:33,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:33,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:34:33,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:34:33,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:34:33,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 119 transitions, 1198 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:34:33,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:33,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:34:33,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:33,480 INFO L124 PetriNetUnfolderBase]: 347/615 cut-off events. [2024-06-20 19:34:33,480 INFO L125 PetriNetUnfolderBase]: For 26412/26412 co-relation queries the response was YES. [2024-06-20 19:34:33,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4202 conditions, 615 events. 347/615 cut-off events. For 26412/26412 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2531 event pairs, 66 based on Foata normal form. 1/616 useless extension candidates. Maximal degree in co-relation 4140. Up to 537 conditions per place. [2024-06-20 19:34:33,486 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 99 selfloop transitions, 31 changer transitions 0/132 dead transitions. [2024-06-20 19:34:33,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 132 transitions, 1600 flow [2024-06-20 19:34:33,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:34:33,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:34:33,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-20 19:34:33,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-20 19:34:33,496 INFO L175 Difference]: Start difference. First operand has 130 places, 119 transitions, 1198 flow. Second operand 9 states and 96 transitions. [2024-06-20 19:34:33,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 132 transitions, 1600 flow [2024-06-20 19:34:33,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 132 transitions, 1479 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-06-20 19:34:33,536 INFO L231 Difference]: Finished difference. Result has 135 places, 123 transitions, 1196 flow [2024-06-20 19:34:33,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1196, PETRI_PLACES=135, PETRI_TRANSITIONS=123} [2024-06-20 19:34:33,538 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 105 predicate places. [2024-06-20 19:34:33,538 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 123 transitions, 1196 flow [2024-06-20 19:34:33,538 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:34:33,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:33,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:34:33,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-20 19:34:33,539 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:34:33,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:33,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1838960650, now seen corresponding path program 6 times [2024-06-20 19:34:33,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:33,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116867530] [2024-06-20 19:34:33,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:33,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:34:39,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:39,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116867530] [2024-06-20 19:34:39,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116867530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:39,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:39,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:34:39,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28214871] [2024-06-20 19:34:39,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:39,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:34:39,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:39,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:34:39,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:34:39,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:34:39,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 123 transitions, 1196 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:34:39,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:39,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:34:39,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:39,973 INFO L124 PetriNetUnfolderBase]: 343/609 cut-off events. [2024-06-20 19:34:39,973 INFO L125 PetriNetUnfolderBase]: For 26603/26603 co-relation queries the response was YES. [2024-06-20 19:34:39,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4050 conditions, 609 events. 343/609 cut-off events. For 26603/26603 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2505 event pairs, 67 based on Foata normal form. 2/611 useless extension candidates. Maximal degree in co-relation 3987. Up to 354 conditions per place. [2024-06-20 19:34:39,977 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 78 selfloop transitions, 59 changer transitions 0/139 dead transitions. [2024-06-20 19:34:39,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 139 transitions, 1742 flow [2024-06-20 19:34:39,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:34:39,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:34:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-20 19:34:39,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-20 19:34:39,980 INFO L175 Difference]: Start difference. First operand has 135 places, 123 transitions, 1196 flow. Second operand 9 states and 107 transitions. [2024-06-20 19:34:39,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 139 transitions, 1742 flow [2024-06-20 19:34:40,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 139 transitions, 1680 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-20 19:34:40,007 INFO L231 Difference]: Finished difference. Result has 139 places, 123 transitions, 1257 flow [2024-06-20 19:34:40,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1257, PETRI_PLACES=139, PETRI_TRANSITIONS=123} [2024-06-20 19:34:40,007 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 109 predicate places. [2024-06-20 19:34:40,007 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 123 transitions, 1257 flow [2024-06-20 19:34:40,008 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:34:40,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:40,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:34:40,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-20 19:34:40,008 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:34:40,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:40,009 INFO L85 PathProgramCache]: Analyzing trace with hash 60164316, now seen corresponding path program 3 times [2024-06-20 19:34:40,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:40,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954007972] [2024-06-20 19:34:40,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:40,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:46,289 INFO 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:34:46,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:46,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954007972] [2024-06-20 19:34:46,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954007972] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:46,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:46,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:34:46,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968983791] [2024-06-20 19:34:46,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:46,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:34:46,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:46,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:34:46,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:34:46,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:34:46,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 123 transitions, 1257 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:34:46,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:46,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:34:46,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:46,771 INFO L124 PetriNetUnfolderBase]: 346/613 cut-off events. [2024-06-20 19:34:46,771 INFO L125 PetriNetUnfolderBase]: For 27319/27319 co-relation queries the response was YES. [2024-06-20 19:34:46,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4225 conditions, 613 events. 346/613 cut-off events. For 27319/27319 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2506 event pairs, 69 based on Foata normal form. 1/614 useless extension candidates. Maximal degree in co-relation 4160. Up to 587 conditions per place. [2024-06-20 19:34:46,775 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 117 selfloop transitions, 14 changer transitions 0/133 dead transitions. [2024-06-20 19:34:46,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 133 transitions, 1565 flow [2024-06-20 19:34:46,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:34:46,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:34:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2024-06-20 19:34:46,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3118279569892473 [2024-06-20 19:34:46,776 INFO L175 Difference]: Start difference. First operand has 139 places, 123 transitions, 1257 flow. Second operand 9 states and 87 transitions. [2024-06-20 19:34:46,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 133 transitions, 1565 flow [2024-06-20 19:34:46,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 133 transitions, 1449 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-20 19:34:46,809 INFO L231 Difference]: Finished difference. Result has 141 places, 125 transitions, 1206 flow [2024-06-20 19:34:46,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1206, PETRI_PLACES=141, PETRI_TRANSITIONS=125} [2024-06-20 19:34:46,809 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 111 predicate places. [2024-06-20 19:34:46,809 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 125 transitions, 1206 flow [2024-06-20 19:34:46,809 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:34:46,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:46,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:34:46,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-20 19:34:46,810 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:34:46,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:46,810 INFO L85 PathProgramCache]: Analyzing trace with hash -176492412, now seen corresponding path program 4 times [2024-06-20 19:34:46,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:46,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456522465] [2024-06-20 19:34:46,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:46,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:52,852 INFO 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:34:52,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:52,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456522465] [2024-06-20 19:34:52,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456522465] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:52,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:52,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:34:52,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014440046] [2024-06-20 19:34:52,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:52,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:34:52,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:52,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:34:52,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:34:52,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:34:52,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 125 transitions, 1206 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:34:52,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:52,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:34:52,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:53,276 INFO L124 PetriNetUnfolderBase]: 312/574 cut-off events. [2024-06-20 19:34:53,276 INFO L125 PetriNetUnfolderBase]: For 27880/27884 co-relation queries the response was YES. [2024-06-20 19:34:53,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3909 conditions, 574 events. 312/574 cut-off events. For 27880/27884 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2447 event pairs, 55 based on Foata normal form. 2/572 useless extension candidates. Maximal degree in co-relation 3843. Up to 431 conditions per place. [2024-06-20 19:34:53,280 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 89 selfloop transitions, 32 changer transitions 0/135 dead transitions. [2024-06-20 19:34:53,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 135 transitions, 1474 flow [2024-06-20 19:34:53,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:34:53,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:34:53,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-20 19:34:53,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-20 19:34:53,281 INFO L175 Difference]: Start difference. First operand has 141 places, 125 transitions, 1206 flow. Second operand 8 states and 93 transitions. [2024-06-20 19:34:53,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 135 transitions, 1474 flow [2024-06-20 19:34:53,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 135 transitions, 1429 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-20 19:34:53,313 INFO L231 Difference]: Finished difference. Result has 142 places, 125 transitions, 1229 flow [2024-06-20 19:34:53,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1229, PETRI_PLACES=142, PETRI_TRANSITIONS=125} [2024-06-20 19:34:53,313 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 112 predicate places. [2024-06-20 19:34:53,314 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 125 transitions, 1229 flow [2024-06-20 19:34:53,314 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:34:53,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:53,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:34:53,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-20 19:34:53,315 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:34:53,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:53,315 INFO L85 PathProgramCache]: Analyzing trace with hash -176487452, now seen corresponding path program 7 times [2024-06-20 19:34:53,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:53,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228274610] [2024-06-20 19:34:53,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:53,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:58,953 INFO 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:34:58,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:58,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228274610] [2024-06-20 19:34:58,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228274610] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:58,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:58,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:34:58,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195692332] [2024-06-20 19:34:58,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:58,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:34:58,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:58,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:34:58,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:34:59,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:34:59,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 125 transitions, 1229 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:34:59,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:59,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:34:59,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:59,353 INFO L124 PetriNetUnfolderBase]: 339/603 cut-off events. [2024-06-20 19:34:59,353 INFO L125 PetriNetUnfolderBase]: For 27335/27335 co-relation queries the response was YES. [2024-06-20 19:34:59,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4000 conditions, 603 events. 339/603 cut-off events. For 27335/27335 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2481 event pairs, 68 based on Foata normal form. 2/605 useless extension candidates. Maximal degree in co-relation 3933. Up to 351 conditions per place. [2024-06-20 19:34:59,357 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 76 selfloop transitions, 61 changer transitions 0/139 dead transitions. [2024-06-20 19:34:59,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 139 transitions, 1705 flow [2024-06-20 19:34:59,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:34:59,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:34:59,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-20 19:34:59,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3727598566308244 [2024-06-20 19:34:59,359 INFO L175 Difference]: Start difference. First operand has 142 places, 125 transitions, 1229 flow. Second operand 9 states and 104 transitions. [2024-06-20 19:34:59,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 139 transitions, 1705 flow [2024-06-20 19:34:59,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 139 transitions, 1588 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-20 19:34:59,405 INFO L231 Difference]: Finished difference. Result has 144 places, 125 transitions, 1239 flow [2024-06-20 19:34:59,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1239, PETRI_PLACES=144, PETRI_TRANSITIONS=125} [2024-06-20 19:34:59,406 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 114 predicate places. [2024-06-20 19:34:59,406 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 125 transitions, 1239 flow [2024-06-20 19:34:59,407 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:34:59,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:59,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:34:59,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-20 19:34:59,407 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:34:59,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:59,408 INFO L85 PathProgramCache]: Analyzing trace with hash 59867646, now seen corresponding path program 4 times [2024-06-20 19:34:59,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:59,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082984107] [2024-06-20 19:34:59,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:59,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:05,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:35:05,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:05,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082984107] [2024-06-20 19:35:05,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082984107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:05,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:05,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:35:05,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032817554] [2024-06-20 19:35:05,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:05,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:35:05,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:05,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:35:05,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:35:05,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:35:05,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 125 transitions, 1239 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:35:05,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:05,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:35:05,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:05,981 INFO L124 PetriNetUnfolderBase]: 342/608 cut-off events. [2024-06-20 19:35:05,981 INFO L125 PetriNetUnfolderBase]: For 27640/27640 co-relation queries the response was YES. [2024-06-20 19:35:05,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4073 conditions, 608 events. 342/608 cut-off events. For 27640/27640 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2513 event pairs, 65 based on Foata normal form. 1/609 useless extension candidates. Maximal degree in co-relation 4005. Up to 528 conditions per place. [2024-06-20 19:35:05,986 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 96 selfloop transitions, 38 changer transitions 0/136 dead transitions. [2024-06-20 19:35:05,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 136 transitions, 1643 flow [2024-06-20 19:35:05,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:35:05,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:35:05,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-20 19:35:05,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33691756272401435 [2024-06-20 19:35:05,987 INFO L175 Difference]: Start difference. First operand has 144 places, 125 transitions, 1239 flow. Second operand 9 states and 94 transitions. [2024-06-20 19:35:05,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 136 transitions, 1643 flow [2024-06-20 19:35:06,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 136 transitions, 1501 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-20 19:35:06,024 INFO L231 Difference]: Finished difference. Result has 144 places, 127 transitions, 1210 flow [2024-06-20 19:35:06,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1097, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1210, PETRI_PLACES=144, PETRI_TRANSITIONS=127} [2024-06-20 19:35:06,025 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 114 predicate places. [2024-06-20 19:35:06,025 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 127 transitions, 1210 flow [2024-06-20 19:35:06,025 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:35:06,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:06,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:06,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-20 19:35:06,025 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:35:06,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:06,026 INFO L85 PathProgramCache]: Analyzing trace with hash -170058362, now seen corresponding path program 8 times [2024-06-20 19:35:06,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:06,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354742890] [2024-06-20 19:35:06,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:06,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:11,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:35:11,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:11,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354742890] [2024-06-20 19:35:11,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354742890] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:11,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:11,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:35:11,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483402544] [2024-06-20 19:35:11,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:11,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:35:11,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:11,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:35:11,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:35:12,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:35:12,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 127 transitions, 1210 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:35:12,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:12,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:35:12,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:12,291 INFO L124 PetriNetUnfolderBase]: 348/618 cut-off events. [2024-06-20 19:35:12,292 INFO L125 PetriNetUnfolderBase]: For 29693/29693 co-relation queries the response was YES. [2024-06-20 19:35:12,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4019 conditions, 618 events. 348/618 cut-off events. For 29693/29693 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2562 event pairs, 60 based on Foata normal form. 2/620 useless extension candidates. Maximal degree in co-relation 3951. Up to 362 conditions per place. [2024-06-20 19:35:12,296 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 74 selfloop transitions, 67 changer transitions 0/143 dead transitions. [2024-06-20 19:35:12,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 143 transitions, 1728 flow [2024-06-20 19:35:12,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:35:12,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:35:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-20 19:35:12,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36917562724014336 [2024-06-20 19:35:12,297 INFO L175 Difference]: Start difference. First operand has 144 places, 127 transitions, 1210 flow. Second operand 9 states and 103 transitions. [2024-06-20 19:35:12,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 143 transitions, 1728 flow [2024-06-20 19:35:12,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 143 transitions, 1645 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-20 19:35:12,331 INFO L231 Difference]: Finished difference. Result has 147 places, 129 transitions, 1292 flow [2024-06-20 19:35:12,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1292, PETRI_PLACES=147, PETRI_TRANSITIONS=129} [2024-06-20 19:35:12,332 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 117 predicate places. [2024-06-20 19:35:12,332 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 129 transitions, 1292 flow [2024-06-20 19:35:12,332 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:35:12,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:12,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:12,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-20 19:35:12,333 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:35:12,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:12,333 INFO L85 PathProgramCache]: Analyzing trace with hash 59867398, now seen corresponding path program 9 times [2024-06-20 19:35:12,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:12,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860867479] [2024-06-20 19:35:12,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:12,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:35:18,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:18,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860867479] [2024-06-20 19:35:18,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860867479] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:18,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:18,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:35:18,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578317836] [2024-06-20 19:35:18,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:18,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:35:18,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:18,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:35:18,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:35:18,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:35:18,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 129 transitions, 1292 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:35:18,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:18,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:35:18,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:18,502 INFO L124 PetriNetUnfolderBase]: 354/628 cut-off events. [2024-06-20 19:35:18,502 INFO L125 PetriNetUnfolderBase]: For 31330/31330 co-relation queries the response was YES. [2024-06-20 19:35:18,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4184 conditions, 628 events. 354/628 cut-off events. For 31330/31330 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2612 event pairs, 56 based on Foata normal form. 2/630 useless extension candidates. Maximal degree in co-relation 4115. Up to 368 conditions per place. [2024-06-20 19:35:18,507 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 66 selfloop transitions, 76 changer transitions 0/144 dead transitions. [2024-06-20 19:35:18,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 144 transitions, 1730 flow [2024-06-20 19:35:18,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:35:18,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:35:18,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-20 19:35:18,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36200716845878134 [2024-06-20 19:35:18,508 INFO L175 Difference]: Start difference. First operand has 147 places, 129 transitions, 1292 flow. Second operand 9 states and 101 transitions. [2024-06-20 19:35:18,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 144 transitions, 1730 flow [2024-06-20 19:35:18,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 144 transitions, 1553 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-20 19:35:18,550 INFO L231 Difference]: Finished difference. Result has 148 places, 131 transitions, 1302 flow [2024-06-20 19:35:18,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1302, PETRI_PLACES=148, PETRI_TRANSITIONS=131} [2024-06-20 19:35:18,550 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 118 predicate places. [2024-06-20 19:35:18,551 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 131 transitions, 1302 flow [2024-06-20 19:35:18,551 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:35:18,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:18,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:18,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-20 19:35:18,551 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:35:18,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:18,551 INFO L85 PathProgramCache]: Analyzing trace with hash 51593436, now seen corresponding path program 5 times [2024-06-20 19:35:18,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:18,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294809144] [2024-06-20 19:35:18,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:18,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:35:24,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:24,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294809144] [2024-06-20 19:35:24,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294809144] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:24,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:24,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:35:24,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203524844] [2024-06-20 19:35:24,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:24,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:35:24,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:24,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:35:24,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:35:24,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:35:24,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 131 transitions, 1302 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:35:24,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:24,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:35:24,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:25,027 INFO L124 PetriNetUnfolderBase]: 352/625 cut-off events. [2024-06-20 19:35:25,027 INFO L125 PetriNetUnfolderBase]: For 30414/30414 co-relation queries the response was YES. [2024-06-20 19:35:25,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4152 conditions, 625 events. 352/625 cut-off events. For 30414/30414 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2585 event pairs, 65 based on Foata normal form. 1/626 useless extension candidates. Maximal degree in co-relation 4082. Up to 546 conditions per place. [2024-06-20 19:35:25,031 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 101 selfloop transitions, 36 changer transitions 0/139 dead transitions. [2024-06-20 19:35:25,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 139 transitions, 1594 flow [2024-06-20 19:35:25,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:35:25,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:35:25,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-20 19:35:25,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33691756272401435 [2024-06-20 19:35:25,032 INFO L175 Difference]: Start difference. First operand has 148 places, 131 transitions, 1302 flow. Second operand 9 states and 94 transitions. [2024-06-20 19:35:25,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 139 transitions, 1594 flow [2024-06-20 19:35:25,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 139 transitions, 1443 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-20 19:35:25,074 INFO L231 Difference]: Finished difference. Result has 151 places, 131 transitions, 1228 flow [2024-06-20 19:35:25,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1151, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1228, PETRI_PLACES=151, PETRI_TRANSITIONS=131} [2024-06-20 19:35:25,074 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 121 predicate places. [2024-06-20 19:35:25,075 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 131 transitions, 1228 flow [2024-06-20 19:35:25,075 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:35:25,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:25,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:25,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-20 19:35:25,075 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:35:25,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:25,076 INFO L85 PathProgramCache]: Analyzing trace with hash 51593188, now seen corresponding path program 10 times [2024-06-20 19:35:25,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:25,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187168227] [2024-06-20 19:35:25,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:25,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:30,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:35:30,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:30,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187168227] [2024-06-20 19:35:30,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187168227] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:30,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:30,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:35:30,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616790307] [2024-06-20 19:35:30,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:30,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:35:30,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:30,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:35:30,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:35:30,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:35:30,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 131 transitions, 1228 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:35:30,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:30,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:35:30,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:31,231 INFO L124 PetriNetUnfolderBase]: 348/619 cut-off events. [2024-06-20 19:35:31,231 INFO L125 PetriNetUnfolderBase]: For 30370/30370 co-relation queries the response was YES. [2024-06-20 19:35:31,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3933 conditions, 619 events. 348/619 cut-off events. For 30370/30370 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2570 event pairs, 59 based on Foata normal form. 2/621 useless extension candidates. Maximal degree in co-relation 3862. Up to 362 conditions per place. [2024-06-20 19:35:31,235 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 75 selfloop transitions, 68 changer transitions 0/145 dead transitions. [2024-06-20 19:35:31,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 145 transitions, 1646 flow [2024-06-20 19:35:31,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:35:31,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:35:31,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-20 19:35:31,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3727598566308244 [2024-06-20 19:35:31,238 INFO L175 Difference]: Start difference. First operand has 151 places, 131 transitions, 1228 flow. Second operand 9 states and 104 transitions. [2024-06-20 19:35:31,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 145 transitions, 1646 flow [2024-06-20 19:35:31,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 145 transitions, 1530 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-20 19:35:31,292 INFO L231 Difference]: Finished difference. Result has 151 places, 131 transitions, 1253 flow [2024-06-20 19:35:31,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1253, PETRI_PLACES=151, PETRI_TRANSITIONS=131} [2024-06-20 19:35:31,292 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 121 predicate places. [2024-06-20 19:35:31,292 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 131 transitions, 1253 flow [2024-06-20 19:35:31,292 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:35:31,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:31,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:31,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-20 19:35:31,293 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:35:31,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1602477460, now seen corresponding path program 1 times [2024-06-20 19:35:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:31,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428888498] [2024-06-20 19:35:31,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:31,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:35:38,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:38,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428888498] [2024-06-20 19:35:38,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428888498] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:38,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:38,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:35:38,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491367306] [2024-06-20 19:35:38,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:38,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:35:38,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:38,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:35:38,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:35:38,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:35:38,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 131 transitions, 1253 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:35:38,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:38,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:35:38,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:38,798 INFO L124 PetriNetUnfolderBase]: 345/613 cut-off events. [2024-06-20 19:35:38,798 INFO L125 PetriNetUnfolderBase]: For 29593/29593 co-relation queries the response was YES. [2024-06-20 19:35:38,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3916 conditions, 613 events. 345/613 cut-off events. For 29593/29593 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2517 event pairs, 67 based on Foata normal form. 2/615 useless extension candidates. Maximal degree in co-relation 3844. Up to 581 conditions per place. [2024-06-20 19:35:38,802 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 124 selfloop transitions, 15 changer transitions 0/141 dead transitions. [2024-06-20 19:35:38,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 141 transitions, 1553 flow [2024-06-20 19:35:38,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:35:38,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:35:38,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2024-06-20 19:35:38,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3032258064516129 [2024-06-20 19:35:38,803 INFO L175 Difference]: Start difference. First operand has 151 places, 131 transitions, 1253 flow. Second operand 10 states and 94 transitions. [2024-06-20 19:35:38,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 141 transitions, 1553 flow [2024-06-20 19:35:38,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 141 transitions, 1375 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-20 19:35:38,848 INFO L231 Difference]: Finished difference. Result has 152 places, 131 transitions, 1109 flow [2024-06-20 19:35:38,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1109, PETRI_PLACES=152, PETRI_TRANSITIONS=131} [2024-06-20 19:35:38,849 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 122 predicate places. [2024-06-20 19:35:38,849 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 131 transitions, 1109 flow [2024-06-20 19:35:38,849 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:35:38,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:38,849 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:35:38,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-20 19:35:38,849 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:35:38,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:38,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1043147916, now seen corresponding path program 1 times [2024-06-20 19:35:38,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:38,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737355338] [2024-06-20 19:35:38,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:38,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:44,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:35:44,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:44,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737355338] [2024-06-20 19:35:44,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737355338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:44,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:44,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:35:44,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012104408] [2024-06-20 19:35:44,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:44,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:35:44,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:44,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:35:44,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:35:44,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:35:44,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 131 transitions, 1109 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:35:44,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:44,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:35:44,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:45,047 INFO L124 PetriNetUnfolderBase]: 349/621 cut-off events. [2024-06-20 19:35:45,048 INFO L125 PetriNetUnfolderBase]: For 30426/30426 co-relation queries the response was YES. [2024-06-20 19:35:45,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3805 conditions, 621 events. 349/621 cut-off events. For 30426/30426 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2562 event pairs, 41 based on Foata normal form. 2/623 useless extension candidates. Maximal degree in co-relation 3732. Up to 524 conditions per place. [2024-06-20 19:35:45,052 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 124 selfloop transitions, 21 changer transitions 0/147 dead transitions. [2024-06-20 19:35:45,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 147 transitions, 1447 flow [2024-06-20 19:35:45,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:35:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:35:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2024-06-20 19:35:45,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-20 19:35:45,053 INFO L175 Difference]: Start difference. First operand has 152 places, 131 transitions, 1109 flow. Second operand 9 states and 93 transitions. [2024-06-20 19:35:45,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 147 transitions, 1447 flow [2024-06-20 19:35:45,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 147 transitions, 1409 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-20 19:35:45,103 INFO L231 Difference]: Finished difference. Result has 153 places, 132 transitions, 1131 flow [2024-06-20 19:35:45,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1131, PETRI_PLACES=153, PETRI_TRANSITIONS=132} [2024-06-20 19:35:45,104 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 123 predicate places. [2024-06-20 19:35:45,104 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 132 transitions, 1131 flow [2024-06-20 19:35:45,104 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:35:45,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:45,104 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:35:45,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-20 19:35:45,105 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:35:45,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:45,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1045021866, now seen corresponding path program 2 times [2024-06-20 19:35:45,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:45,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975835226] [2024-06-20 19:35:45,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:45,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:50,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:35:50,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:50,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975835226] [2024-06-20 19:35:50,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975835226] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:50,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:50,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:35:50,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383442210] [2024-06-20 19:35:50,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:50,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:35:50,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:50,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:35:50,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:35:51,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:35:51,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 132 transitions, 1131 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:35:51,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:51,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:35:51,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:51,470 INFO L124 PetriNetUnfolderBase]: 360/642 cut-off events. [2024-06-20 19:35:51,470 INFO L125 PetriNetUnfolderBase]: For 34134/34134 co-relation queries the response was YES. [2024-06-20 19:35:51,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4045 conditions, 642 events. 360/642 cut-off events. For 34134/34134 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2728 event pairs, 57 based on Foata normal form. 2/644 useless extension candidates. Maximal degree in co-relation 3971. Up to 515 conditions per place. [2024-06-20 19:35:51,474 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 119 selfloop transitions, 29 changer transitions 0/150 dead transitions. [2024-06-20 19:35:51,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 150 transitions, 1593 flow [2024-06-20 19:35:51,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:35:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:35:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-20 19:35:51,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-20 19:35:51,478 INFO L175 Difference]: Start difference. First operand has 153 places, 132 transitions, 1131 flow. Second operand 9 states and 98 transitions. [2024-06-20 19:35:51,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 150 transitions, 1593 flow [2024-06-20 19:35:51,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 150 transitions, 1543 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-20 19:35:51,534 INFO L231 Difference]: Finished difference. Result has 155 places, 134 transitions, 1173 flow [2024-06-20 19:35:51,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1173, PETRI_PLACES=155, PETRI_TRANSITIONS=134} [2024-06-20 19:35:51,535 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 125 predicate places. [2024-06-20 19:35:51,535 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 134 transitions, 1173 flow [2024-06-20 19:35:51,535 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:35:51,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:51,535 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:35:51,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-20 19:35:51,535 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:35:51,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:51,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1045025741, now seen corresponding path program 1 times [2024-06-20 19:35:51,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:51,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656353842] [2024-06-20 19:35:51,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:51,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:57,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:35:57,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:57,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656353842] [2024-06-20 19:35:57,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656353842] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:57,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:57,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:35:57,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817109639] [2024-06-20 19:35:57,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:57,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:35:57,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:57,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:35:57,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:35:57,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:35:57,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 134 transitions, 1173 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:35:57,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:57,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:35:57,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:57,745 INFO L124 PetriNetUnfolderBase]: 358/639 cut-off events. [2024-06-20 19:35:57,746 INFO L125 PetriNetUnfolderBase]: For 33368/33368 co-relation queries the response was YES. [2024-06-20 19:35:57,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4020 conditions, 639 events. 358/639 cut-off events. For 33368/33368 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2700 event pairs, 56 based on Foata normal form. 1/640 useless extension candidates. Maximal degree in co-relation 3945. Up to 532 conditions per place. [2024-06-20 19:35:57,751 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 113 selfloop transitions, 34 changer transitions 0/149 dead transitions. [2024-06-20 19:35:57,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 149 transitions, 1509 flow [2024-06-20 19:35:57,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:35:57,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:35:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-20 19:35:57,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-20 19:35:57,753 INFO L175 Difference]: Start difference. First operand has 155 places, 134 transitions, 1173 flow. Second operand 9 states and 97 transitions. [2024-06-20 19:35:57,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 149 transitions, 1509 flow [2024-06-20 19:35:57,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 149 transitions, 1448 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-20 19:35:57,814 INFO L231 Difference]: Finished difference. Result has 159 places, 134 transitions, 1188 flow [2024-06-20 19:35:57,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1188, PETRI_PLACES=159, PETRI_TRANSITIONS=134} [2024-06-20 19:35:57,815 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 129 predicate places. [2024-06-20 19:35:57,815 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 134 transitions, 1188 flow [2024-06-20 19:35:57,816 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:35:57,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:57,816 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:35:57,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-20 19:35:57,816 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:35:57,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:57,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1045025586, now seen corresponding path program 3 times [2024-06-20 19:35:57,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:57,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557317254] [2024-06-20 19:35:57,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:57,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:03,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:03,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:03,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557317254] [2024-06-20 19:36:03,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557317254] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:03,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:03,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:36:03,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324871610] [2024-06-20 19:36:03,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:03,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:36:03,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:03,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:36:03,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:36:03,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:36:03,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 134 transitions, 1188 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:36:03,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:03,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:36:03,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:04,388 INFO L124 PetriNetUnfolderBase]: 355/634 cut-off events. [2024-06-20 19:36:04,388 INFO L125 PetriNetUnfolderBase]: For 33212/33212 co-relation queries the response was YES. [2024-06-20 19:36:04,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3948 conditions, 634 events. 355/634 cut-off events. For 33212/33212 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2665 event pairs, 55 based on Foata normal form. 2/636 useless extension candidates. Maximal degree in co-relation 3871. Up to 530 conditions per place. [2024-06-20 19:36:04,393 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 116 selfloop transitions, 31 changer transitions 0/149 dead transitions. [2024-06-20 19:36:04,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 149 transitions, 1522 flow [2024-06-20 19:36:04,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:36:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:36:04,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-20 19:36:04,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-20 19:36:04,395 INFO L175 Difference]: Start difference. First operand has 159 places, 134 transitions, 1188 flow. Second operand 9 states and 96 transitions. [2024-06-20 19:36:04,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 149 transitions, 1522 flow [2024-06-20 19:36:04,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 149 transitions, 1393 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-20 19:36:04,467 INFO L231 Difference]: Finished difference. Result has 158 places, 134 transitions, 1126 flow [2024-06-20 19:36:04,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1126, PETRI_PLACES=158, PETRI_TRANSITIONS=134} [2024-06-20 19:36:04,468 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 128 predicate places. [2024-06-20 19:36:04,468 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 134 transitions, 1126 flow [2024-06-20 19:36:04,468 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:36:04,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:04,468 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:36:04,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-20 19:36:04,468 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:36:04,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:04,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1131867498, now seen corresponding path program 1 times [2024-06-20 19:36:04,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:04,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723571131] [2024-06-20 19:36:04,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:04,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:10,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:10,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723571131] [2024-06-20 19:36:10,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723571131] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:10,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:10,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:36:10,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666457943] [2024-06-20 19:36:10,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:10,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:36:10,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:10,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:36:10,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:36:10,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:36:10,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 134 transitions, 1126 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:10,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:10,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:36:10,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:10,592 INFO L124 PetriNetUnfolderBase]: 361/644 cut-off events. [2024-06-20 19:36:10,592 INFO L125 PetriNetUnfolderBase]: For 34419/34419 co-relation queries the response was YES. [2024-06-20 19:36:10,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3954 conditions, 644 events. 361/644 cut-off events. For 34419/34419 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2729 event pairs, 53 based on Foata normal form. 2/646 useless extension candidates. Maximal degree in co-relation 3876. Up to 545 conditions per place. [2024-06-20 19:36:10,597 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 124 selfloop transitions, 28 changer transitions 0/154 dead transitions. [2024-06-20 19:36:10,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 154 transitions, 1510 flow [2024-06-20 19:36:10,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:36:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:36:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-20 19:36:10,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3942652329749104 [2024-06-20 19:36:10,598 INFO L175 Difference]: Start difference. First operand has 158 places, 134 transitions, 1126 flow. Second operand 9 states and 110 transitions. [2024-06-20 19:36:10,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 154 transitions, 1510 flow [2024-06-20 19:36:10,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 154 transitions, 1443 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-20 19:36:10,674 INFO L231 Difference]: Finished difference. Result has 159 places, 136 transitions, 1148 flow [2024-06-20 19:36:10,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1148, PETRI_PLACES=159, PETRI_TRANSITIONS=136} [2024-06-20 19:36:10,675 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 129 predicate places. [2024-06-20 19:36:10,675 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 136 transitions, 1148 flow [2024-06-20 19:36:10,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:10,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:10,675 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:36:10,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-20 19:36:10,675 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:36:10,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:10,676 INFO L85 PathProgramCache]: Analyzing trace with hash 416282900, now seen corresponding path program 4 times [2024-06-20 19:36:10,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:10,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138277425] [2024-06-20 19:36:10,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:10,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:16,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:36:16,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:16,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138277425] [2024-06-20 19:36:16,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138277425] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:16,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:16,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:36:16,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578060689] [2024-06-20 19:36:16,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:16,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:36:16,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:16,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:36:16,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:36:16,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:36:16,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 136 transitions, 1148 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:36:16,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:16,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:36:16,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:17,211 INFO L124 PetriNetUnfolderBase]: 365/652 cut-off events. [2024-06-20 19:36:17,211 INFO L125 PetriNetUnfolderBase]: For 35830/35830 co-relation queries the response was YES. [2024-06-20 19:36:17,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4050 conditions, 652 events. 365/652 cut-off events. For 35830/35830 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2778 event pairs, 52 based on Foata normal form. 2/654 useless extension candidates. Maximal degree in co-relation 3972. Up to 522 conditions per place. [2024-06-20 19:36:17,216 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 112 selfloop transitions, 37 changer transitions 0/151 dead transitions. [2024-06-20 19:36:17,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 151 transitions, 1500 flow [2024-06-20 19:36:17,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:36:17,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:36:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-20 19:36:17,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-20 19:36:17,218 INFO L175 Difference]: Start difference. First operand has 159 places, 136 transitions, 1148 flow. Second operand 9 states and 97 transitions. [2024-06-20 19:36:17,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 151 transitions, 1500 flow [2024-06-20 19:36:17,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 151 transitions, 1427 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-20 19:36:17,297 INFO L231 Difference]: Finished difference. Result has 161 places, 137 transitions, 1171 flow [2024-06-20 19:36:17,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1171, PETRI_PLACES=161, PETRI_TRANSITIONS=137} [2024-06-20 19:36:17,298 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 131 predicate places. [2024-06-20 19:36:17,298 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 137 transitions, 1171 flow [2024-06-20 19:36:17,298 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:36:17,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:17,298 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:36:17,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-20 19:36:17,298 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:36:17,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:17,299 INFO L85 PathProgramCache]: Analyzing trace with hash 416288852, now seen corresponding path program 2 times [2024-06-20 19:36:17,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:17,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834388399] [2024-06-20 19:36:17,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:17,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:23,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:23,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834388399] [2024-06-20 19:36:23,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834388399] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:23,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:23,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:36:23,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650542320] [2024-06-20 19:36:23,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:23,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:36:23,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:23,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:36:23,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:36:23,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:36:23,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 137 transitions, 1171 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:36:23,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:23,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:36:23,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:23,586 INFO L124 PetriNetUnfolderBase]: 416/734 cut-off events. [2024-06-20 19:36:23,587 INFO L125 PetriNetUnfolderBase]: For 50272/50272 co-relation queries the response was YES. [2024-06-20 19:36:23,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4954 conditions, 734 events. 416/734 cut-off events. For 50272/50272 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3192 event pairs, 55 based on Foata normal form. 2/736 useless extension candidates. Maximal degree in co-relation 4874. Up to 488 conditions per place. [2024-06-20 19:36:23,591 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 113 selfloop transitions, 49 changer transitions 0/164 dead transitions. [2024-06-20 19:36:23,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 164 transitions, 1873 flow [2024-06-20 19:36:23,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:36:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:36:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-20 19:36:23,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-20 19:36:23,592 INFO L175 Difference]: Start difference. First operand has 161 places, 137 transitions, 1171 flow. Second operand 10 states and 115 transitions. [2024-06-20 19:36:23,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 164 transitions, 1873 flow [2024-06-20 19:36:23,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 164 transitions, 1787 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-20 19:36:23,683 INFO L231 Difference]: Finished difference. Result has 166 places, 145 transitions, 1331 flow [2024-06-20 19:36:23,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1331, PETRI_PLACES=166, PETRI_TRANSITIONS=145} [2024-06-20 19:36:23,684 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 136 predicate places. [2024-06-20 19:36:23,684 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 145 transitions, 1331 flow [2024-06-20 19:36:23,684 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:36:23,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:23,684 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:36:23,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-20 19:36:23,685 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:36:23,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:23,685 INFO L85 PathProgramCache]: Analyzing trace with hash 565590036, now seen corresponding path program 5 times [2024-06-20 19:36:23,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:23,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252469856] [2024-06-20 19:36:23,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:23,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:29,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:29,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:29,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252469856] [2024-06-20 19:36:29,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252469856] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:29,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:29,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:36:29,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060752995] [2024-06-20 19:36:29,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:29,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:36:29,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:29,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:36:29,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:36:29,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:36:29,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 145 transitions, 1331 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:36:29,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:29,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:36:29,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:30,295 INFO L124 PetriNetUnfolderBase]: 420/742 cut-off events. [2024-06-20 19:36:30,295 INFO L125 PetriNetUnfolderBase]: For 52481/52481 co-relation queries the response was YES. [2024-06-20 19:36:30,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5199 conditions, 742 events. 420/742 cut-off events. For 52481/52481 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3250 event pairs, 64 based on Foata normal form. 2/744 useless extension candidates. Maximal degree in co-relation 5116. Up to 612 conditions per place. [2024-06-20 19:36:30,301 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 125 selfloop transitions, 33 changer transitions 0/160 dead transitions. [2024-06-20 19:36:30,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 160 transitions, 1703 flow [2024-06-20 19:36:30,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:36:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:36:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-20 19:36:30,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-20 19:36:30,303 INFO L175 Difference]: Start difference. First operand has 166 places, 145 transitions, 1331 flow. Second operand 9 states and 98 transitions. [2024-06-20 19:36:30,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 160 transitions, 1703 flow [2024-06-20 19:36:30,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 160 transitions, 1638 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-20 19:36:30,397 INFO L231 Difference]: Finished difference. Result has 170 places, 146 transitions, 1356 flow [2024-06-20 19:36:30,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1266, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1356, PETRI_PLACES=170, PETRI_TRANSITIONS=146} [2024-06-20 19:36:30,397 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 140 predicate places. [2024-06-20 19:36:30,397 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 146 transitions, 1356 flow [2024-06-20 19:36:30,397 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:36:30,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:30,398 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:36:30,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-20 19:36:30,398 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:36:30,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:30,398 INFO L85 PathProgramCache]: Analyzing trace with hash 571304328, now seen corresponding path program 3 times [2024-06-20 19:36:30,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:30,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255087217] [2024-06-20 19:36:30,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:30,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:36,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:36,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:36,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255087217] [2024-06-20 19:36:36,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255087217] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:36,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:36,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:36:36,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369739003] [2024-06-20 19:36:36,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:36,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:36:36,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:36,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:36:36,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:36:36,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:36:36,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 146 transitions, 1356 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:36:36,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:36,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:36:36,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:36,908 INFO L124 PetriNetUnfolderBase]: 426/752 cut-off events. [2024-06-20 19:36:36,908 INFO L125 PetriNetUnfolderBase]: For 54513/54513 co-relation queries the response was YES. [2024-06-20 19:36:36,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5322 conditions, 752 events. 426/752 cut-off events. For 54513/54513 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3313 event pairs, 53 based on Foata normal form. 2/754 useless extension candidates. Maximal degree in co-relation 5237. Up to 498 conditions per place. [2024-06-20 19:36:36,915 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 112 selfloop transitions, 53 changer transitions 0/167 dead transitions. [2024-06-20 19:36:36,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 167 transitions, 2007 flow [2024-06-20 19:36:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:36:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:36:36,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-20 19:36:36,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36774193548387096 [2024-06-20 19:36:36,916 INFO L175 Difference]: Start difference. First operand has 170 places, 146 transitions, 1356 flow. Second operand 10 states and 114 transitions. [2024-06-20 19:36:36,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 167 transitions, 2007 flow [2024-06-20 19:36:37,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 167 transitions, 1927 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-20 19:36:37,018 INFO L231 Difference]: Finished difference. Result has 173 places, 148 transitions, 1420 flow [2024-06-20 19:36:37,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1276, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1420, PETRI_PLACES=173, PETRI_TRANSITIONS=148} [2024-06-20 19:36:37,018 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 143 predicate places. [2024-06-20 19:36:37,018 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 148 transitions, 1420 flow [2024-06-20 19:36:37,018 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:36:37,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:37,019 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:36:37,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-20 19:36:37,019 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:36:37,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:37,019 INFO L85 PathProgramCache]: Analyzing trace with hash 416498102, now seen corresponding path program 4 times [2024-06-20 19:36:37,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:37,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641435034] [2024-06-20 19:36:37,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:37,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:43,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:43,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641435034] [2024-06-20 19:36:43,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641435034] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:43,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:43,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:36:43,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391674087] [2024-06-20 19:36:43,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:43,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:36:43,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:43,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:36:43,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:36:43,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:36:43,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 148 transitions, 1420 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:36:43,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:43,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:36:43,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:43,632 INFO L124 PetriNetUnfolderBase]: 420/744 cut-off events. [2024-06-20 19:36:43,632 INFO L125 PetriNetUnfolderBase]: For 53119/53119 co-relation queries the response was YES. [2024-06-20 19:36:43,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5133 conditions, 744 events. 420/744 cut-off events. For 53119/53119 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3261 event pairs, 54 based on Foata normal form. 4/748 useless extension candidates. Maximal degree in co-relation 5047. Up to 497 conditions per place. [2024-06-20 19:36:43,639 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 108 selfloop transitions, 56 changer transitions 0/166 dead transitions. [2024-06-20 19:36:43,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 166 transitions, 1924 flow [2024-06-20 19:36:43,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:36:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:36:43,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-20 19:36:43,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36129032258064514 [2024-06-20 19:36:43,640 INFO L175 Difference]: Start difference. First operand has 173 places, 148 transitions, 1420 flow. Second operand 10 states and 112 transitions. [2024-06-20 19:36:43,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 166 transitions, 1924 flow [2024-06-20 19:36:43,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 166 transitions, 1787 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-20 19:36:43,742 INFO L231 Difference]: Finished difference. Result has 176 places, 148 transitions, 1402 flow [2024-06-20 19:36:43,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1402, PETRI_PLACES=176, PETRI_TRANSITIONS=148} [2024-06-20 19:36:43,743 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 146 predicate places. [2024-06-20 19:36:43,743 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 148 transitions, 1402 flow [2024-06-20 19:36:43,743 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:36:43,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:43,744 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:36:43,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-20 19:36:43,744 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:36:43,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:43,745 INFO L85 PathProgramCache]: Analyzing trace with hash 410772650, now seen corresponding path program 6 times [2024-06-20 19:36:43,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:43,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619441705] [2024-06-20 19:36:43,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:43,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:49,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:49,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619441705] [2024-06-20 19:36:49,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619441705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:49,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:49,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:36:49,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3116424] [2024-06-20 19:36:49,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:49,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:36:49,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:49,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:36:49,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:36:49,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:36:49,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 148 transitions, 1402 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:36:49,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:49,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:36:49,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:50,221 INFO L124 PetriNetUnfolderBase]: 424/752 cut-off events. [2024-06-20 19:36:50,222 INFO L125 PetriNetUnfolderBase]: For 51694/51694 co-relation queries the response was YES. [2024-06-20 19:36:50,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5175 conditions, 752 events. 424/752 cut-off events. For 51694/51694 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3320 event pairs, 61 based on Foata normal form. 2/754 useless extension candidates. Maximal degree in co-relation 5088. Up to 602 conditions per place. [2024-06-20 19:36:50,228 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 126 selfloop transitions, 35 changer transitions 0/163 dead transitions. [2024-06-20 19:36:50,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 163 transitions, 1780 flow [2024-06-20 19:36:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:36:50,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:36:50,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-20 19:36:50,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-20 19:36:50,229 INFO L175 Difference]: Start difference. First operand has 176 places, 148 transitions, 1402 flow. Second operand 9 states and 98 transitions. [2024-06-20 19:36:50,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 163 transitions, 1780 flow [2024-06-20 19:36:50,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 163 transitions, 1673 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-20 19:36:50,325 INFO L231 Difference]: Finished difference. Result has 177 places, 149 transitions, 1391 flow [2024-06-20 19:36:50,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1391, PETRI_PLACES=177, PETRI_TRANSITIONS=149} [2024-06-20 19:36:50,325 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 147 predicate places. [2024-06-20 19:36:50,325 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 149 transitions, 1391 flow [2024-06-20 19:36:50,326 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:36:50,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:50,326 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:36:50,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-20 19:36:50,326 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:36:50,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:50,327 INFO L85 PathProgramCache]: Analyzing trace with hash 410926472, now seen corresponding path program 5 times [2024-06-20 19:36:50,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:50,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136573041] [2024-06-20 19:36:50,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:50,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:56,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:56,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136573041] [2024-06-20 19:36:56,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136573041] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:56,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:56,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:36:56,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20942051] [2024-06-20 19:36:56,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:56,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:36:56,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:56,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:36:56,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:36:56,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:36:56,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 149 transitions, 1391 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:36:56,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:56,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:36:56,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:56,932 INFO L124 PetriNetUnfolderBase]: 425/754 cut-off events. [2024-06-20 19:36:56,932 INFO L125 PetriNetUnfolderBase]: For 51886/51886 co-relation queries the response was YES. [2024-06-20 19:36:56,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5119 conditions, 754 events. 425/754 cut-off events. For 51886/51886 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3353 event pairs, 63 based on Foata normal form. 2/756 useless extension candidates. Maximal degree in co-relation 5031. Up to 507 conditions per place. [2024-06-20 19:36:56,937 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 118 selfloop transitions, 49 changer transitions 0/169 dead transitions. [2024-06-20 19:36:56,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 169 transitions, 1938 flow [2024-06-20 19:36:56,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:36:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:36:56,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-20 19:36:56,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-20 19:36:56,939 INFO L175 Difference]: Start difference. First operand has 177 places, 149 transitions, 1391 flow. Second operand 10 states and 115 transitions. [2024-06-20 19:36:56,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 169 transitions, 1938 flow [2024-06-20 19:36:57,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 169 transitions, 1852 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-20 19:36:57,029 INFO L231 Difference]: Finished difference. Result has 180 places, 151 transitions, 1443 flow [2024-06-20 19:36:57,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1443, PETRI_PLACES=180, PETRI_TRANSITIONS=151} [2024-06-20 19:36:57,029 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 150 predicate places. [2024-06-20 19:36:57,029 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 151 transitions, 1443 flow [2024-06-20 19:36:57,030 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:36:57,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:57,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:57,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-20 19:36:57,030 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:36:57,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:57,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1875144331, now seen corresponding path program 1 times [2024-06-20 19:36:57,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:57,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85465341] [2024-06-20 19:36:57,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:57,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:02,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:37:02,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:02,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85465341] [2024-06-20 19:37:02,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85465341] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:02,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:02,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:37:02,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696327167] [2024-06-20 19:37:02,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:02,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:37:02,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:02,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:37:02,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:37:03,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:37:03,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 151 transitions, 1443 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:37:03,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:03,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:37:03,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:03,495 INFO L124 PetriNetUnfolderBase]: 545/954 cut-off events. [2024-06-20 19:37:03,495 INFO L125 PetriNetUnfolderBase]: For 57461/57461 co-relation queries the response was YES. [2024-06-20 19:37:03,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6378 conditions, 954 events. 545/954 cut-off events. For 57461/57461 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4502 event pairs, 75 based on Foata normal form. 3/957 useless extension candidates. Maximal degree in co-relation 6289. Up to 740 conditions per place. [2024-06-20 19:37:03,502 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 154 selfloop transitions, 62 changer transitions 0/218 dead transitions. [2024-06-20 19:37:03,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 218 transitions, 2633 flow [2024-06-20 19:37:03,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:37:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:37:03,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-20 19:37:03,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:37:03,504 INFO L175 Difference]: Start difference. First operand has 180 places, 151 transitions, 1443 flow. Second operand 11 states and 121 transitions. [2024-06-20 19:37:03,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 218 transitions, 2633 flow [2024-06-20 19:37:03,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 218 transitions, 2472 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-20 19:37:03,632 INFO L231 Difference]: Finished difference. Result has 189 places, 196 transitions, 2107 flow [2024-06-20 19:37:03,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2107, PETRI_PLACES=189, PETRI_TRANSITIONS=196} [2024-06-20 19:37:03,632 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 159 predicate places. [2024-06-20 19:37:03,632 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 196 transitions, 2107 flow [2024-06-20 19:37:03,632 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:37:03,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:03,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:37:03,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-20 19:37:03,633 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:37:03,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:03,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1315913651, now seen corresponding path program 2 times [2024-06-20 19:37:03,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:03,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995739695] [2024-06-20 19:37:03,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:03,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:10,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:37:10,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:10,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995739695] [2024-06-20 19:37:10,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995739695] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:10,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:10,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:37:10,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143575328] [2024-06-20 19:37:10,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:10,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:37:10,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:10,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:37:10,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:37:10,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:37:10,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 196 transitions, 2107 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:37:10,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:10,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:37:10,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:10,879 INFO L124 PetriNetUnfolderBase]: 538/943 cut-off events. [2024-06-20 19:37:10,880 INFO L125 PetriNetUnfolderBase]: For 54209/54209 co-relation queries the response was YES. [2024-06-20 19:37:10,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6384 conditions, 943 events. 538/943 cut-off events. For 54209/54209 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4441 event pairs, 68 based on Foata normal form. 3/946 useless extension candidates. Maximal degree in co-relation 6289. Up to 714 conditions per place. [2024-06-20 19:37:10,887 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 155 selfloop transitions, 66 changer transitions 0/223 dead transitions. [2024-06-20 19:37:10,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 223 transitions, 2827 flow [2024-06-20 19:37:10,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:37:10,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:37:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2024-06-20 19:37:10,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35777126099706746 [2024-06-20 19:37:10,889 INFO L175 Difference]: Start difference. First operand has 189 places, 196 transitions, 2107 flow. Second operand 11 states and 122 transitions. [2024-06-20 19:37:10,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 223 transitions, 2827 flow [2024-06-20 19:37:11,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 223 transitions, 2789 flow, removed 18 selfloop flow, removed 1 redundant places. [2024-06-20 19:37:11,006 INFO L231 Difference]: Finished difference. Result has 200 places, 199 transitions, 2284 flow [2024-06-20 19:37:11,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2069, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2284, PETRI_PLACES=200, PETRI_TRANSITIONS=199} [2024-06-20 19:37:11,006 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 170 predicate places. [2024-06-20 19:37:11,007 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 199 transitions, 2284 flow [2024-06-20 19:37:11,007 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:37:11,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:11,007 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:37:11,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-20 19:37:11,007 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:37:11,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:11,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1865095327, now seen corresponding path program 3 times [2024-06-20 19:37:11,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:11,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568649742] [2024-06-20 19:37:11,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:11,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:37:17,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:17,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568649742] [2024-06-20 19:37:17,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568649742] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:17,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:17,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:37:17,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877885904] [2024-06-20 19:37:17,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:17,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:37:17,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:17,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:37:17,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:37:17,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:37:17,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 199 transitions, 2284 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:37:17,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:17,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:37:17,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:17,862 INFO L124 PetriNetUnfolderBase]: 559/978 cut-off events. [2024-06-20 19:37:17,863 INFO L125 PetriNetUnfolderBase]: For 60094/60094 co-relation queries the response was YES. [2024-06-20 19:37:17,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6941 conditions, 978 events. 559/978 cut-off events. For 60094/60094 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4636 event pairs, 172 based on Foata normal form. 3/981 useless extension candidates. Maximal degree in co-relation 6842. Up to 929 conditions per place. [2024-06-20 19:37:17,871 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 195 selfloop transitions, 19 changer transitions 0/216 dead transitions. [2024-06-20 19:37:17,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 216 transitions, 2954 flow [2024-06-20 19:37:17,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:37:17,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:37:17,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2024-06-20 19:37:17,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-20 19:37:17,872 INFO L175 Difference]: Start difference. First operand has 200 places, 199 transitions, 2284 flow. Second operand 10 states and 100 transitions. [2024-06-20 19:37:17,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 216 transitions, 2954 flow [2024-06-20 19:37:18,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 216 transitions, 2713 flow, removed 57 selfloop flow, removed 9 redundant places. [2024-06-20 19:37:18,016 INFO L231 Difference]: Finished difference. Result has 202 places, 204 transitions, 2188 flow [2024-06-20 19:37:18,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2043, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2188, PETRI_PLACES=202, PETRI_TRANSITIONS=204} [2024-06-20 19:37:18,017 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 172 predicate places. [2024-06-20 19:37:18,017 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 204 transitions, 2188 flow [2024-06-20 19:37:18,017 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:37:18,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:18,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:18,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-20 19:37:18,018 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:37:18,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:18,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1865095048, now seen corresponding path program 6 times [2024-06-20 19:37:18,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:18,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701551084] [2024-06-20 19:37:18,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:18,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:23,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:37:23,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:23,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701551084] [2024-06-20 19:37:23,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701551084] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:23,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:23,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:37:23,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919377147] [2024-06-20 19:37:23,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:23,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:37:23,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:23,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:37:23,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:37:23,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:37:23,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 204 transitions, 2188 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:37:23,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:23,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:37:23,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:24,166 INFO L124 PetriNetUnfolderBase]: 566/990 cut-off events. [2024-06-20 19:37:24,166 INFO L125 PetriNetUnfolderBase]: For 61743/61743 co-relation queries the response was YES. [2024-06-20 19:37:24,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6700 conditions, 990 events. 566/990 cut-off events. For 61743/61743 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4690 event pairs, 177 based on Foata normal form. 4/994 useless extension candidates. Maximal degree in co-relation 6603. Up to 930 conditions per place. [2024-06-20 19:37:24,174 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 194 selfloop transitions, 24 changer transitions 0/220 dead transitions. [2024-06-20 19:37:24,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 220 transitions, 2842 flow [2024-06-20 19:37:24,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:37:24,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:37:24,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-20 19:37:24,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32903225806451614 [2024-06-20 19:37:24,175 INFO L175 Difference]: Start difference. First operand has 202 places, 204 transitions, 2188 flow. Second operand 10 states and 102 transitions. [2024-06-20 19:37:24,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 220 transitions, 2842 flow [2024-06-20 19:37:24,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 220 transitions, 2748 flow, removed 38 selfloop flow, removed 6 redundant places. [2024-06-20 19:37:24,307 INFO L231 Difference]: Finished difference. Result has 207 places, 208 transitions, 2228 flow [2024-06-20 19:37:24,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2094, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2228, PETRI_PLACES=207, PETRI_TRANSITIONS=208} [2024-06-20 19:37:24,308 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 177 predicate places. [2024-06-20 19:37:24,308 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 208 transitions, 2228 flow [2024-06-20 19:37:24,308 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:37:24,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:24,308 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:37:24,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-20 19:37:24,308 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:37:24,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:24,309 INFO L85 PathProgramCache]: Analyzing trace with hash 919251196, now seen corresponding path program 7 times [2024-06-20 19:37:24,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:24,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806395460] [2024-06-20 19:37:24,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:24,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:37:30,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:30,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806395460] [2024-06-20 19:37:30,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806395460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:30,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:30,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:37:30,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500214232] [2024-06-20 19:37:30,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:30,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:37:30,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:30,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:37:30,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:37:30,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:37:30,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 208 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:37:30,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:30,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:37:30,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:31,336 INFO L124 PetriNetUnfolderBase]: 570/998 cut-off events. [2024-06-20 19:37:31,337 INFO L125 PetriNetUnfolderBase]: For 59961/59961 co-relation queries the response was YES. [2024-06-20 19:37:31,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6804 conditions, 998 events. 570/998 cut-off events. For 59961/59961 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4769 event pairs, 72 based on Foata normal form. 2/1000 useless extension candidates. Maximal degree in co-relation 6704. Up to 787 conditions per place. [2024-06-20 19:37:31,345 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 161 selfloop transitions, 58 changer transitions 0/221 dead transitions. [2024-06-20 19:37:31,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 221 transitions, 2720 flow [2024-06-20 19:37:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:37:31,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:37:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-20 19:37:31,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-20 19:37:31,347 INFO L175 Difference]: Start difference. First operand has 207 places, 208 transitions, 2228 flow. Second operand 9 states and 98 transitions. [2024-06-20 19:37:31,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 221 transitions, 2720 flow [2024-06-20 19:37:31,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 221 transitions, 2667 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-20 19:37:31,478 INFO L231 Difference]: Finished difference. Result has 210 places, 209 transitions, 2319 flow [2024-06-20 19:37:31,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2175, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2319, PETRI_PLACES=210, PETRI_TRANSITIONS=209} [2024-06-20 19:37:31,479 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2024-06-20 19:37:31,479 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 209 transitions, 2319 flow [2024-06-20 19:37:31,479 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:37:31,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:31,479 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:37:31,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-20 19:37:31,479 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:37:31,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:31,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1126062178, now seen corresponding path program 7 times [2024-06-20 19:37:31,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:31,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036862078] [2024-06-20 19:37:31,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:31,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:37,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:37:37,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:37,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036862078] [2024-06-20 19:37:37,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036862078] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:37,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:37,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:37:37,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505208980] [2024-06-20 19:37:37,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:37,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:37:37,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:37,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:37:37,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:37:37,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:37:37,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 209 transitions, 2319 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:37:37,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:37,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:37:37,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:38,360 INFO L124 PetriNetUnfolderBase]: 609/1062 cut-off events. [2024-06-20 19:37:38,360 INFO L125 PetriNetUnfolderBase]: For 76674/76674 co-relation queries the response was YES. [2024-06-20 19:37:38,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7691 conditions, 1062 events. 609/1062 cut-off events. For 76674/76674 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5125 event pairs, 59 based on Foata normal form. 4/1066 useless extension candidates. Maximal degree in co-relation 7589. Up to 425 conditions per place. [2024-06-20 19:37:38,371 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 117 selfloop transitions, 119 changer transitions 0/238 dead transitions. [2024-06-20 19:37:38,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 238 transitions, 3451 flow [2024-06-20 19:37:38,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:37:38,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:37:38,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-20 19:37:38,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3903225806451613 [2024-06-20 19:37:38,373 INFO L175 Difference]: Start difference. First operand has 210 places, 209 transitions, 2319 flow. Second operand 10 states and 121 transitions. [2024-06-20 19:37:38,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 238 transitions, 3451 flow [2024-06-20 19:37:38,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 238 transitions, 3317 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-20 19:37:38,550 INFO L231 Difference]: Finished difference. Result has 214 places, 217 transitions, 2595 flow [2024-06-20 19:37:38,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2185, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2595, PETRI_PLACES=214, PETRI_TRANSITIONS=217} [2024-06-20 19:37:38,551 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 184 predicate places. [2024-06-20 19:37:38,551 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 217 transitions, 2595 flow [2024-06-20 19:37:38,552 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:37:38,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:38,552 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:37:38,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-20 19:37:38,552 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:37:38,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:38,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1865421757, now seen corresponding path program 4 times [2024-06-20 19:37:38,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:38,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747470081] [2024-06-20 19:37:38,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:38,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:45,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:37:45,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:45,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747470081] [2024-06-20 19:37:45,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747470081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:45,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:45,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:37:45,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864532431] [2024-06-20 19:37:45,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:45,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:37:45,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:45,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:37:45,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:37:45,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:37:45,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 217 transitions, 2595 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:37:45,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:45,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:37:45,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:46,074 INFO L124 PetriNetUnfolderBase]: 605/1055 cut-off events. [2024-06-20 19:37:46,074 INFO L125 PetriNetUnfolderBase]: For 70949/70949 co-relation queries the response was YES. [2024-06-20 19:37:46,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7844 conditions, 1055 events. 605/1055 cut-off events. For 70949/70949 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5090 event pairs, 183 based on Foata normal form. 1/1056 useless extension candidates. Maximal degree in co-relation 7740. Up to 1020 conditions per place. [2024-06-20 19:37:46,084 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 205 selfloop transitions, 21 changer transitions 0/228 dead transitions. [2024-06-20 19:37:46,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 228 transitions, 3079 flow [2024-06-20 19:37:46,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:37:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:37:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2024-06-20 19:37:46,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30498533724340177 [2024-06-20 19:37:46,085 INFO L175 Difference]: Start difference. First operand has 214 places, 217 transitions, 2595 flow. Second operand 11 states and 104 transitions. [2024-06-20 19:37:46,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 228 transitions, 3079 flow [2024-06-20 19:37:46,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 228 transitions, 2885 flow, removed 47 selfloop flow, removed 5 redundant places. [2024-06-20 19:37:46,242 INFO L231 Difference]: Finished difference. Result has 221 places, 218 transitions, 2466 flow [2024-06-20 19:37:46,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2402, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2466, PETRI_PLACES=221, PETRI_TRANSITIONS=218} [2024-06-20 19:37:46,243 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 191 predicate places. [2024-06-20 19:37:46,244 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 218 transitions, 2466 flow [2024-06-20 19:37:46,244 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:37:46,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:46,244 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:37:46,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-20 19:37:46,245 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:37:46,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:46,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1855898557, now seen corresponding path program 5 times [2024-06-20 19:37:46,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:46,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364991252] [2024-06-20 19:37:46,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:46,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:37:52,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:52,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364991252] [2024-06-20 19:37:52,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364991252] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:52,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:52,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:37:52,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962525842] [2024-06-20 19:37:52,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:52,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:37:52,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:52,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:37:52,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:37:52,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:37:52,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 218 transitions, 2466 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:37:52,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:52,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:37:52,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:52,852 INFO L124 PetriNetUnfolderBase]: 599/1046 cut-off events. [2024-06-20 19:37:52,852 INFO L125 PetriNetUnfolderBase]: For 69377/69377 co-relation queries the response was YES. [2024-06-20 19:37:52,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7413 conditions, 1046 events. 599/1046 cut-off events. For 69377/69377 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5043 event pairs, 52 based on Foata normal form. 3/1049 useless extension candidates. Maximal degree in co-relation 7306. Up to 538 conditions per place. [2024-06-20 19:37:52,861 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 110 selfloop transitions, 129 changer transitions 0/241 dead transitions. [2024-06-20 19:37:52,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 241 transitions, 3361 flow [2024-06-20 19:37:52,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:37:52,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:37:52,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-20 19:37:52,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36950146627565983 [2024-06-20 19:37:52,863 INFO L175 Difference]: Start difference. First operand has 221 places, 218 transitions, 2466 flow. Second operand 11 states and 126 transitions. [2024-06-20 19:37:52,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 241 transitions, 3361 flow [2024-06-20 19:37:53,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 241 transitions, 3312 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-20 19:37:53,018 INFO L231 Difference]: Finished difference. Result has 225 places, 223 transitions, 2856 flow [2024-06-20 19:37:53,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2417, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2856, PETRI_PLACES=225, PETRI_TRANSITIONS=223} [2024-06-20 19:37:53,018 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 195 predicate places. [2024-06-20 19:37:53,018 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 223 transitions, 2856 flow [2024-06-20 19:37:53,018 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:37:53,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:53,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:53,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-20 19:37:53,019 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:37:53,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1599397768, now seen corresponding path program 8 times [2024-06-20 19:37:53,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:53,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683424881] [2024-06-20 19:37:53,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:53,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:58,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:37:58,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:58,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683424881] [2024-06-20 19:37:58,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683424881] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:58,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:58,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:37:58,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333981660] [2024-06-20 19:37:58,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:58,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:37:58,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:58,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:37:58,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:37:59,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:37:59,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 223 transitions, 2856 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:37:59,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:59,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:37:59,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:59,464 INFO L124 PetriNetUnfolderBase]: 638/1110 cut-off events. [2024-06-20 19:37:59,464 INFO L125 PetriNetUnfolderBase]: For 86967/86967 co-relation queries the response was YES. [2024-06-20 19:37:59,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8754 conditions, 1110 events. 638/1110 cut-off events. For 86967/86967 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5413 event pairs, 77 based on Foata normal form. 4/1114 useless extension candidates. Maximal degree in co-relation 8644. Up to 443 conditions per place. [2024-06-20 19:37:59,474 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 132 selfloop transitions, 117 changer transitions 0/251 dead transitions. [2024-06-20 19:37:59,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 251 transitions, 4052 flow [2024-06-20 19:37:59,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:37:59,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:37:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-20 19:37:59,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-20 19:37:59,475 INFO L175 Difference]: Start difference. First operand has 225 places, 223 transitions, 2856 flow. Second operand 10 states and 122 transitions. [2024-06-20 19:37:59,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 251 transitions, 4052 flow [2024-06-20 19:37:59,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 251 transitions, 3897 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-20 19:37:59,669 INFO L231 Difference]: Finished difference. Result has 229 places, 231 transitions, 3143 flow [2024-06-20 19:37:59,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2705, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3143, PETRI_PLACES=229, PETRI_TRANSITIONS=231} [2024-06-20 19:37:59,669 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 199 predicate places. [2024-06-20 19:37:59,669 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 231 transitions, 3143 flow [2024-06-20 19:37:59,669 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:37:59,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:59,670 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:37:59,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-20 19:37:59,670 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:37:59,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:59,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1176296038, now seen corresponding path program 8 times [2024-06-20 19:37:59,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:59,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894236837] [2024-06-20 19:37:59,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:59,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:05,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:05,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:05,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894236837] [2024-06-20 19:38:05,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894236837] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:05,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:05,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:38:05,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004799932] [2024-06-20 19:38:05,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:05,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:38:05,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:05,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:38:05,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:38:06,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:38:06,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 231 transitions, 3143 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:38:06,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:06,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:38:06,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:06,536 INFO L124 PetriNetUnfolderBase]: 642/1118 cut-off events. [2024-06-20 19:38:06,536 INFO L125 PetriNetUnfolderBase]: For 85320/85320 co-relation queries the response was YES. [2024-06-20 19:38:06,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9040 conditions, 1118 events. 642/1118 cut-off events. For 85320/85320 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5477 event pairs, 84 based on Foata normal form. 2/1120 useless extension candidates. Maximal degree in co-relation 8928. Up to 882 conditions per place. [2024-06-20 19:38:06,545 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 183 selfloop transitions, 60 changer transitions 0/245 dead transitions. [2024-06-20 19:38:06,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 245 transitions, 3823 flow [2024-06-20 19:38:06,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:38:06,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:38:06,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-20 19:38:06,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:38:06,546 INFO L175 Difference]: Start difference. First operand has 229 places, 231 transitions, 3143 flow. Second operand 9 states and 99 transitions. [2024-06-20 19:38:06,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 245 transitions, 3823 flow [2024-06-20 19:38:06,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 245 transitions, 3572 flow, removed 47 selfloop flow, removed 6 redundant places. [2024-06-20 19:38:06,758 INFO L231 Difference]: Finished difference. Result has 232 places, 232 transitions, 3040 flow [2024-06-20 19:38:06,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2892, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3040, PETRI_PLACES=232, PETRI_TRANSITIONS=232} [2024-06-20 19:38:06,758 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 202 predicate places. [2024-06-20 19:38:06,759 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 232 transitions, 3040 flow [2024-06-20 19:38:06,759 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:38:06,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:06,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:06,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-20 19:38:06,760 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:38:06,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:06,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1855890838, now seen corresponding path program 9 times [2024-06-20 19:38:06,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:06,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810243012] [2024-06-20 19:38:06,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:06,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:12,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:12,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810243012] [2024-06-20 19:38:12,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810243012] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:12,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:12,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:38:12,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635203842] [2024-06-20 19:38:12,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:12,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:38:12,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:12,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:38:12,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:38:12,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:38:12,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 232 transitions, 3040 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:38:12,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:12,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:38:12,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:13,315 INFO L124 PetriNetUnfolderBase]: 636/1108 cut-off events. [2024-06-20 19:38:13,316 INFO L125 PetriNetUnfolderBase]: For 81759/81759 co-relation queries the response was YES. [2024-06-20 19:38:13,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8606 conditions, 1108 events. 636/1108 cut-off events. For 81759/81759 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5411 event pairs, 61 based on Foata normal form. 2/1110 useless extension candidates. Maximal degree in co-relation 8493. Up to 447 conditions per place. [2024-06-20 19:38:13,326 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 113 selfloop transitions, 134 changer transitions 0/249 dead transitions. [2024-06-20 19:38:13,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 249 transitions, 3750 flow [2024-06-20 19:38:13,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:38:13,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:38:13,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-20 19:38:13,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4129032258064516 [2024-06-20 19:38:13,327 INFO L175 Difference]: Start difference. First operand has 232 places, 232 transitions, 3040 flow. Second operand 10 states and 128 transitions. [2024-06-20 19:38:13,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 249 transitions, 3750 flow [2024-06-20 19:38:13,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 249 transitions, 3573 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-20 19:38:13,530 INFO L231 Difference]: Finished difference. Result has 235 places, 232 transitions, 3136 flow [2024-06-20 19:38:13,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2863, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3136, PETRI_PLACES=235, PETRI_TRANSITIONS=232} [2024-06-20 19:38:13,530 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 205 predicate places. [2024-06-20 19:38:13,531 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 232 transitions, 3136 flow [2024-06-20 19:38:13,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:38:13,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:13,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:13,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-20 19:38:13,531 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:38:13,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:13,531 INFO L85 PathProgramCache]: Analyzing trace with hash -976846378, now seen corresponding path program 9 times [2024-06-20 19:38:13,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:13,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988301217] [2024-06-20 19:38:13,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:13,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:19,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:19,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:19,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988301217] [2024-06-20 19:38:19,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988301217] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:19,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:19,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:38:19,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358586905] [2024-06-20 19:38:19,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:19,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:38:19,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:19,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:38:19,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:38:19,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:38:19,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 232 transitions, 3136 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:38:19,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:19,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:38:19,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:19,641 INFO L124 PetriNetUnfolderBase]: 640/1116 cut-off events. [2024-06-20 19:38:19,641 INFO L125 PetriNetUnfolderBase]: For 85162/85162 co-relation queries the response was YES. [2024-06-20 19:38:19,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8776 conditions, 1116 events. 640/1116 cut-off events. For 85162/85162 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5470 event pairs, 72 based on Foata normal form. 2/1118 useless extension candidates. Maximal degree in co-relation 8663. Up to 905 conditions per place. [2024-06-20 19:38:19,652 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 176 selfloop transitions, 67 changer transitions 0/245 dead transitions. [2024-06-20 19:38:19,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 245 transitions, 3673 flow [2024-06-20 19:38:19,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:38:19,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:38:19,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-20 19:38:19,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-20 19:38:19,654 INFO L175 Difference]: Start difference. First operand has 235 places, 232 transitions, 3136 flow. Second operand 9 states and 97 transitions. [2024-06-20 19:38:19,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 245 transitions, 3673 flow [2024-06-20 19:38:19,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 245 transitions, 3337 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-20 19:38:19,848 INFO L231 Difference]: Finished difference. Result has 233 places, 233 transitions, 2959 flow [2024-06-20 19:38:19,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2800, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2959, PETRI_PLACES=233, PETRI_TRANSITIONS=233} [2024-06-20 19:38:19,849 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 203 predicate places. [2024-06-20 19:38:19,849 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 233 transitions, 2959 flow [2024-06-20 19:38:19,849 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:38:19,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:19,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:19,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-20 19:38:19,850 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:38:19,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:19,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1599398047, now seen corresponding path program 6 times [2024-06-20 19:38:19,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:19,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192728154] [2024-06-20 19:38:19,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:19,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:25,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:25,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:25,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192728154] [2024-06-20 19:38:25,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192728154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:25,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:25,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:38:25,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831364113] [2024-06-20 19:38:25,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:25,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:38:25,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:25,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:38:25,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:38:25,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:38:25,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 233 transitions, 2959 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:38:25,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:25,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:38:25,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:26,172 INFO L124 PetriNetUnfolderBase]: 634/1107 cut-off events. [2024-06-20 19:38:26,172 INFO L125 PetriNetUnfolderBase]: For 80781/80781 co-relation queries the response was YES. [2024-06-20 19:38:26,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8208 conditions, 1107 events. 634/1107 cut-off events. For 80781/80781 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5455 event pairs, 65 based on Foata normal form. 3/1110 useless extension candidates. Maximal degree in co-relation 8096. Up to 591 conditions per place. [2024-06-20 19:38:26,182 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 129 selfloop transitions, 121 changer transitions 0/252 dead transitions. [2024-06-20 19:38:26,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 252 transitions, 3827 flow [2024-06-20 19:38:26,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:38:26,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:38:26,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-20 19:38:26,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724340175953079 [2024-06-20 19:38:26,183 INFO L175 Difference]: Start difference. First operand has 233 places, 233 transitions, 2959 flow. Second operand 11 states and 127 transitions. [2024-06-20 19:38:26,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 252 transitions, 3827 flow [2024-06-20 19:38:26,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 252 transitions, 3679 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-20 19:38:26,360 INFO L231 Difference]: Finished difference. Result has 237 places, 234 transitions, 3088 flow [2024-06-20 19:38:26,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2811, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3088, PETRI_PLACES=237, PETRI_TRANSITIONS=234} [2024-06-20 19:38:26,360 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 207 predicate places. [2024-06-20 19:38:26,361 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 234 transitions, 3088 flow [2024-06-20 19:38:26,361 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:38:26,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:26,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:26,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-20 19:38:26,361 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:38:26,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:26,362 INFO L85 PathProgramCache]: Analyzing trace with hash 919401298, now seen corresponding path program 10 times [2024-06-20 19:38:26,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:26,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862210383] [2024-06-20 19:38:26,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:26,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:32,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:38:32,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:32,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862210383] [2024-06-20 19:38:32,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862210383] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:32,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:32,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:38:32,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788984059] [2024-06-20 19:38:32,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:32,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:38:32,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:32,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:38:32,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:38:32,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:38:32,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 234 transitions, 3088 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:38:32,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:32,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:38:32,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:33,401 INFO L124 PetriNetUnfolderBase]: 650/1133 cut-off events. [2024-06-20 19:38:33,401 INFO L125 PetriNetUnfolderBase]: For 87182/87182 co-relation queries the response was YES. [2024-06-20 19:38:33,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8713 conditions, 1133 events. 650/1133 cut-off events. For 87182/87182 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5575 event pairs, 102 based on Foata normal form. 2/1135 useless extension candidates. Maximal degree in co-relation 8600. Up to 462 conditions per place. [2024-06-20 19:38:33,412 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 130 selfloop transitions, 125 changer transitions 0/257 dead transitions. [2024-06-20 19:38:33,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 257 transitions, 4213 flow [2024-06-20 19:38:33,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:38:33,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:38:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-20 19:38:33,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-20 19:38:33,413 INFO L175 Difference]: Start difference. First operand has 237 places, 234 transitions, 3088 flow. Second operand 10 states and 122 transitions. [2024-06-20 19:38:33,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 257 transitions, 4213 flow [2024-06-20 19:38:33,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 257 transitions, 4010 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-20 19:38:33,615 INFO L231 Difference]: Finished difference. Result has 241 places, 239 transitions, 3306 flow [2024-06-20 19:38:33,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2887, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3306, PETRI_PLACES=241, PETRI_TRANSITIONS=239} [2024-06-20 19:38:33,615 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 211 predicate places. [2024-06-20 19:38:33,615 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 239 transitions, 3306 flow [2024-06-20 19:38:33,615 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:38:33,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:33,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:33,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-20 19:38:33,616 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:38:33,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:33,616 INFO L85 PathProgramCache]: Analyzing trace with hash -976638616, now seen corresponding path program 11 times [2024-06-20 19:38:33,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:33,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521375052] [2024-06-20 19:38:33,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:33,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:39,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:39,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:39,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521375052] [2024-06-20 19:38:39,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521375052] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:39,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:39,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:38:39,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165206118] [2024-06-20 19:38:39,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:39,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:38:39,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:39,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:38:39,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:38:39,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:38:39,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 239 transitions, 3306 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:38:39,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:39,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:38:39,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:40,213 INFO L124 PetriNetUnfolderBase]: 656/1143 cut-off events. [2024-06-20 19:38:40,213 INFO L125 PetriNetUnfolderBase]: For 90444/90444 co-relation queries the response was YES. [2024-06-20 19:38:40,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8920 conditions, 1143 events. 656/1143 cut-off events. For 90444/90444 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5648 event pairs, 78 based on Foata normal form. 2/1145 useless extension candidates. Maximal degree in co-relation 8805. Up to 464 conditions per place. [2024-06-20 19:38:40,224 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 135 selfloop transitions, 121 changer transitions 0/258 dead transitions. [2024-06-20 19:38:40,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 258 transitions, 4215 flow [2024-06-20 19:38:40,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:38:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:38:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-20 19:38:40,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4258064516129032 [2024-06-20 19:38:40,226 INFO L175 Difference]: Start difference. First operand has 241 places, 239 transitions, 3306 flow. Second operand 10 states and 132 transitions. [2024-06-20 19:38:40,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 258 transitions, 4215 flow [2024-06-20 19:38:40,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 258 transitions, 3930 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-06-20 19:38:40,439 INFO L231 Difference]: Finished difference. Result has 244 places, 241 transitions, 3323 flow [2024-06-20 19:38:40,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3024, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3323, PETRI_PLACES=244, PETRI_TRANSITIONS=241} [2024-06-20 19:38:40,440 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places. [2024-06-20 19:38:40,440 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 241 transitions, 3323 flow [2024-06-20 19:38:40,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:38:40,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:40,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:40,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-20 19:38:40,440 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:38:40,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:40,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1170785788, now seen corresponding path program 10 times [2024-06-20 19:38:40,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:40,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870995725] [2024-06-20 19:38:40,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:40,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:46,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:46,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870995725] [2024-06-20 19:38:46,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870995725] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:46,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:46,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:38:46,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478192912] [2024-06-20 19:38:46,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:46,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:38:46,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:46,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:38:46,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:38:46,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:38:46,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 241 transitions, 3323 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:38:46,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:46,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:38:46,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:46,533 INFO L124 PetriNetUnfolderBase]: 653/1138 cut-off events. [2024-06-20 19:38:46,533 INFO L125 PetriNetUnfolderBase]: For 87557/87557 co-relation queries the response was YES. [2024-06-20 19:38:46,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8597 conditions, 1138 events. 653/1138 cut-off events. For 87557/87557 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5601 event pairs, 75 based on Foata normal form. 2/1140 useless extension candidates. Maximal degree in co-relation 8482. Up to 927 conditions per place. [2024-06-20 19:38:46,544 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 195 selfloop transitions, 57 changer transitions 0/254 dead transitions. [2024-06-20 19:38:46,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 254 transitions, 3863 flow [2024-06-20 19:38:46,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:38:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:38:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-20 19:38:46,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35842293906810035 [2024-06-20 19:38:46,548 INFO L175 Difference]: Start difference. First operand has 244 places, 241 transitions, 3323 flow. Second operand 9 states and 100 transitions. [2024-06-20 19:38:46,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 254 transitions, 3863 flow [2024-06-20 19:38:46,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 254 transitions, 3593 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-20 19:38:46,774 INFO L231 Difference]: Finished difference. Result has 246 places, 241 transitions, 3171 flow [2024-06-20 19:38:46,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3053, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3171, PETRI_PLACES=246, PETRI_TRANSITIONS=241} [2024-06-20 19:38:46,774 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 216 predicate places. [2024-06-20 19:38:46,774 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 241 transitions, 3171 flow [2024-06-20 19:38:46,775 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:38:46,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:46,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:46,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-20 19:38:46,775 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:38:46,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:46,776 INFO L85 PathProgramCache]: Analyzing trace with hash 924763678, now seen corresponding path program 12 times [2024-06-20 19:38:46,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:46,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837623696] [2024-06-20 19:38:46,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:46,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:53,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:53,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:53,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837623696] [2024-06-20 19:38:53,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837623696] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:53,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:53,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:38:53,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317251591] [2024-06-20 19:38:53,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:53,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:38:53,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:53,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:38:53,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:38:53,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:38:53,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 241 transitions, 3171 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:38:53,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:53,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:38:53,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:53,626 INFO L124 PetriNetUnfolderBase]: 659/1148 cut-off events. [2024-06-20 19:38:53,626 INFO L125 PetriNetUnfolderBase]: For 88842/88842 co-relation queries the response was YES. [2024-06-20 19:38:53,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8487 conditions, 1148 events. 659/1148 cut-off events. For 88842/88842 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5658 event pairs, 108 based on Foata normal form. 2/1150 useless extension candidates. Maximal degree in co-relation 8371. Up to 461 conditions per place. [2024-06-20 19:38:53,637 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 148 selfloop transitions, 112 changer transitions 0/262 dead transitions. [2024-06-20 19:38:53,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 262 transitions, 4402 flow [2024-06-20 19:38:53,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:38:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:38:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-20 19:38:53,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-06-20 19:38:53,638 INFO L175 Difference]: Start difference. First operand has 246 places, 241 transitions, 3171 flow. Second operand 10 states and 126 transitions. [2024-06-20 19:38:53,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 262 transitions, 4402 flow [2024-06-20 19:38:53,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 262 transitions, 4235 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-20 19:38:53,851 INFO L231 Difference]: Finished difference. Result has 247 places, 243 transitions, 3284 flow [2024-06-20 19:38:53,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3004, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3284, PETRI_PLACES=247, PETRI_TRANSITIONS=243} [2024-06-20 19:38:53,851 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 217 predicate places. [2024-06-20 19:38:53,851 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 243 transitions, 3284 flow [2024-06-20 19:38:53,851 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:38:53,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:53,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:53,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-20 19:38:53,852 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:38:53,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:53,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1599188518, now seen corresponding path program 13 times [2024-06-20 19:38:53,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:53,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178725690] [2024-06-20 19:38:53,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:53,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:59,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:59,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:59,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178725690] [2024-06-20 19:38:59,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178725690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:59,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:59,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:38:59,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301924731] [2024-06-20 19:38:59,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:59,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:38:59,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:59,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:38:59,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:39:00,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:39:00,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 243 transitions, 3284 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:39:00,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:00,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:39:00,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:00,487 INFO L124 PetriNetUnfolderBase]: 653/1138 cut-off events. [2024-06-20 19:39:00,487 INFO L125 PetriNetUnfolderBase]: For 85930/85930 co-relation queries the response was YES. [2024-06-20 19:39:00,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8377 conditions, 1138 events. 653/1138 cut-off events. For 85930/85930 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5620 event pairs, 76 based on Foata normal form. 2/1140 useless extension candidates. Maximal degree in co-relation 8260. Up to 457 conditions per place. [2024-06-20 19:39:00,496 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 125 selfloop transitions, 132 changer transitions 0/259 dead transitions. [2024-06-20 19:39:00,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 259 transitions, 3998 flow [2024-06-20 19:39:00,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:39:00,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:39:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-20 19:39:00,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645 [2024-06-20 19:39:00,497 INFO L175 Difference]: Start difference. First operand has 247 places, 243 transitions, 3284 flow. Second operand 10 states and 129 transitions. [2024-06-20 19:39:00,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 259 transitions, 3998 flow [2024-06-20 19:39:00,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 259 transitions, 3637 flow, removed 37 selfloop flow, removed 9 redundant places. [2024-06-20 19:39:00,702 INFO L231 Difference]: Finished difference. Result has 248 places, 243 transitions, 3192 flow [2024-06-20 19:39:00,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2923, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3192, PETRI_PLACES=248, PETRI_TRANSITIONS=243} [2024-06-20 19:39:00,703 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2024-06-20 19:39:00,703 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 243 transitions, 3192 flow [2024-06-20 19:39:00,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:39:00,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:00,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:39:00,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-20 19:39:00,703 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:39:00,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:00,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1170578026, now seen corresponding path program 14 times [2024-06-20 19:39:00,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:00,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074586167] [2024-06-20 19:39:00,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:00,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:06,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:39:06,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:06,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074586167] [2024-06-20 19:39:06,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074586167] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:06,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:06,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:39:06,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753375774] [2024-06-20 19:39:06,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:06,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:39:06,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:06,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:39:06,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:39:07,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:39:07,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 243 transitions, 3192 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:39:07,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:07,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:39:07,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:07,486 INFO L124 PetriNetUnfolderBase]: 659/1148 cut-off events. [2024-06-20 19:39:07,486 INFO L125 PetriNetUnfolderBase]: For 87105/87105 co-relation queries the response was YES. [2024-06-20 19:39:07,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8379 conditions, 1148 events. 659/1148 cut-off events. For 87105/87105 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5675 event pairs, 104 based on Foata normal form. 2/1150 useless extension candidates. Maximal degree in co-relation 8263. Up to 459 conditions per place. [2024-06-20 19:39:07,497 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 147 selfloop transitions, 114 changer transitions 0/263 dead transitions. [2024-06-20 19:39:07,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 263 transitions, 4285 flow [2024-06-20 19:39:07,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:39:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:39:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-20 19:39:07,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.432258064516129 [2024-06-20 19:39:07,499 INFO L175 Difference]: Start difference. First operand has 248 places, 243 transitions, 3192 flow. Second operand 10 states and 134 transitions. [2024-06-20 19:39:07,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 263 transitions, 4285 flow [2024-06-20 19:39:07,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 263 transitions, 3947 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-20 19:39:07,726 INFO L231 Difference]: Finished difference. Result has 247 places, 245 transitions, 3140 flow [2024-06-20 19:39:07,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2858, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3140, PETRI_PLACES=247, PETRI_TRANSITIONS=245} [2024-06-20 19:39:07,727 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 217 predicate places. [2024-06-20 19:39:07,727 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 245 transitions, 3140 flow [2024-06-20 19:39:07,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:39:07,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:07,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:39:07,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-20 19:39:07,728 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:39:07,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:07,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1170570586, now seen corresponding path program 15 times [2024-06-20 19:39:07,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:07,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251517244] [2024-06-20 19:39:07,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:07,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:13,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:39:13,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:13,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251517244] [2024-06-20 19:39:13,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251517244] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:13,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:13,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:39:13,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896800385] [2024-06-20 19:39:13,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:13,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:39:13,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:13,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:39:13,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:39:13,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:39:13,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 245 transitions, 3140 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:39:13,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:13,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:39:13,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:14,229 INFO L124 PetriNetUnfolderBase]: 653/1140 cut-off events. [2024-06-20 19:39:14,230 INFO L125 PetriNetUnfolderBase]: For 81246/81246 co-relation queries the response was YES. [2024-06-20 19:39:14,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7928 conditions, 1140 events. 653/1140 cut-off events. For 81246/81246 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5655 event pairs, 102 based on Foata normal form. 4/1144 useless extension candidates. Maximal degree in co-relation 7811. Up to 458 conditions per place. [2024-06-20 19:39:14,241 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 145 selfloop transitions, 115 changer transitions 0/262 dead transitions. [2024-06-20 19:39:14,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 262 transitions, 4024 flow [2024-06-20 19:39:14,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:39:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:39:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-20 19:39:14,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-20 19:39:14,242 INFO L175 Difference]: Start difference. First operand has 247 places, 245 transitions, 3140 flow. Second operand 10 states and 122 transitions. [2024-06-20 19:39:14,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 262 transitions, 4024 flow [2024-06-20 19:39:14,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 262 transitions, 3665 flow, removed 38 selfloop flow, removed 8 redundant places. [2024-06-20 19:39:14,456 INFO L231 Difference]: Finished difference. Result has 249 places, 245 transitions, 3019 flow [2024-06-20 19:39:14,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2781, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3019, PETRI_PLACES=249, PETRI_TRANSITIONS=245} [2024-06-20 19:39:14,457 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 219 predicate places. [2024-06-20 19:39:14,457 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 245 transitions, 3019 flow [2024-06-20 19:39:14,457 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:39:14,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:14,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:39:14,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-20 19:39:14,458 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:39:14,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:14,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1170570307, now seen corresponding path program 7 times [2024-06-20 19:39:14,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:14,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233063295] [2024-06-20 19:39:14,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:14,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:39:20,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:20,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233063295] [2024-06-20 19:39:20,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233063295] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:20,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:20,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:39:20,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974589081] [2024-06-20 19:39:20,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:20,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:39:20,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:20,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:39:20,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:39:20,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:39:20,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 245 transitions, 3019 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:39:20,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:20,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:39:20,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:20,865 INFO L124 PetriNetUnfolderBase]: 645/1127 cut-off events. [2024-06-20 19:39:20,865 INFO L125 PetriNetUnfolderBase]: For 70556/70556 co-relation queries the response was YES. [2024-06-20 19:39:20,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7502 conditions, 1127 events. 645/1127 cut-off events. For 70556/70556 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5590 event pairs, 93 based on Foata normal form. 3/1130 useless extension candidates. Maximal degree in co-relation 7384. Up to 596 conditions per place. [2024-06-20 19:39:20,876 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 139 selfloop transitions, 121 changer transitions 0/262 dead transitions. [2024-06-20 19:39:20,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 262 transitions, 3750 flow [2024-06-20 19:39:20,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:39:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:39:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-20 19:39:20,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724340175953079 [2024-06-20 19:39:20,877 INFO L175 Difference]: Start difference. First operand has 249 places, 245 transitions, 3019 flow. Second operand 11 states and 127 transitions. [2024-06-20 19:39:20,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 262 transitions, 3750 flow [2024-06-20 19:39:21,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 262 transitions, 3489 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-20 19:39:21,043 INFO L231 Difference]: Finished difference. Result has 252 places, 245 transitions, 3010 flow [2024-06-20 19:39:21,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2758, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3010, PETRI_PLACES=252, PETRI_TRANSITIONS=245} [2024-06-20 19:39:21,044 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 222 predicate places. [2024-06-20 19:39:21,044 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 245 transitions, 3010 flow [2024-06-20 19:39:21,044 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:39:21,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:21,044 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:39:21,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-20 19:39:21,045 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:39:21,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:21,045 INFO L85 PathProgramCache]: Analyzing trace with hash 738158287, now seen corresponding path program 1 times [2024-06-20 19:39:21,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:21,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97924703] [2024-06-20 19:39:21,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:21,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:27,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:39:27,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:27,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97924703] [2024-06-20 19:39:27,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97924703] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:27,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:27,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:39:27,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189200024] [2024-06-20 19:39:27,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:27,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:39:27,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:27,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:39:27,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:39:27,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:39:27,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 245 transitions, 3010 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:39:27,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:27,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:39:27,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:28,002 INFO L124 PetriNetUnfolderBase]: 662/1164 cut-off events. [2024-06-20 19:39:28,002 INFO L125 PetriNetUnfolderBase]: For 69181/69181 co-relation queries the response was YES. [2024-06-20 19:39:28,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7621 conditions, 1164 events. 662/1164 cut-off events. For 69181/69181 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5876 event pairs, 135 based on Foata normal form. 2/1166 useless extension candidates. Maximal degree in co-relation 7502. Up to 1071 conditions per place. [2024-06-20 19:39:28,013 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 243 selfloop transitions, 25 changer transitions 0/270 dead transitions. [2024-06-20 19:39:28,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 270 transitions, 3623 flow [2024-06-20 19:39:28,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:39:28,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:39:28,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2024-06-20 19:39:28,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3313782991202346 [2024-06-20 19:39:28,014 INFO L175 Difference]: Start difference. First operand has 252 places, 245 transitions, 3010 flow. Second operand 11 states and 113 transitions. [2024-06-20 19:39:28,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 270 transitions, 3623 flow [2024-06-20 19:39:28,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 270 transitions, 3167 flow, removed 2 selfloop flow, removed 14 redundant places. [2024-06-20 19:39:28,169 INFO L231 Difference]: Finished difference. Result has 252 places, 249 transitions, 2644 flow [2024-06-20 19:39:28,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2554, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2644, PETRI_PLACES=252, PETRI_TRANSITIONS=249} [2024-06-20 19:39:28,170 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 222 predicate places. [2024-06-20 19:39:28,170 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 249 transitions, 2644 flow [2024-06-20 19:39:28,170 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:39:28,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:28,170 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:39:28,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-20 19:39:28,170 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:39:28,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:28,171 INFO L85 PathProgramCache]: Analyzing trace with hash 101524471, now seen corresponding path program 2 times [2024-06-20 19:39:28,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:28,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242991086] [2024-06-20 19:39:28,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:28,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:39:34,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:34,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242991086] [2024-06-20 19:39:34,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242991086] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:34,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:34,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:39:34,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774372243] [2024-06-20 19:39:34,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:34,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:39:34,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:34,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:39:34,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:39:35,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:39:35,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 249 transitions, 2644 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:39:35,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:35,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:39:35,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:35,511 INFO L124 PetriNetUnfolderBase]: 703/1239 cut-off events. [2024-06-20 19:39:35,512 INFO L125 PetriNetUnfolderBase]: For 75800/75800 co-relation queries the response was YES. [2024-06-20 19:39:35,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7778 conditions, 1239 events. 703/1239 cut-off events. For 75800/75800 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6398 event pairs, 138 based on Foata normal form. 2/1241 useless extension candidates. Maximal degree in co-relation 7655. Up to 1102 conditions per place. [2024-06-20 19:39:35,524 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 248 selfloop transitions, 33 changer transitions 0/283 dead transitions. [2024-06-20 19:39:35,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 283 transitions, 3567 flow [2024-06-20 19:39:35,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:39:35,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:39:35,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-20 19:39:35,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3460410557184751 [2024-06-20 19:39:35,526 INFO L175 Difference]: Start difference. First operand has 252 places, 249 transitions, 2644 flow. Second operand 11 states and 118 transitions. [2024-06-20 19:39:35,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 283 transitions, 3567 flow [2024-06-20 19:39:35,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 283 transitions, 3517 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-20 19:39:35,722 INFO L231 Difference]: Finished difference. Result has 261 places, 259 transitions, 2817 flow [2024-06-20 19:39:35,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2594, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2817, PETRI_PLACES=261, PETRI_TRANSITIONS=259} [2024-06-20 19:39:35,722 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 231 predicate places. [2024-06-20 19:39:35,722 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 259 transitions, 2817 flow [2024-06-20 19:39:35,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:39:35,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:35,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:39:35,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-20 19:39:35,723 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:39:35,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:35,723 INFO L85 PathProgramCache]: Analyzing trace with hash 110910217, now seen corresponding path program 1 times [2024-06-20 19:39:35,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:35,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142126776] [2024-06-20 19:39:35,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:35,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:39:42,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:42,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142126776] [2024-06-20 19:39:42,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142126776] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:42,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:42,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:39:42,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684768341] [2024-06-20 19:39:42,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:42,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:39:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:42,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:39:42,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:39:42,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:39:42,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 259 transitions, 2817 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:39:42,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:42,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:39:42,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:42,866 INFO L124 PetriNetUnfolderBase]: 712/1254 cut-off events. [2024-06-20 19:39:42,866 INFO L125 PetriNetUnfolderBase]: For 74681/74681 co-relation queries the response was YES. [2024-06-20 19:39:42,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7993 conditions, 1254 events. 712/1254 cut-off events. For 74681/74681 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6517 event pairs, 144 based on Foata normal form. 1/1255 useless extension candidates. Maximal degree in co-relation 7866. Up to 1153 conditions per place. [2024-06-20 19:39:42,878 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 246 selfloop transitions, 37 changer transitions 0/285 dead transitions. [2024-06-20 19:39:42,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 285 transitions, 3536 flow [2024-06-20 19:39:42,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:39:42,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:39:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-20 19:39:42,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-20 19:39:42,879 INFO L175 Difference]: Start difference. First operand has 261 places, 259 transitions, 2817 flow. Second operand 11 states and 116 transitions. [2024-06-20 19:39:42,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 285 transitions, 3536 flow [2024-06-20 19:39:43,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 285 transitions, 3494 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-20 19:39:43,098 INFO L231 Difference]: Finished difference. Result has 268 places, 265 transitions, 2969 flow [2024-06-20 19:39:43,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2775, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2969, PETRI_PLACES=268, PETRI_TRANSITIONS=265} [2024-06-20 19:39:43,099 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 238 predicate places. [2024-06-20 19:39:43,099 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 265 transitions, 2969 flow [2024-06-20 19:39:43,099 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:39:43,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:43,099 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:39:43,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-20 19:39:43,100 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:39:43,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:43,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1850351047, now seen corresponding path program 3 times [2024-06-20 19:39:43,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:43,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690430220] [2024-06-20 19:39:43,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:43,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:39:49,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:49,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690430220] [2024-06-20 19:39:49,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690430220] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:49,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:49,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:39:49,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698077610] [2024-06-20 19:39:49,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:49,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:39:49,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:49,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:39:49,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:39:50,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:39:50,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 265 transitions, 2969 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:39:50,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:50,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:39:50,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:50,521 INFO L124 PetriNetUnfolderBase]: 716/1262 cut-off events. [2024-06-20 19:39:50,521 INFO L125 PetriNetUnfolderBase]: For 80153/80153 co-relation queries the response was YES. [2024-06-20 19:39:50,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8127 conditions, 1262 events. 716/1262 cut-off events. For 80153/80153 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6577 event pairs, 149 based on Foata normal form. 2/1264 useless extension candidates. Maximal degree in co-relation 7997. Up to 1164 conditions per place. [2024-06-20 19:39:50,534 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 250 selfloop transitions, 34 changer transitions 0/286 dead transitions. [2024-06-20 19:39:50,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 286 transitions, 3605 flow [2024-06-20 19:39:50,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:39:50,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:39:50,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-20 19:39:50,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33724340175953077 [2024-06-20 19:39:50,535 INFO L175 Difference]: Start difference. First operand has 268 places, 265 transitions, 2969 flow. Second operand 11 states and 115 transitions. [2024-06-20 19:39:50,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 286 transitions, 3605 flow [2024-06-20 19:39:50,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 286 transitions, 3509 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-20 19:39:50,776 INFO L231 Difference]: Finished difference. Result has 271 places, 266 transitions, 2959 flow [2024-06-20 19:39:50,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2873, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2959, PETRI_PLACES=271, PETRI_TRANSITIONS=266} [2024-06-20 19:39:50,777 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 241 predicate places. [2024-06-20 19:39:50,777 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 266 transitions, 2959 flow [2024-06-20 19:39:50,777 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:39:50,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:50,777 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:39:50,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-20 19:39:50,778 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:39:50,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:50,778 INFO L85 PathProgramCache]: Analyzing trace with hash 110750071, now seen corresponding path program 4 times [2024-06-20 19:39:50,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:50,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466625392] [2024-06-20 19:39:50,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:50,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:39:57,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:57,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466625392] [2024-06-20 19:39:57,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466625392] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:57,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:57,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:39:57,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428486928] [2024-06-20 19:39:57,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:57,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:39:57,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:57,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:39:57,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:39:57,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:39:57,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 266 transitions, 2959 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:39:57,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:57,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:39:57,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:58,308 INFO L124 PetriNetUnfolderBase]: 713/1257 cut-off events. [2024-06-20 19:39:58,308 INFO L125 PetriNetUnfolderBase]: For 74627/74627 co-relation queries the response was YES. [2024-06-20 19:39:58,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7935 conditions, 1257 events. 713/1257 cut-off events. For 74627/74627 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6535 event pairs, 143 based on Foata normal form. 2/1259 useless extension candidates. Maximal degree in co-relation 7805. Up to 1143 conditions per place. [2024-06-20 19:39:58,321 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 251 selfloop transitions, 34 changer transitions 0/287 dead transitions. [2024-06-20 19:39:58,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 287 transitions, 3587 flow [2024-06-20 19:39:58,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:39:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:39:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-20 19:39:58,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-20 19:39:58,322 INFO L175 Difference]: Start difference. First operand has 271 places, 266 transitions, 2959 flow. Second operand 11 states and 116 transitions. [2024-06-20 19:39:58,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 287 transitions, 3587 flow [2024-06-20 19:39:58,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 287 transitions, 3510 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-20 19:39:58,568 INFO L231 Difference]: Finished difference. Result has 274 places, 267 transitions, 2965 flow [2024-06-20 19:39:58,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2882, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2965, PETRI_PLACES=274, PETRI_TRANSITIONS=267} [2024-06-20 19:39:58,568 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 244 predicate places. [2024-06-20 19:39:58,568 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 267 transitions, 2965 flow [2024-06-20 19:39:58,568 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:39:58,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:58,568 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:39:58,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-20 19:39:58,569 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:39:58,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:58,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1992674625, now seen corresponding path program 5 times [2024-06-20 19:39:58,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:58,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618538397] [2024-06-20 19:39:58,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:58,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:40:04,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:04,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618538397] [2024-06-20 19:40:04,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618538397] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:04,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:04,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:40:04,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775113733] [2024-06-20 19:40:04,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:04,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:40:04,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:04,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:40:04,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:40:05,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:40:05,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 267 transitions, 2965 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:40:05,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:05,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:40:05,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:05,506 INFO L124 PetriNetUnfolderBase]: 730/1292 cut-off events. [2024-06-20 19:40:05,507 INFO L125 PetriNetUnfolderBase]: For 76380/76380 co-relation queries the response was YES. [2024-06-20 19:40:05,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8075 conditions, 1292 events. 730/1292 cut-off events. For 76380/76380 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 6816 event pairs, 134 based on Foata normal form. 2/1294 useless extension candidates. Maximal degree in co-relation 7943. Up to 1171 conditions per place. [2024-06-20 19:40:05,520 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 262 selfloop transitions, 27 changer transitions 0/291 dead transitions. [2024-06-20 19:40:05,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 291 transitions, 3623 flow [2024-06-20 19:40:05,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:40:05,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:40:05,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-20 19:40:05,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-20 19:40:05,522 INFO L175 Difference]: Start difference. First operand has 274 places, 267 transitions, 2965 flow. Second operand 11 states and 110 transitions. [2024-06-20 19:40:05,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 291 transitions, 3623 flow [2024-06-20 19:40:05,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 291 transitions, 3561 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-20 19:40:05,787 INFO L231 Difference]: Finished difference. Result has 279 places, 271 transitions, 3003 flow [2024-06-20 19:40:05,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2903, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3003, PETRI_PLACES=279, PETRI_TRANSITIONS=271} [2024-06-20 19:40:05,787 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 249 predicate places. [2024-06-20 19:40:05,787 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 271 transitions, 3003 flow [2024-06-20 19:40:05,787 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:40:05,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:05,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:05,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-20 19:40:05,788 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:40:05,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:05,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1078743729, now seen corresponding path program 6 times [2024-06-20 19:40:05,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:05,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177910362] [2024-06-20 19:40:05,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:05,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:40:12,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:12,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177910362] [2024-06-20 19:40:12,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177910362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:12,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:12,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:40:12,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876072414] [2024-06-20 19:40:12,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:12,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:40:12,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:12,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:40:12,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:40:12,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:40:12,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 271 transitions, 3003 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:40:12,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:12,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:40:12,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:12,880 INFO L124 PetriNetUnfolderBase]: 747/1327 cut-off events. [2024-06-20 19:40:12,880 INFO L125 PetriNetUnfolderBase]: For 78163/78163 co-relation queries the response was YES. [2024-06-20 19:40:12,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8256 conditions, 1327 events. 747/1327 cut-off events. For 78163/78163 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 7089 event pairs, 131 based on Foata normal form. 2/1329 useless extension candidates. Maximal degree in co-relation 8121. Up to 1234 conditions per place. [2024-06-20 19:40:12,893 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 270 selfloop transitions, 24 changer transitions 0/296 dead transitions. [2024-06-20 19:40:12,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 296 transitions, 3689 flow [2024-06-20 19:40:12,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:40:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:40:12,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2024-06-20 19:40:12,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3343108504398827 [2024-06-20 19:40:12,894 INFO L175 Difference]: Start difference. First operand has 279 places, 271 transitions, 3003 flow. Second operand 11 states and 114 transitions. [2024-06-20 19:40:12,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 296 transitions, 3689 flow [2024-06-20 19:40:13,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 296 transitions, 3615 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-20 19:40:13,161 INFO L231 Difference]: Finished difference. Result has 286 places, 275 transitions, 3035 flow [2024-06-20 19:40:13,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2931, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3035, PETRI_PLACES=286, PETRI_TRANSITIONS=275} [2024-06-20 19:40:13,162 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 256 predicate places. [2024-06-20 19:40:13,162 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 275 transitions, 3035 flow [2024-06-20 19:40:13,162 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:40:13,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:13,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:13,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-20 19:40:13,162 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:40:13,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:13,163 INFO L85 PathProgramCache]: Analyzing trace with hash 940604219, now seen corresponding path program 7 times [2024-06-20 19:40:13,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:13,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685918970] [2024-06-20 19:40:13,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:13,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:40:19,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:19,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685918970] [2024-06-20 19:40:19,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685918970] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:19,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:19,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:40:19,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030566035] [2024-06-20 19:40:19,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:19,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:40:19,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:19,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:40:19,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:40:19,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:40:19,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 275 transitions, 3035 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:40:19,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:19,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:40:19,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:19,748 INFO L124 PetriNetUnfolderBase]: 770/1372 cut-off events. [2024-06-20 19:40:19,748 INFO L125 PetriNetUnfolderBase]: For 87989/87989 co-relation queries the response was YES. [2024-06-20 19:40:19,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8635 conditions, 1372 events. 770/1372 cut-off events. For 87989/87989 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 7444 event pairs, 136 based on Foata normal form. 2/1374 useless extension candidates. Maximal degree in co-relation 8497. Up to 1235 conditions per place. [2024-06-20 19:40:19,762 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 267 selfloop transitions, 32 changer transitions 0/301 dead transitions. [2024-06-20 19:40:19,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 301 transitions, 3919 flow [2024-06-20 19:40:19,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:40:19,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:40:19,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-20 19:40:19,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3489736070381232 [2024-06-20 19:40:19,764 INFO L175 Difference]: Start difference. First operand has 286 places, 275 transitions, 3035 flow. Second operand 11 states and 119 transitions. [2024-06-20 19:40:19,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 301 transitions, 3919 flow [2024-06-20 19:40:20,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 301 transitions, 3855 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-20 19:40:20,069 INFO L231 Difference]: Finished difference. Result has 293 places, 279 transitions, 3102 flow [2024-06-20 19:40:20,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2971, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3102, PETRI_PLACES=293, PETRI_TRANSITIONS=279} [2024-06-20 19:40:20,069 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 263 predicate places. [2024-06-20 19:40:20,069 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 279 transitions, 3102 flow [2024-06-20 19:40:20,069 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:40:20,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:20,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:20,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-20 19:40:20,070 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:40:20,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:20,070 INFO L85 PathProgramCache]: Analyzing trace with hash 940719539, now seen corresponding path program 8 times [2024-06-20 19:40:20,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:20,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97892487] [2024-06-20 19:40:20,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:20,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:40:26,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:26,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97892487] [2024-06-20 19:40:26,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97892487] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:26,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:26,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:40:26,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063213579] [2024-06-20 19:40:26,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:26,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:40:26,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:26,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:40:26,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:40:26,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:40:26,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 279 transitions, 3102 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:40:26,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:26,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:40:26,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:27,178 INFO L124 PetriNetUnfolderBase]: 774/1380 cut-off events. [2024-06-20 19:40:27,178 INFO L125 PetriNetUnfolderBase]: For 90106/90106 co-relation queries the response was YES. [2024-06-20 19:40:27,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8733 conditions, 1380 events. 774/1380 cut-off events. For 90106/90106 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 7495 event pairs, 134 based on Foata normal form. 2/1382 useless extension candidates. Maximal degree in co-relation 8592. Up to 1263 conditions per place. [2024-06-20 19:40:27,193 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 267 selfloop transitions, 33 changer transitions 0/302 dead transitions. [2024-06-20 19:40:27,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 302 transitions, 3966 flow [2024-06-20 19:40:27,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:40:27,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:40:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-20 19:40:27,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3460410557184751 [2024-06-20 19:40:27,194 INFO L175 Difference]: Start difference. First operand has 293 places, 279 transitions, 3102 flow. Second operand 11 states and 118 transitions. [2024-06-20 19:40:27,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 302 transitions, 3966 flow [2024-06-20 19:40:27,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 302 transitions, 3886 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-20 19:40:27,522 INFO L231 Difference]: Finished difference. Result has 299 places, 281 transitions, 3126 flow [2024-06-20 19:40:27,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3028, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3126, PETRI_PLACES=299, PETRI_TRANSITIONS=281} [2024-06-20 19:40:27,523 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 269 predicate places. [2024-06-20 19:40:27,523 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 281 transitions, 3126 flow [2024-06-20 19:40:27,523 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:40:27,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:27,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:27,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-20 19:40:27,523 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:40:27,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:27,523 INFO L85 PathProgramCache]: Analyzing trace with hash 940724189, now seen corresponding path program 9 times [2024-06-20 19:40:27,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:27,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796515165] [2024-06-20 19:40:27,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:27,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:33,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:40:33,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:33,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796515165] [2024-06-20 19:40:33,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796515165] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:33,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:33,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:40:33,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774844142] [2024-06-20 19:40:33,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:33,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:40:33,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:33,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:40:33,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:40:33,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:40:33,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 281 transitions, 3126 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:40:33,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:33,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:40:33,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:34,353 INFO L124 PetriNetUnfolderBase]: 771/1375 cut-off events. [2024-06-20 19:40:34,353 INFO L125 PetriNetUnfolderBase]: For 83802/83802 co-relation queries the response was YES. [2024-06-20 19:40:34,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8530 conditions, 1375 events. 771/1375 cut-off events. For 83802/83802 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 7469 event pairs, 135 based on Foata normal form. 2/1377 useless extension candidates. Maximal degree in co-relation 8387. Up to 1277 conditions per place. [2024-06-20 19:40:34,368 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 266 selfloop transitions, 33 changer transitions 0/301 dead transitions. [2024-06-20 19:40:34,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 301 transitions, 3784 flow [2024-06-20 19:40:34,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:40:34,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:40:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-20 19:40:34,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-20 19:40:34,369 INFO L175 Difference]: Start difference. First operand has 299 places, 281 transitions, 3126 flow. Second operand 11 states and 116 transitions. [2024-06-20 19:40:34,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 301 transitions, 3784 flow [2024-06-20 19:40:34,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 301 transitions, 3702 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-20 19:40:34,662 INFO L231 Difference]: Finished difference. Result has 302 places, 281 transitions, 3115 flow [2024-06-20 19:40:34,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3044, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3115, PETRI_PLACES=302, PETRI_TRANSITIONS=281} [2024-06-20 19:40:34,662 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 272 predicate places. [2024-06-20 19:40:34,662 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 281 transitions, 3115 flow [2024-06-20 19:40:34,662 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:40:34,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:34,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:34,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-20 19:40:34,663 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:40:34,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:34,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1556092467, now seen corresponding path program 2 times [2024-06-20 19:40:34,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:34,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686827977] [2024-06-20 19:40:34,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:34,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:40,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:40:40,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:40,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686827977] [2024-06-20 19:40:40,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686827977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:40,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:40,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:40:40,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916891791] [2024-06-20 19:40:40,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:40,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:40:40,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:40,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:40:40,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:40:41,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:40:41,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 281 transitions, 3115 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:40:41,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:41,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:40:41,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:41,694 INFO L124 PetriNetUnfolderBase]: 768/1370 cut-off events. [2024-06-20 19:40:41,694 INFO L125 PetriNetUnfolderBase]: For 77138/77138 co-relation queries the response was YES. [2024-06-20 19:40:41,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8390 conditions, 1370 events. 768/1370 cut-off events. For 77138/77138 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 7444 event pairs, 135 based on Foata normal form. 1/1371 useless extension candidates. Maximal degree in co-relation 8246. Up to 1269 conditions per place. [2024-06-20 19:40:41,708 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 263 selfloop transitions, 36 changer transitions 0/301 dead transitions. [2024-06-20 19:40:41,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 301 transitions, 3775 flow [2024-06-20 19:40:41,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:40:41,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:40:41,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-20 19:40:41,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34310850439882695 [2024-06-20 19:40:41,710 INFO L175 Difference]: Start difference. First operand has 302 places, 281 transitions, 3115 flow. Second operand 11 states and 117 transitions. [2024-06-20 19:40:41,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 301 transitions, 3775 flow [2024-06-20 19:40:42,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 301 transitions, 3694 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-20 19:40:42,140 INFO L231 Difference]: Finished difference. Result has 304 places, 281 transitions, 3114 flow [2024-06-20 19:40:42,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3034, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3114, PETRI_PLACES=304, PETRI_TRANSITIONS=281} [2024-06-20 19:40:42,141 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 274 predicate places. [2024-06-20 19:40:42,141 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 281 transitions, 3114 flow [2024-06-20 19:40:42,141 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:40:42,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:42,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:42,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-20 19:40:42,142 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:40:42,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:42,142 INFO L85 PathProgramCache]: Analyzing trace with hash 298651885, now seen corresponding path program 10 times [2024-06-20 19:40:42,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:42,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252244940] [2024-06-20 19:40:42,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:42,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:40:48,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:48,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252244940] [2024-06-20 19:40:48,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252244940] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:48,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:48,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:40:48,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490251765] [2024-06-20 19:40:48,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:48,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:40:48,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:48,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:40:48,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:40:48,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:40:48,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 281 transitions, 3114 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:40:48,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:48,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:40:48,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:49,182 INFO L124 PetriNetUnfolderBase]: 772/1378 cut-off events. [2024-06-20 19:40:49,182 INFO L125 PetriNetUnfolderBase]: For 83295/83295 co-relation queries the response was YES. [2024-06-20 19:40:49,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8457 conditions, 1378 events. 772/1378 cut-off events. For 83295/83295 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 7516 event pairs, 121 based on Foata normal form. 2/1380 useless extension candidates. Maximal degree in co-relation 8313. Up to 1200 conditions per place. [2024-06-20 19:40:49,195 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 242 selfloop transitions, 60 changer transitions 0/304 dead transitions. [2024-06-20 19:40:49,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 304 transitions, 3827 flow [2024-06-20 19:40:49,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:40:49,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:40:49,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-20 19:40:49,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3460410557184751 [2024-06-20 19:40:49,196 INFO L175 Difference]: Start difference. First operand has 304 places, 281 transitions, 3114 flow. Second operand 11 states and 118 transitions. [2024-06-20 19:40:49,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 304 transitions, 3827 flow [2024-06-20 19:40:49,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 304 transitions, 3743 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-20 19:40:49,494 INFO L231 Difference]: Finished difference. Result has 307 places, 283 transitions, 3212 flow [2024-06-20 19:40:49,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3030, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3212, PETRI_PLACES=307, PETRI_TRANSITIONS=283} [2024-06-20 19:40:49,495 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 277 predicate places. [2024-06-20 19:40:49,495 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 283 transitions, 3212 flow [2024-06-20 19:40:49,495 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:40:49,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:49,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:49,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-20 19:40:49,496 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:40:49,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:49,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1662357349, now seen corresponding path program 1 times [2024-06-20 19:40:49,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:49,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390944625] [2024-06-20 19:40:49,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:49,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:56,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:40:56,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:56,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390944625] [2024-06-20 19:40:56,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390944625] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:56,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:56,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:40:56,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608280296] [2024-06-20 19:40:56,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:56,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:40:56,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:56,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:40:56,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:40:56,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:40:56,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 283 transitions, 3212 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:40:56,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:56,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:40:56,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:56,667 INFO L124 PetriNetUnfolderBase]: 776/1386 cut-off events. [2024-06-20 19:40:56,668 INFO L125 PetriNetUnfolderBase]: For 85447/85447 co-relation queries the response was YES. [2024-06-20 19:40:56,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8643 conditions, 1386 events. 776/1386 cut-off events. For 85447/85447 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 7577 event pairs, 192 based on Foata normal form. 2/1388 useless extension candidates. Maximal degree in co-relation 8497. Up to 1341 conditions per place. [2024-06-20 19:40:56,680 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 279 selfloop transitions, 22 changer transitions 0/303 dead transitions. [2024-06-20 19:40:56,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 303 transitions, 3922 flow [2024-06-20 19:40:56,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:40:56,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:40:56,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 115 transitions. [2024-06-20 19:40:56,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30913978494623656 [2024-06-20 19:40:56,682 INFO L175 Difference]: Start difference. First operand has 307 places, 283 transitions, 3212 flow. Second operand 12 states and 115 transitions. [2024-06-20 19:40:56,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 303 transitions, 3922 flow [2024-06-20 19:40:56,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 303 transitions, 3788 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-20 19:40:56,973 INFO L231 Difference]: Finished difference. Result has 315 places, 288 transitions, 3220 flow [2024-06-20 19:40:56,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3078, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3220, PETRI_PLACES=315, PETRI_TRANSITIONS=288} [2024-06-20 19:40:56,974 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 285 predicate places. [2024-06-20 19:40:56,974 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 288 transitions, 3220 flow [2024-06-20 19:40:56,974 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:40:56,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:56,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:56,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-20 19:40:56,974 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:40:56,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:56,974 INFO L85 PathProgramCache]: Analyzing trace with hash 121520365, now seen corresponding path program 11 times [2024-06-20 19:40:56,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:56,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857464428] [2024-06-20 19:40:56,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:56,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:03,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:41:03,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:03,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857464428] [2024-06-20 19:41:03,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857464428] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:03,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:03,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:41:03,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487566711] [2024-06-20 19:41:03,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:03,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:41:03,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:03,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:41:03,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:41:03,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:41:03,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 288 transitions, 3220 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:41:03,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:03,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:41:03,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:04,123 INFO L124 PetriNetUnfolderBase]: 780/1394 cut-off events. [2024-06-20 19:41:04,123 INFO L125 PetriNetUnfolderBase]: For 87140/87140 co-relation queries the response was YES. [2024-06-20 19:41:04,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8624 conditions, 1394 events. 780/1394 cut-off events. For 87140/87140 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 7626 event pairs, 133 based on Foata normal form. 2/1396 useless extension candidates. Maximal degree in co-relation 8473. Up to 1216 conditions per place. [2024-06-20 19:41:04,139 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 255 selfloop transitions, 51 changer transitions 0/308 dead transitions. [2024-06-20 19:41:04,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 308 transitions, 3909 flow [2024-06-20 19:41:04,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:41:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:41:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-20 19:41:04,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3519061583577713 [2024-06-20 19:41:04,140 INFO L175 Difference]: Start difference. First operand has 315 places, 288 transitions, 3220 flow. Second operand 11 states and 120 transitions. [2024-06-20 19:41:04,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 308 transitions, 3909 flow [2024-06-20 19:41:04,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 308 transitions, 3842 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-20 19:41:04,435 INFO L231 Difference]: Finished difference. Result has 320 places, 289 transitions, 3283 flow [2024-06-20 19:41:04,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3153, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3283, PETRI_PLACES=320, PETRI_TRANSITIONS=289} [2024-06-20 19:41:04,436 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 290 predicate places. [2024-06-20 19:41:04,436 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 289 transitions, 3283 flow [2024-06-20 19:41:04,436 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:41:04,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:04,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:04,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-20 19:41:04,436 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:41:04,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:04,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1541136973, now seen corresponding path program 12 times [2024-06-20 19:41:04,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:04,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39120931] [2024-06-20 19:41:04,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:04,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:10,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:41:10,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:10,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39120931] [2024-06-20 19:41:10,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39120931] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:10,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:10,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:41:10,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002181184] [2024-06-20 19:41:10,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:10,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:41:10,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:10,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:41:10,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:41:11,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:41:11,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 289 transitions, 3283 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:41:11,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:11,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:41:11,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:11,534 INFO L124 PetriNetUnfolderBase]: 788/1410 cut-off events. [2024-06-20 19:41:11,534 INFO L125 PetriNetUnfolderBase]: For 89122/89122 co-relation queries the response was YES. [2024-06-20 19:41:11,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8747 conditions, 1410 events. 788/1410 cut-off events. For 89122/89122 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 7774 event pairs, 131 based on Foata normal form. 2/1412 useless extension candidates. Maximal degree in co-relation 8596. Up to 1218 conditions per place. [2024-06-20 19:41:11,550 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 256 selfloop transitions, 52 changer transitions 0/310 dead transitions. [2024-06-20 19:41:11,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 310 transitions, 3979 flow [2024-06-20 19:41:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:41:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:41:11,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-20 19:41:11,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:41:11,551 INFO L175 Difference]: Start difference. First operand has 320 places, 289 transitions, 3283 flow. Second operand 11 states and 121 transitions. [2024-06-20 19:41:11,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 310 transitions, 3979 flow [2024-06-20 19:41:12,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 310 transitions, 3875 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-20 19:41:12,008 INFO L231 Difference]: Finished difference. Result has 326 places, 291 transitions, 3322 flow [2024-06-20 19:41:12,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3179, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3322, PETRI_PLACES=326, PETRI_TRANSITIONS=291} [2024-06-20 19:41:12,009 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 296 predicate places. [2024-06-20 19:41:12,009 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 291 transitions, 3322 flow [2024-06-20 19:41:12,009 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:41:12,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:12,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:12,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-20 19:41:12,009 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:41:12,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:12,009 INFO L85 PathProgramCache]: Analyzing trace with hash 292222795, now seen corresponding path program 13 times [2024-06-20 19:41:12,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:12,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490532494] [2024-06-20 19:41:12,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:12,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:41:18,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:18,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490532494] [2024-06-20 19:41:18,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490532494] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:18,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:18,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:41:18,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292266174] [2024-06-20 19:41:18,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:18,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:41:18,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:18,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:41:18,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:41:18,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 19:41:18,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 291 transitions, 3322 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:41:18,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:18,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 19:41:18,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:19,141 INFO L124 PetriNetUnfolderBase]: 792/1418 cut-off events. [2024-06-20 19:41:19,141 INFO L125 PetriNetUnfolderBase]: For 91062/91062 co-relation queries the response was YES. [2024-06-20 19:41:19,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8832 conditions, 1418 events. 792/1418 cut-off events. For 91062/91062 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 7851 event pairs, 110 based on Foata normal form. 2/1420 useless extension candidates. Maximal degree in co-relation 8679. Up to 1156 conditions per place. [2024-06-20 19:41:19,155 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 228 selfloop transitions, 78 changer transitions 0/308 dead transitions. [2024-06-20 19:41:19,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 308 transitions, 4004 flow [2024-06-20 19:41:19,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:41:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:41:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-20 19:41:19,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-20 19:41:19,157 INFO L175 Difference]: Start difference. First operand has 326 places, 291 transitions, 3322 flow. Second operand 10 states and 118 transitions. [2024-06-20 19:41:19,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 308 transitions, 4004 flow [2024-06-20 19:41:19,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 308 transitions, 3884 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-20 19:41:19,480 INFO L231 Difference]: Finished difference. Result has 328 places, 292 transitions, 3391 flow [2024-06-20 19:41:19,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3202, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3391, PETRI_PLACES=328, PETRI_TRANSITIONS=292} [2024-06-20 19:41:19,481 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 298 predicate places. [2024-06-20 19:41:19,481 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 292 transitions, 3391 flow [2024-06-20 19:41:19,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:41:19,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:19,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:19,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-20 19:41:19,481 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:41:19,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:19,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1370434543, now seen corresponding path program 14 times [2024-06-20 19:41:19,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:19,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194926335] [2024-06-20 19:41:19,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:19,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:41:26,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:26,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194926335] [2024-06-20 19:41:26,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194926335] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:26,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:26,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:41:26,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490379237] [2024-06-20 19:41:26,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:26,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:41:26,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:26,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:41:26,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:41:26,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:41:26,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 292 transitions, 3391 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:41:26,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:26,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:41:26,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:27,073 INFO L124 PetriNetUnfolderBase]: 804/1442 cut-off events. [2024-06-20 19:41:27,073 INFO L125 PetriNetUnfolderBase]: For 93311/93311 co-relation queries the response was YES. [2024-06-20 19:41:27,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9053 conditions, 1442 events. 804/1442 cut-off events. For 93311/93311 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 8014 event pairs, 127 based on Foata normal form. 2/1444 useless extension candidates. Maximal degree in co-relation 8899. Up to 1244 conditions per place. [2024-06-20 19:41:27,089 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 255 selfloop transitions, 57 changer transitions 0/314 dead transitions. [2024-06-20 19:41:27,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 314 transitions, 4128 flow [2024-06-20 19:41:27,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:41:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:41:27,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-20 19:41:27,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3489736070381232 [2024-06-20 19:41:27,090 INFO L175 Difference]: Start difference. First operand has 328 places, 292 transitions, 3391 flow. Second operand 11 states and 119 transitions. [2024-06-20 19:41:27,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 314 transitions, 4128 flow [2024-06-20 19:41:27,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 314 transitions, 3926 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-06-20 19:41:27,376 INFO L231 Difference]: Finished difference. Result has 332 places, 295 transitions, 3379 flow [2024-06-20 19:41:27,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3214, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3379, PETRI_PLACES=332, PETRI_TRANSITIONS=295} [2024-06-20 19:41:27,376 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 302 predicate places. [2024-06-20 19:41:27,376 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 295 transitions, 3379 flow [2024-06-20 19:41:27,376 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:41:27,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:27,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:27,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-20 19:41:27,377 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:41:27,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:27,377 INFO L85 PathProgramCache]: Analyzing trace with hash 121400395, now seen corresponding path program 15 times [2024-06-20 19:41:27,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:27,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132158304] [2024-06-20 19:41:27,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:27,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:41:33,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:33,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132158304] [2024-06-20 19:41:33,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132158304] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:33,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:33,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:41:33,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702080873] [2024-06-20 19:41:33,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:33,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:41:33,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:33,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:41:33,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:41:33,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:41:33,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 295 transitions, 3379 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:41:33,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:33,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:41:33,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:33,957 INFO L124 PetriNetUnfolderBase]: 816/1466 cut-off events. [2024-06-20 19:41:33,958 INFO L125 PetriNetUnfolderBase]: For 94875/94875 co-relation queries the response was YES. [2024-06-20 19:41:33,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9065 conditions, 1466 events. 816/1466 cut-off events. For 94875/94875 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 8220 event pairs, 141 based on Foata normal form. 2/1468 useless extension candidates. Maximal degree in co-relation 8909. Up to 1226 conditions per place. [2024-06-20 19:41:33,971 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 259 selfloop transitions, 56 changer transitions 0/317 dead transitions. [2024-06-20 19:41:33,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 317 transitions, 4097 flow [2024-06-20 19:41:33,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:41:33,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:41:33,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-20 19:41:33,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3519061583577713 [2024-06-20 19:41:33,972 INFO L175 Difference]: Start difference. First operand has 332 places, 295 transitions, 3379 flow. Second operand 11 states and 120 transitions. [2024-06-20 19:41:33,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 317 transitions, 4097 flow [2024-06-20 19:41:34,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 317 transitions, 3972 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-20 19:41:34,322 INFO L231 Difference]: Finished difference. Result has 338 places, 298 transitions, 3427 flow [2024-06-20 19:41:34,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3254, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3427, PETRI_PLACES=338, PETRI_TRANSITIONS=298} [2024-06-20 19:41:34,323 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 308 predicate places. [2024-06-20 19:41:34,323 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 298 transitions, 3427 flow [2024-06-20 19:41:34,323 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:41:34,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:34,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:34,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-20 19:41:34,324 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:41:34,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:34,324 INFO L85 PathProgramCache]: Analyzing trace with hash -263857333, now seen corresponding path program 16 times [2024-06-20 19:41:34,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:34,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190854875] [2024-06-20 19:41:34,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:34,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:40,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:41:40,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:40,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190854875] [2024-06-20 19:41:40,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190854875] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:40,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:40,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:41:40,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076530990] [2024-06-20 19:41:40,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:40,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:41:40,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:40,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:41:40,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:41:40,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:41:40,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 298 transitions, 3427 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:41:40,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:40,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:41:40,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:41,485 INFO L124 PetriNetUnfolderBase]: 820/1474 cut-off events. [2024-06-20 19:41:41,485 INFO L125 PetriNetUnfolderBase]: For 97166/97166 co-relation queries the response was YES. [2024-06-20 19:41:41,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9169 conditions, 1474 events. 820/1474 cut-off events. For 97166/97166 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 8277 event pairs, 148 based on Foata normal form. 2/1476 useless extension candidates. Maximal degree in co-relation 9010. Up to 1274 conditions per place. [2024-06-20 19:41:41,502 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 278 selfloop transitions, 36 changer transitions 0/316 dead transitions. [2024-06-20 19:41:41,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 316 transitions, 4127 flow [2024-06-20 19:41:41,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:41:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:41:41,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2024-06-20 19:41:41,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3258064516129032 [2024-06-20 19:41:41,505 INFO L175 Difference]: Start difference. First operand has 338 places, 298 transitions, 3427 flow. Second operand 10 states and 101 transitions. [2024-06-20 19:41:41,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 316 transitions, 4127 flow [2024-06-20 19:41:41,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 316 transitions, 4003 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-20 19:41:41,971 INFO L231 Difference]: Finished difference. Result has 341 places, 299 transitions, 3419 flow [2024-06-20 19:41:41,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3303, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3419, PETRI_PLACES=341, PETRI_TRANSITIONS=299} [2024-06-20 19:41:41,971 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 311 predicate places. [2024-06-20 19:41:41,972 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 299 transitions, 3419 flow [2024-06-20 19:41:41,972 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:41:41,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:41,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:41,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-20 19:41:41,972 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:41:41,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:41,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1964059053, now seen corresponding path program 17 times [2024-06-20 19:41:41,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:41,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91332605] [2024-06-20 19:41:41,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:41,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:48,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:41:48,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:48,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91332605] [2024-06-20 19:41:48,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91332605] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:48,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:48,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:41:48,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133433999] [2024-06-20 19:41:48,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:48,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:41:48,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:48,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:41:48,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:41:48,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:41:48,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 299 transitions, 3419 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:41:48,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:48,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:41:48,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:49,084 INFO L124 PetriNetUnfolderBase]: 831/1495 cut-off events. [2024-06-20 19:41:49,084 INFO L125 PetriNetUnfolderBase]: For 109387/109387 co-relation queries the response was YES. [2024-06-20 19:41:49,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9544 conditions, 1495 events. 831/1495 cut-off events. For 109387/109387 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 8451 event pairs, 160 based on Foata normal form. 2/1497 useless extension candidates. Maximal degree in co-relation 9384. Up to 1200 conditions per place. [2024-06-20 19:41:49,098 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 259 selfloop transitions, 58 changer transitions 0/319 dead transitions. [2024-06-20 19:41:49,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 319 transitions, 4365 flow [2024-06-20 19:41:49,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:41:49,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:41:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-20 19:41:49,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34838709677419355 [2024-06-20 19:41:49,099 INFO L175 Difference]: Start difference. First operand has 341 places, 299 transitions, 3419 flow. Second operand 10 states and 108 transitions. [2024-06-20 19:41:49,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 319 transitions, 4365 flow [2024-06-20 19:41:49,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 319 transitions, 4247 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-06-20 19:41:49,504 INFO L231 Difference]: Finished difference. Result has 343 places, 301 transitions, 3501 flow [2024-06-20 19:41:49,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3319, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3501, PETRI_PLACES=343, PETRI_TRANSITIONS=301} [2024-06-20 19:41:49,504 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 313 predicate places. [2024-06-20 19:41:49,505 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 301 transitions, 3501 flow [2024-06-20 19:41:49,505 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:41:49,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:49,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:49,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-20 19:41:49,505 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:41:49,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:49,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1946249349, now seen corresponding path program 18 times [2024-06-20 19:41:49,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:49,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684194998] [2024-06-20 19:41:49,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:49,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:41:55,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:55,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684194998] [2024-06-20 19:41:55,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684194998] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:55,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:55,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:41:55,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824912403] [2024-06-20 19:41:55,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:55,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:41:55,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:55,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:41:55,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:41:55,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:41:55,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 301 transitions, 3501 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:41:55,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:55,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:41:55,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:56,115 INFO L124 PetriNetUnfolderBase]: 835/1503 cut-off events. [2024-06-20 19:41:56,115 INFO L125 PetriNetUnfolderBase]: For 105141/105141 co-relation queries the response was YES. [2024-06-20 19:41:56,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9565 conditions, 1503 events. 835/1503 cut-off events. For 105141/105141 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 8532 event pairs, 170 based on Foata normal form. 2/1505 useless extension candidates. Maximal degree in co-relation 9404. Up to 1327 conditions per place. [2024-06-20 19:41:56,132 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 258 selfloop transitions, 59 changer transitions 0/319 dead transitions. [2024-06-20 19:41:56,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 319 transitions, 4211 flow [2024-06-20 19:41:56,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:41:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:41:56,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-20 19:41:56,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-20 19:41:56,133 INFO L175 Difference]: Start difference. First operand has 343 places, 301 transitions, 3501 flow. Second operand 10 states and 105 transitions. [2024-06-20 19:41:56,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 319 transitions, 4211 flow [2024-06-20 19:41:56,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 319 transitions, 4107 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-20 19:41:56,519 INFO L231 Difference]: Finished difference. Result has 345 places, 302 transitions, 3558 flow [2024-06-20 19:41:56,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3401, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3558, PETRI_PLACES=345, PETRI_TRANSITIONS=302} [2024-06-20 19:41:56,519 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 315 predicate places. [2024-06-20 19:41:56,520 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 302 transitions, 3558 flow [2024-06-20 19:41:56,520 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:41:56,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:56,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:56,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-20 19:41:56,520 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:41:56,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:56,521 INFO L85 PathProgramCache]: Analyzing trace with hash 304412593, now seen corresponding path program 3 times [2024-06-20 19:41:56,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:56,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323747940] [2024-06-20 19:41:56,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:56,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:02,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:42:02,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:02,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323747940] [2024-06-20 19:42:02,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323747940] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:02,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:02,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:42:02,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131497014] [2024-06-20 19:42:02,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:02,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:42:02,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:02,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:42:02,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:42:03,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:42:03,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 302 transitions, 3558 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:42:03,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:03,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:42:03,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:03,673 INFO L124 PetriNetUnfolderBase]: 832/1498 cut-off events. [2024-06-20 19:42:03,673 INFO L125 PetriNetUnfolderBase]: For 93130/93130 co-relation queries the response was YES. [2024-06-20 19:42:03,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9452 conditions, 1498 events. 832/1498 cut-off events. For 93130/93130 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 8485 event pairs, 169 based on Foata normal form. 1/1499 useless extension candidates. Maximal degree in co-relation 9291. Up to 1313 conditions per place. [2024-06-20 19:42:03,691 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 249 selfloop transitions, 68 changer transitions 0/319 dead transitions. [2024-06-20 19:42:03,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 319 transitions, 4240 flow [2024-06-20 19:42:03,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:42:03,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:42:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-20 19:42:03,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-20 19:42:03,692 INFO L175 Difference]: Start difference. First operand has 345 places, 302 transitions, 3558 flow. Second operand 10 states and 106 transitions. [2024-06-20 19:42:03,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 319 transitions, 4240 flow [2024-06-20 19:42:04,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 319 transitions, 4091 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-06-20 19:42:04,055 INFO L231 Difference]: Finished difference. Result has 345 places, 302 transitions, 3565 flow [2024-06-20 19:42:04,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3409, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3565, PETRI_PLACES=345, PETRI_TRANSITIONS=302} [2024-06-20 19:42:04,056 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 315 predicate places. [2024-06-20 19:42:04,056 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 302 transitions, 3565 flow [2024-06-20 19:42:04,056 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:42:04,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:04,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:04,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-20 19:42:04,057 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:42:04,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:04,057 INFO L85 PathProgramCache]: Analyzing trace with hash 645830387, now seen corresponding path program 19 times [2024-06-20 19:42:04,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:04,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130951863] [2024-06-20 19:42:04,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:04,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:09,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:42:09,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:09,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130951863] [2024-06-20 19:42:09,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130951863] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:09,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:09,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:42:09,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461081002] [2024-06-20 19:42:09,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:09,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:42:09,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:09,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:42:09,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:42:09,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:42:09,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 302 transitions, 3565 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:42:09,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:09,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:42:09,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:10,489 INFO L124 PetriNetUnfolderBase]: 829/1493 cut-off events. [2024-06-20 19:42:10,489 INFO L125 PetriNetUnfolderBase]: For 86555/86555 co-relation queries the response was YES. [2024-06-20 19:42:10,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9209 conditions, 1493 events. 829/1493 cut-off events. For 86555/86555 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 8442 event pairs, 160 based on Foata normal form. 2/1495 useless extension candidates. Maximal degree in co-relation 9049. Up to 1269 conditions per place. [2024-06-20 19:42:10,506 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 258 selfloop transitions, 59 changer transitions 0/319 dead transitions. [2024-06-20 19:42:10,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 319 transitions, 4243 flow [2024-06-20 19:42:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:42:10,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:42:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-20 19:42:10,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-20 19:42:10,507 INFO L175 Difference]: Start difference. First operand has 345 places, 302 transitions, 3565 flow. Second operand 10 states and 106 transitions. [2024-06-20 19:42:10,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 319 transitions, 4243 flow [2024-06-20 19:42:10,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 319 transitions, 3889 flow, removed 16 selfloop flow, removed 14 redundant places. [2024-06-20 19:42:10,898 INFO L231 Difference]: Finished difference. Result has 341 places, 302 transitions, 3337 flow [2024-06-20 19:42:10,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3211, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3337, PETRI_PLACES=341, PETRI_TRANSITIONS=302} [2024-06-20 19:42:10,899 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 311 predicate places. [2024-06-20 19:42:10,899 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 302 transitions, 3337 flow [2024-06-20 19:42:10,899 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:42:10,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:10,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:10,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-20 19:42:10,899 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:42:10,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:10,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1836021475, now seen corresponding path program 20 times [2024-06-20 19:42:10,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:10,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395740828] [2024-06-20 19:42:10,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:10,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:17,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:42:17,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:17,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395740828] [2024-06-20 19:42:17,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395740828] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:17,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:17,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:42:17,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408550578] [2024-06-20 19:42:17,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:17,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:42:17,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:17,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:42:17,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:42:17,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:42:17,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 302 transitions, 3337 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:42:17,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:17,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:42:17,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:18,533 INFO L124 PetriNetUnfolderBase]: 833/1501 cut-off events. [2024-06-20 19:42:18,534 INFO L125 PetriNetUnfolderBase]: For 84283/84283 co-relation queries the response was YES. [2024-06-20 19:42:18,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8998 conditions, 1501 events. 833/1501 cut-off events. For 84283/84283 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 8498 event pairs, 138 based on Foata normal form. 2/1503 useless extension candidates. Maximal degree in co-relation 8839. Up to 1235 conditions per place. [2024-06-20 19:42:18,551 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 244 selfloop transitions, 73 changer transitions 0/319 dead transitions. [2024-06-20 19:42:18,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 319 transitions, 4041 flow [2024-06-20 19:42:18,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:42:18,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:42:18,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-20 19:42:18,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35161290322580646 [2024-06-20 19:42:18,553 INFO L175 Difference]: Start difference. First operand has 341 places, 302 transitions, 3337 flow. Second operand 10 states and 109 transitions. [2024-06-20 19:42:18,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 319 transitions, 4041 flow [2024-06-20 19:42:18,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 319 transitions, 3892 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-20 19:42:18,897 INFO L231 Difference]: Finished difference. Result has 340 places, 303 transitions, 3368 flow [2024-06-20 19:42:18,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3188, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3368, PETRI_PLACES=340, PETRI_TRANSITIONS=303} [2024-06-20 19:42:18,897 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 310 predicate places. [2024-06-20 19:42:18,897 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 303 transitions, 3368 flow [2024-06-20 19:42:18,897 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:42:18,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:18,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:18,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-20 19:42:18,898 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:42:18,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:18,899 INFO L85 PathProgramCache]: Analyzing trace with hash -150832949, now seen corresponding path program 21 times [2024-06-20 19:42:18,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:18,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8133249] [2024-06-20 19:42:18,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:18,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:24,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:42:24,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:24,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8133249] [2024-06-20 19:42:24,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8133249] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:24,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:24,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:42:24,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086506140] [2024-06-20 19:42:24,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:24,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:42:24,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:24,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:42:24,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:42:24,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:42:24,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 303 transitions, 3368 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:42:24,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:24,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:42:24,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:25,475 INFO L124 PetriNetUnfolderBase]: 837/1509 cut-off events. [2024-06-20 19:42:25,475 INFO L125 PetriNetUnfolderBase]: For 82963/82963 co-relation queries the response was YES. [2024-06-20 19:42:25,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9053 conditions, 1509 events. 837/1509 cut-off events. For 82963/82963 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 8583 event pairs, 134 based on Foata normal form. 2/1511 useless extension candidates. Maximal degree in co-relation 8895. Up to 1215 conditions per place. [2024-06-20 19:42:25,492 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 243 selfloop transitions, 75 changer transitions 0/320 dead transitions. [2024-06-20 19:42:25,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 320 transitions, 4074 flow [2024-06-20 19:42:25,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:42:25,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:42:25,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-20 19:42:25,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:42:25,493 INFO L175 Difference]: Start difference. First operand has 340 places, 303 transitions, 3368 flow. Second operand 10 states and 110 transitions. [2024-06-20 19:42:25,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 320 transitions, 4074 flow [2024-06-20 19:42:25,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 320 transitions, 3904 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-20 19:42:25,779 INFO L231 Difference]: Finished difference. Result has 342 places, 304 transitions, 3384 flow [2024-06-20 19:42:25,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3200, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3384, PETRI_PLACES=342, PETRI_TRANSITIONS=304} [2024-06-20 19:42:25,779 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 312 predicate places. [2024-06-20 19:42:25,780 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 304 transitions, 3384 flow [2024-06-20 19:42:25,780 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:42:25,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:25,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:25,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-20 19:42:25,780 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:42:25,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:25,780 INFO L85 PathProgramCache]: Analyzing trace with hash 26303221, now seen corresponding path program 22 times [2024-06-20 19:42:25,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:25,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630315914] [2024-06-20 19:42:25,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:25,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:32,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:42:32,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:32,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630315914] [2024-06-20 19:42:32,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630315914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:32,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:32,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:42:32,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858965842] [2024-06-20 19:42:32,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:32,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:42:32,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:32,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:42:32,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:42:32,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:42:32,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 304 transitions, 3384 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:42:32,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:32,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:42:32,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:32,972 INFO L124 PetriNetUnfolderBase]: 841/1517 cut-off events. [2024-06-20 19:42:32,972 INFO L125 PetriNetUnfolderBase]: For 83075/83075 co-relation queries the response was YES. [2024-06-20 19:42:32,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9094 conditions, 1517 events. 841/1517 cut-off events. For 83075/83075 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 8643 event pairs, 124 based on Foata normal form. 2/1519 useless extension candidates. Maximal degree in co-relation 8935. Up to 1251 conditions per place. [2024-06-20 19:42:32,989 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 232 selfloop transitions, 87 changer transitions 0/321 dead transitions. [2024-06-20 19:42:32,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 321 transitions, 4094 flow [2024-06-20 19:42:32,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:42:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:42:32,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-20 19:42:32,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-20 19:42:32,991 INFO L175 Difference]: Start difference. First operand has 342 places, 304 transitions, 3384 flow. Second operand 10 states and 107 transitions. [2024-06-20 19:42:32,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 321 transitions, 4094 flow [2024-06-20 19:42:33,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 321 transitions, 3920 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-20 19:42:33,267 INFO L231 Difference]: Finished difference. Result has 344 places, 305 transitions, 3420 flow [2024-06-20 19:42:33,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3212, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3420, PETRI_PLACES=344, PETRI_TRANSITIONS=305} [2024-06-20 19:42:33,267 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 314 predicate places. [2024-06-20 19:42:33,268 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 305 transitions, 3420 flow [2024-06-20 19:42:33,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:42:33,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:33,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:42:33,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-20 19:42:33,268 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:42:33,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:33,269 INFO L85 PathProgramCache]: Analyzing trace with hash 612204891, now seen corresponding path program 2 times [2024-06-20 19:42:33,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:33,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832889710] [2024-06-20 19:42:33,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:33,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:40,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:42:40,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:40,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832889710] [2024-06-20 19:42:40,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832889710] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:40,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:40,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:42:40,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614309174] [2024-06-20 19:42:40,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:40,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:42:40,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:40,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:42:40,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:42:40,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:42:40,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 305 transitions, 3420 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:42:40,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:40,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:42:40,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:40,934 INFO L124 PetriNetUnfolderBase]: 861/1561 cut-off events. [2024-06-20 19:42:40,935 INFO L125 PetriNetUnfolderBase]: For 126207/126207 co-relation queries the response was YES. [2024-06-20 19:42:40,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9295 conditions, 1561 events. 861/1561 cut-off events. For 126207/126207 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 8946 event pairs, 134 based on Foata normal form. 12/1573 useless extension candidates. Maximal degree in co-relation 9135. Up to 1084 conditions per place. [2024-06-20 19:42:40,954 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 199 selfloop transitions, 105 changer transitions 22/328 dead transitions. [2024-06-20 19:42:40,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 328 transitions, 4186 flow [2024-06-20 19:42:40,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:42:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:42:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2024-06-20 19:42:40,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35777126099706746 [2024-06-20 19:42:40,956 INFO L175 Difference]: Start difference. First operand has 344 places, 305 transitions, 3420 flow. Second operand 11 states and 122 transitions. [2024-06-20 19:42:40,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 328 transitions, 4186 flow [2024-06-20 19:42:41,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 328 transitions, 3990 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-20 19:42:41,247 INFO L231 Difference]: Finished difference. Result has 347 places, 289 transitions, 3286 flow [2024-06-20 19:42:41,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3224, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3286, PETRI_PLACES=347, PETRI_TRANSITIONS=289} [2024-06-20 19:42:41,247 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 317 predicate places. [2024-06-20 19:42:41,247 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 289 transitions, 3286 flow [2024-06-20 19:42:41,247 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:42:41,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:41,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:41,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-20 19:42:41,248 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:42:41,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:41,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1836141445, now seen corresponding path program 23 times [2024-06-20 19:42:41,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:41,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041851168] [2024-06-20 19:42:41,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:41,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:42:48,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:48,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041851168] [2024-06-20 19:42:48,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041851168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:48,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:48,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:42:48,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038032686] [2024-06-20 19:42:48,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:48,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:42:48,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:48,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:42:48,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:42:48,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:42:48,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 289 transitions, 3286 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:42:48,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:48,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:42:48,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:48,831 INFO L124 PetriNetUnfolderBase]: 794/1476 cut-off events. [2024-06-20 19:42:48,832 INFO L125 PetriNetUnfolderBase]: For 91711/91711 co-relation queries the response was YES. [2024-06-20 19:42:48,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9058 conditions, 1476 events. 794/1476 cut-off events. For 91711/91711 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 8679 event pairs, 149 based on Foata normal form. 2/1478 useless extension candidates. Maximal degree in co-relation 8897. Up to 1083 conditions per place. [2024-06-20 19:42:48,849 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 223 selfloop transitions, 83 changer transitions 0/308 dead transitions. [2024-06-20 19:42:48,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 308 transitions, 4180 flow [2024-06-20 19:42:48,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:42:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:42:48,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-20 19:42:48,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:42:48,850 INFO L175 Difference]: Start difference. First operand has 347 places, 289 transitions, 3286 flow. Second operand 10 states and 110 transitions. [2024-06-20 19:42:48,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 308 transitions, 4180 flow [2024-06-20 19:42:49,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 308 transitions, 3936 flow, removed 16 selfloop flow, removed 11 redundant places. [2024-06-20 19:42:49,182 INFO L231 Difference]: Finished difference. Result has 346 places, 291 transitions, 3270 flow [2024-06-20 19:42:49,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3044, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3270, PETRI_PLACES=346, PETRI_TRANSITIONS=291} [2024-06-20 19:42:49,182 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 316 predicate places. [2024-06-20 19:42:49,183 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 291 transitions, 3270 flow [2024-06-20 19:42:49,183 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:42:49,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:49,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:49,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-20 19:42:49,183 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:42:49,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:49,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2006746325, now seen corresponding path program 24 times [2024-06-20 19:42:49,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:49,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602960655] [2024-06-20 19:42:49,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:49,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:55,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:42:55,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:55,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602960655] [2024-06-20 19:42:55,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602960655] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:55,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:55,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:42:55,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635284473] [2024-06-20 19:42:55,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:55,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:42:55,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:55,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:42:55,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:42:55,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:42:55,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 291 transitions, 3270 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:42:55,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:55,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:42:55,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:56,340 INFO L124 PetriNetUnfolderBase]: 791/1471 cut-off events. [2024-06-20 19:42:56,340 INFO L125 PetriNetUnfolderBase]: For 83055/83055 co-relation queries the response was YES. [2024-06-20 19:42:56,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8750 conditions, 1471 events. 791/1471 cut-off events. For 83055/83055 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 8650 event pairs, 132 based on Foata normal form. 2/1473 useless extension candidates. Maximal degree in co-relation 8589. Up to 1165 conditions per place. [2024-06-20 19:42:56,358 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 222 selfloop transitions, 83 changer transitions 0/307 dead transitions. [2024-06-20 19:42:56,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 307 transitions, 3922 flow [2024-06-20 19:42:56,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:42:56,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:42:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-20 19:42:56,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34838709677419355 [2024-06-20 19:42:56,359 INFO L175 Difference]: Start difference. First operand has 346 places, 291 transitions, 3270 flow. Second operand 10 states and 108 transitions. [2024-06-20 19:42:56,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 307 transitions, 3922 flow [2024-06-20 19:42:56,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 307 transitions, 3798 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-20 19:42:56,660 INFO L231 Difference]: Finished difference. Result has 350 places, 291 transitions, 3318 flow [2024-06-20 19:42:56,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3146, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3318, PETRI_PLACES=350, PETRI_TRANSITIONS=291} [2024-06-20 19:42:56,660 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 320 predicate places. [2024-06-20 19:42:56,660 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 291 transitions, 3318 flow [2024-06-20 19:42:56,660 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:42:56,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:56,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:56,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-20 19:42:56,660 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:42:56,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:56,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1567977877, now seen corresponding path program 25 times [2024-06-20 19:42:56,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:56,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921172265] [2024-06-20 19:42:56,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:56,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:43:03,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:03,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921172265] [2024-06-20 19:43:03,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921172265] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:03,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:03,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:43:03,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840136205] [2024-06-20 19:43:03,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:03,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:43:03,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:03,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:43:03,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:43:03,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:43:03,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 291 transitions, 3318 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:43:03,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:03,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:43:03,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:04,211 INFO L124 PetriNetUnfolderBase]: 795/1479 cut-off events. [2024-06-20 19:43:04,212 INFO L125 PetriNetUnfolderBase]: For 84561/84561 co-relation queries the response was YES. [2024-06-20 19:43:04,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8941 conditions, 1479 events. 795/1479 cut-off events. For 84561/84561 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 8681 event pairs, 145 based on Foata normal form. 2/1481 useless extension candidates. Maximal degree in co-relation 8778. Up to 1124 conditions per place. [2024-06-20 19:43:04,228 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 213 selfloop transitions, 91 changer transitions 0/306 dead transitions. [2024-06-20 19:43:04,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 306 transitions, 3992 flow [2024-06-20 19:43:04,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:43:04,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:43:04,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-20 19:43:04,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 19:43:04,229 INFO L175 Difference]: Start difference. First operand has 350 places, 291 transitions, 3318 flow. Second operand 10 states and 110 transitions. [2024-06-20 19:43:04,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 306 transitions, 3992 flow [2024-06-20 19:43:04,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 306 transitions, 3798 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-20 19:43:04,564 INFO L231 Difference]: Finished difference. Result has 351 places, 292 transitions, 3340 flow [2024-06-20 19:43:04,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3124, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3340, PETRI_PLACES=351, PETRI_TRANSITIONS=292} [2024-06-20 19:43:04,565 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 321 predicate places. [2024-06-20 19:43:04,565 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 292 transitions, 3340 flow [2024-06-20 19:43:04,565 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:43:04,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:04,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:04,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-20 19:43:04,565 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:43:04,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:04,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2105322021, now seen corresponding path program 26 times [2024-06-20 19:43:04,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:04,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89633079] [2024-06-20 19:43:04,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:04,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:10,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:43:10,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:10,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89633079] [2024-06-20 19:43:10,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89633079] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:10,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:10,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:43:10,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18593008] [2024-06-20 19:43:10,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:10,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:43:10,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:10,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:43:10,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:43:10,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:43:10,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 292 transitions, 3340 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:43:10,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:10,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:43:10,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:11,210 INFO L124 PetriNetUnfolderBase]: 799/1487 cut-off events. [2024-06-20 19:43:11,210 INFO L125 PetriNetUnfolderBase]: For 86491/86491 co-relation queries the response was YES. [2024-06-20 19:43:11,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9015 conditions, 1487 events. 799/1487 cut-off events. For 86491/86491 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 8735 event pairs, 145 based on Foata normal form. 2/1489 useless extension candidates. Maximal degree in co-relation 8851. Up to 1118 conditions per place. [2024-06-20 19:43:11,227 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 213 selfloop transitions, 92 changer transitions 0/307 dead transitions. [2024-06-20 19:43:11,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 307 transitions, 4016 flow [2024-06-20 19:43:11,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:43:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:43:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-20 19:43:11,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3580645161290323 [2024-06-20 19:43:11,228 INFO L175 Difference]: Start difference. First operand has 351 places, 292 transitions, 3340 flow. Second operand 10 states and 111 transitions. [2024-06-20 19:43:11,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 307 transitions, 4016 flow [2024-06-20 19:43:11,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 307 transitions, 3810 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-20 19:43:11,576 INFO L231 Difference]: Finished difference. Result has 353 places, 293 transitions, 3354 flow [2024-06-20 19:43:11,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3134, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3354, PETRI_PLACES=353, PETRI_TRANSITIONS=293} [2024-06-20 19:43:11,577 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 323 predicate places. [2024-06-20 19:43:11,577 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 293 transitions, 3354 flow [2024-06-20 19:43:11,577 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:43:11,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:11,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:11,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-20 19:43:11,578 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:43:11,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:11,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1568097847, now seen corresponding path program 27 times [2024-06-20 19:43:11,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:11,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123036118] [2024-06-20 19:43:11,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:11,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:18,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:43:18,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:18,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123036118] [2024-06-20 19:43:18,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123036118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:18,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:18,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:43:18,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308212701] [2024-06-20 19:43:18,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:18,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:43:18,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:18,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:43:18,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:43:18,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:43:18,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 293 transitions, 3354 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:43:18,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:18,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:43:18,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:18,860 INFO L124 PetriNetUnfolderBase]: 803/1495 cut-off events. [2024-06-20 19:43:18,860 INFO L125 PetriNetUnfolderBase]: For 88469/88469 co-relation queries the response was YES. [2024-06-20 19:43:18,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9072 conditions, 1495 events. 803/1495 cut-off events. For 88469/88469 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 8830 event pairs, 147 based on Foata normal form. 2/1497 useless extension candidates. Maximal degree in co-relation 8907. Up to 1067 conditions per place. [2024-06-20 19:43:18,874 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 213 selfloop transitions, 94 changer transitions 0/309 dead transitions. [2024-06-20 19:43:18,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 309 transitions, 4230 flow [2024-06-20 19:43:18,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:43:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:43:18,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-20 19:43:18,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3580645161290323 [2024-06-20 19:43:18,875 INFO L175 Difference]: Start difference. First operand has 353 places, 293 transitions, 3354 flow. Second operand 10 states and 111 transitions. [2024-06-20 19:43:18,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 309 transitions, 4230 flow [2024-06-20 19:43:19,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 309 transitions, 4020 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-20 19:43:19,223 INFO L231 Difference]: Finished difference. Result has 355 places, 294 transitions, 3368 flow [2024-06-20 19:43:19,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3144, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3368, PETRI_PLACES=355, PETRI_TRANSITIONS=294} [2024-06-20 19:43:19,224 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 325 predicate places. [2024-06-20 19:43:19,224 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 294 transitions, 3368 flow [2024-06-20 19:43:19,224 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:43:19,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:19,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:19,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-20 19:43:19,224 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:43:19,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:19,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1390846357, now seen corresponding path program 28 times [2024-06-20 19:43:19,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:19,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935007083] [2024-06-20 19:43:19,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:19,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:25,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:43:25,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:25,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935007083] [2024-06-20 19:43:25,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935007083] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:25,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:25,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:43:25,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484513561] [2024-06-20 19:43:25,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:25,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:43:25,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:25,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:43:25,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:43:25,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:43:25,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 294 transitions, 3368 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:43:25,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:25,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:43:25,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:26,263 INFO L124 PetriNetUnfolderBase]: 807/1503 cut-off events. [2024-06-20 19:43:26,263 INFO L125 PetriNetUnfolderBase]: For 90467/90467 co-relation queries the response was YES. [2024-06-20 19:43:26,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9131 conditions, 1503 events. 807/1503 cut-off events. For 90467/90467 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 8899 event pairs, 145 based on Foata normal form. 2/1505 useless extension candidates. Maximal degree in co-relation 8965. Up to 1148 conditions per place. [2024-06-20 19:43:26,281 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 219 selfloop transitions, 89 changer transitions 0/310 dead transitions. [2024-06-20 19:43:26,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 310 transitions, 4060 flow [2024-06-20 19:43:26,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:43:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:43:26,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-20 19:43:26,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36129032258064514 [2024-06-20 19:43:26,283 INFO L175 Difference]: Start difference. First operand has 355 places, 294 transitions, 3368 flow. Second operand 10 states and 112 transitions. [2024-06-20 19:43:26,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 310 transitions, 4060 flow [2024-06-20 19:43:26,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 310 transitions, 3768 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-06-20 19:43:26,613 INFO L231 Difference]: Finished difference. Result has 356 places, 295 transitions, 3294 flow [2024-06-20 19:43:26,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3085, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3294, PETRI_PLACES=356, PETRI_TRANSITIONS=295} [2024-06-20 19:43:26,613 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 326 predicate places. [2024-06-20 19:43:26,613 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 295 transitions, 3294 flow [2024-06-20 19:43:26,613 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:43:26,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:26,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:26,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-20 19:43:26,614 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:43:26,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:26,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1390600093, now seen corresponding path program 3 times [2024-06-20 19:43:26,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:26,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179657533] [2024-06-20 19:43:26,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:26,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:34,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:43:34,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:34,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179657533] [2024-06-20 19:43:34,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179657533] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:34,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:34,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:43:34,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80117432] [2024-06-20 19:43:34,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:34,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:43:34,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:34,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:43:34,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:43:34,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:43:34,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 295 transitions, 3294 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:43:34,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:34,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:43:34,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:34,748 INFO L124 PetriNetUnfolderBase]: 827/1547 cut-off events. [2024-06-20 19:43:34,749 INFO L125 PetriNetUnfolderBase]: For 139877/139877 co-relation queries the response was YES. [2024-06-20 19:43:34,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9042 conditions, 1547 events. 827/1547 cut-off events. For 139877/139877 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 9171 event pairs, 171 based on Foata normal form. 12/1559 useless extension candidates. Maximal degree in co-relation 8877. Up to 941 conditions per place. [2024-06-20 19:43:34,766 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 197 selfloop transitions, 108 changer transitions 10/317 dead transitions. [2024-06-20 19:43:34,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 317 transitions, 4036 flow [2024-06-20 19:43:34,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:43:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:43:34,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-20 19:43:34,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782991202346041 [2024-06-20 19:43:34,767 INFO L175 Difference]: Start difference. First operand has 356 places, 295 transitions, 3294 flow. Second operand 11 states and 129 transitions. [2024-06-20 19:43:34,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 317 transitions, 4036 flow [2024-06-20 19:43:35,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 317 transitions, 3739 flow, removed 15 selfloop flow, removed 10 redundant places. [2024-06-20 19:43:35,144 INFO L231 Difference]: Finished difference. Result has 357 places, 291 transitions, 3205 flow [2024-06-20 19:43:35,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3001, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3205, PETRI_PLACES=357, PETRI_TRANSITIONS=291} [2024-06-20 19:43:35,144 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 327 predicate places. [2024-06-20 19:43:35,145 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 291 transitions, 3205 flow [2024-06-20 19:43:35,145 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:43:35,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:35,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:35,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-20 19:43:35,145 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:43:35,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:35,147 INFO L85 PathProgramCache]: Analyzing trace with hash 547953097, now seen corresponding path program 29 times [2024-06-20 19:43:35,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:35,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484313391] [2024-06-20 19:43:35,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:35,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:41,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:43:41,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:41,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484313391] [2024-06-20 19:43:41,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484313391] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:41,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:41,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:43:41,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855109514] [2024-06-20 19:43:41,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:41,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:43:41,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:41,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:43:41,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:43:41,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:43:41,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 291 transitions, 3205 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:43:41,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:41,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:43:41,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:42,291 INFO L124 PetriNetUnfolderBase]: 793/1493 cut-off events. [2024-06-20 19:43:42,291 INFO L125 PetriNetUnfolderBase]: For 93499/93499 co-relation queries the response was YES. [2024-06-20 19:43:42,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8626 conditions, 1493 events. 793/1493 cut-off events. For 93499/93499 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 8944 event pairs, 123 based on Foata normal form. 2/1495 useless extension candidates. Maximal degree in co-relation 8462. Up to 1138 conditions per place. [2024-06-20 19:43:42,306 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 191 selfloop transitions, 113 changer transitions 0/306 dead transitions. [2024-06-20 19:43:42,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 306 transitions, 3878 flow [2024-06-20 19:43:42,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:43:42,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:43:42,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-20 19:43:42,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34838709677419355 [2024-06-20 19:43:42,307 INFO L175 Difference]: Start difference. First operand has 357 places, 291 transitions, 3205 flow. Second operand 10 states and 108 transitions. [2024-06-20 19:43:42,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 306 transitions, 3878 flow [2024-06-20 19:43:42,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 306 transitions, 3638 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-20 19:43:42,609 INFO L231 Difference]: Finished difference. Result has 358 places, 292 transitions, 3224 flow [2024-06-20 19:43:42,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2965, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3224, PETRI_PLACES=358, PETRI_TRANSITIONS=292} [2024-06-20 19:43:42,609 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 328 predicate places. [2024-06-20 19:43:42,609 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 292 transitions, 3224 flow [2024-06-20 19:43:42,610 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:43:42,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:42,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:42,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-20 19:43:42,610 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:43:42,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:42,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1698281981, now seen corresponding path program 4 times [2024-06-20 19:43:42,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:42,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753706683] [2024-06-20 19:43:42,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:42,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:43:49,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:49,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753706683] [2024-06-20 19:43:49,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753706683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:49,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:49,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:43:49,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466039087] [2024-06-20 19:43:49,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:49,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:43:49,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:49,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:43:49,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:43:49,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:43:49,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 292 transitions, 3224 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:43:49,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:49,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:43:49,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:50,168 INFO L124 PetriNetUnfolderBase]: 813/1537 cut-off events. [2024-06-20 19:43:50,168 INFO L125 PetriNetUnfolderBase]: For 145245/145245 co-relation queries the response was YES. [2024-06-20 19:43:50,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8843 conditions, 1537 events. 813/1537 cut-off events. For 145245/145245 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 9170 event pairs, 129 based on Foata normal form. 12/1549 useless extension candidates. Maximal degree in co-relation 8678. Up to 939 conditions per place. [2024-06-20 19:43:50,187 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 176 selfloop transitions, 128 changer transitions 8/314 dead transitions. [2024-06-20 19:43:50,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 314 transitions, 3958 flow [2024-06-20 19:43:50,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:43:50,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:43:50,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-20 19:43:50,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724340175953079 [2024-06-20 19:43:50,188 INFO L175 Difference]: Start difference. First operand has 358 places, 292 transitions, 3224 flow. Second operand 11 states and 127 transitions. [2024-06-20 19:43:50,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 314 transitions, 3958 flow [2024-06-20 19:43:50,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 314 transitions, 3710 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-20 19:43:50,542 INFO L231 Difference]: Finished difference. Result has 361 places, 290 transitions, 3241 flow [2024-06-20 19:43:50,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2976, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3241, PETRI_PLACES=361, PETRI_TRANSITIONS=290} [2024-06-20 19:43:50,543 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 331 predicate places. [2024-06-20 19:43:50,543 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 290 transitions, 3241 flow [2024-06-20 19:43:50,543 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:43:50,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:50,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:50,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-20 19:43:50,543 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:43:50,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:50,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1934614941, now seen corresponding path program 30 times [2024-06-20 19:43:50,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:50,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898454484] [2024-06-20 19:43:50,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:50,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:43:56,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:56,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898454484] [2024-06-20 19:43:56,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898454484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:56,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:56,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:43:56,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576986778] [2024-06-20 19:43:56,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:56,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:43:56,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:56,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:43:56,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:43:56,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:43:56,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 290 transitions, 3241 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:43:56,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:56,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:43:56,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:57,071 INFO L124 PetriNetUnfolderBase]: 787/1491 cut-off events. [2024-06-20 19:43:57,071 INFO L125 PetriNetUnfolderBase]: For 97201/97201 co-relation queries the response was YES. [2024-06-20 19:43:57,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8690 conditions, 1491 events. 787/1491 cut-off events. For 97201/97201 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 8981 event pairs, 147 based on Foata normal form. 2/1493 useless extension candidates. Maximal degree in co-relation 8524. Up to 1136 conditions per place. [2024-06-20 19:43:57,089 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 216 selfloop transitions, 88 changer transitions 0/306 dead transitions. [2024-06-20 19:43:57,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 306 transitions, 3920 flow [2024-06-20 19:43:57,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:43:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:43:57,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-20 19:43:57,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36451612903225805 [2024-06-20 19:43:57,090 INFO L175 Difference]: Start difference. First operand has 361 places, 290 transitions, 3241 flow. Second operand 10 states and 113 transitions. [2024-06-20 19:43:57,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 306 transitions, 3920 flow [2024-06-20 19:43:57,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 306 transitions, 3638 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-20 19:43:57,452 INFO L231 Difference]: Finished difference. Result has 362 places, 291 transitions, 3170 flow [2024-06-20 19:43:57,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2959, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3170, PETRI_PLACES=362, PETRI_TRANSITIONS=291} [2024-06-20 19:43:57,452 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 332 predicate places. [2024-06-20 19:43:57,452 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 291 transitions, 3170 flow [2024-06-20 19:43:57,452 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:43:57,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:57,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:57,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-20 19:43:57,453 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:43:57,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:57,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1934619591, now seen corresponding path program 31 times [2024-06-20 19:43:57,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:57,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212049269] [2024-06-20 19:43:57,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:57,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:02,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:02,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:02,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212049269] [2024-06-20 19:44:02,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212049269] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:02,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:02,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:44:02,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957997675] [2024-06-20 19:44:02,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:02,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:44:02,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:02,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:44:02,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:44:02,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:44:02,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 291 transitions, 3170 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:44:02,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:02,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:44:02,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:03,183 INFO L124 PetriNetUnfolderBase]: 791/1499 cut-off events. [2024-06-20 19:44:03,184 INFO L125 PetriNetUnfolderBase]: For 99153/99153 co-relation queries the response was YES. [2024-06-20 19:44:03,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8647 conditions, 1499 events. 791/1499 cut-off events. For 99153/99153 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 9071 event pairs, 147 based on Foata normal form. 2/1501 useless extension candidates. Maximal degree in co-relation 8480. Up to 1124 conditions per place. [2024-06-20 19:44:03,201 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 215 selfloop transitions, 90 changer transitions 0/307 dead transitions. [2024-06-20 19:44:03,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 307 transitions, 3851 flow [2024-06-20 19:44:03,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:44:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:44:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-20 19:44:03,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36451612903225805 [2024-06-20 19:44:03,202 INFO L175 Difference]: Start difference. First operand has 362 places, 291 transitions, 3170 flow. Second operand 10 states and 113 transitions. [2024-06-20 19:44:03,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 307 transitions, 3851 flow [2024-06-20 19:44:03,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 307 transitions, 3651 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-20 19:44:03,556 INFO L231 Difference]: Finished difference. Result has 364 places, 292 transitions, 3187 flow [2024-06-20 19:44:03,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2970, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3187, PETRI_PLACES=364, PETRI_TRANSITIONS=292} [2024-06-20 19:44:03,556 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 334 predicate places. [2024-06-20 19:44:03,557 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 292 transitions, 3187 flow [2024-06-20 19:44:03,557 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:44:03,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:03,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:44:03,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-20 19:44:03,557 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:44:03,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1728577923, now seen corresponding path program 5 times [2024-06-20 19:44:03,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:03,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664657196] [2024-06-20 19:44:03,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:03,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:11,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:44:11,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:11,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664657196] [2024-06-20 19:44:11,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664657196] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:11,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:11,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:44:11,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466864382] [2024-06-20 19:44:11,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:11,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:44:11,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:11,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:44:11,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:44:11,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 19:44:11,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 292 transitions, 3187 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:44:11,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:11,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 19:44:11,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:12,029 INFO L124 PetriNetUnfolderBase]: 811/1543 cut-off events. [2024-06-20 19:44:12,029 INFO L125 PetriNetUnfolderBase]: For 154296/154296 co-relation queries the response was YES. [2024-06-20 19:44:12,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8828 conditions, 1543 events. 811/1543 cut-off events. For 154296/154296 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 9337 event pairs, 307 based on Foata normal form. 12/1555 useless extension candidates. Maximal degree in co-relation 8660. Up to 1450 conditions per place. [2024-06-20 19:44:12,047 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 282 selfloop transitions, 18 changer transitions 8/310 dead transitions. [2024-06-20 19:44:12,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 310 transitions, 3899 flow [2024-06-20 19:44:12,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:44:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:44:12,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2024-06-20 19:44:12,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3255131964809384 [2024-06-20 19:44:12,048 INFO L175 Difference]: Start difference. First operand has 364 places, 292 transitions, 3187 flow. Second operand 11 states and 111 transitions. [2024-06-20 19:44:12,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 310 transitions, 3899 flow [2024-06-20 19:44:12,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 310 transitions, 3693 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-20 19:44:12,438 INFO L231 Difference]: Finished difference. Result has 367 places, 290 transitions, 3030 flow [2024-06-20 19:44:12,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2981, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3030, PETRI_PLACES=367, PETRI_TRANSITIONS=290} [2024-06-20 19:44:12,438 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 337 predicate places. [2024-06-20 19:44:12,438 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 290 transitions, 3030 flow [2024-06-20 19:44:12,438 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:44:12,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:12,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:44:12,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-20 19:44:12,439 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:44:12,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:12,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1993501181, now seen corresponding path program 6 times [2024-06-20 19:44:12,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:12,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600560890] [2024-06-20 19:44:12,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:12,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15