./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 76401ed0 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-76401ed-m [2024-06-20 19:30:54,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 19:30:54,158 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:54,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 19:30:54,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 19:30:54,182 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 19:30:54,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 19:30:54,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 19:30:54,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 19:30:54,183 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 19:30:54,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 19:30:54,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 19:30:54,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 19:30:54,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 19:30:54,190 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 19:30:54,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 19:30:54,191 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 19:30:54,191 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 19:30:54,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 19:30:54,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 19:30:54,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 19:30:54,192 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 19:30:54,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 19:30:54,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 19:30:54,192 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 19:30:54,192 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 19:30:54,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 19:30:54,193 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 19:30:54,193 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 19:30:54,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 19:30:54,194 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 19:30:54,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 19:30:54,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:30:54,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 19:30:54,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 19:30:54,194 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 19:30:54,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 19:30:54,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 19:30:54,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 19:30:54,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 19:30:54,195 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 19:30:54,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 19:30:54,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 19:30:54,195 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:54,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 19:30:54,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 19:30:54,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 19:30:54,432 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 19:30:54,433 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 19:30:54,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-20 19:30:55,577 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 19:30:55,924 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 19:30:55,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-20 19:30:55,937 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0883168c0/bf6879ac7d674ea6b995ff2516c077f4/FLAG5740f2ed3 [2024-06-20 19:30:55,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0883168c0/bf6879ac7d674ea6b995ff2516c077f4 [2024-06-20 19:30:55,952 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 19:30:55,952 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 19:30:55,953 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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-20 19:30:56,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 19:30:56,100 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 19:30:56,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 19:30:56,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 19:30:56,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 19:30:56,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:30:55" (1/2) ... [2024-06-20 19:30:56,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e24e03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:30:56, skipping insertion in model container [2024-06-20 19:30:56,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:30:55" (1/2) ... [2024-06-20 19:30:56,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2977c7b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:30:56, skipping insertion in model container [2024-06-20 19:30:56,108 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:56" (2/2) ... [2024-06-20 19:30:56,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e24e03b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:30:56, skipping insertion in model container [2024-06-20 19:30:56,109 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:56" (2/2) ... [2024-06-20 19:30:56,109 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 19:30:56,165 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 19:30:56,167 INFO L97 edCorrectnessWitness]: Location invariant before [L816-L816] ((((((((((((((((! multithreaded || (((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 2) && __unbuffered_p1_EAX <= 127) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 2) && __unbuffered_p1_EBX <= 127) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 127) && __unbuffered_p1_EBX <= 127) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1))) [2024-06-20 19:30:56,167 INFO L97 edCorrectnessWitness]: Location invariant before [L817-L817] ((((((((((((((((! multithreaded || (((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 2) && __unbuffered_p1_EAX <= 127) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 2) && __unbuffered_p1_EBX <= 127) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 127) && __unbuffered_p1_EBX <= 127) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1))) [2024-06-20 19:30:56,168 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 19:30:56,168 INFO L106 edCorrectnessWitness]: ghost_update [L814-L814] multithreaded = 1; [2024-06-20 19:30:56,205 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 19:30:56,520 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:30:56,529 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-20 19:30:56,774 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:30:56,808 INFO L206 MainTranslator]: Completed translation [2024-06-20 19:30:56,809 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:30:56 WrapperNode [2024-06-20 19:30:56,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 19:30:56,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 19:30:56,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 19:30:56,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 19:30:56,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:30:56" (1/1) ... [2024-06-20 19:30:56,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:30:56" (1/1) ... [2024-06-20 19:30:56,903 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 120 [2024-06-20 19:30:56,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 19:30:56,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 19:30:56,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 19:30:56,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 19:30:56,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:30:56" (1/1) ... [2024-06-20 19:30:56,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:30:56" (1/1) ... [2024-06-20 19:30:56,977 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:30:56" (1/1) ... [2024-06-20 19:30:56,998 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:57,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:30:56" (1/1) ... [2024-06-20 19:30:57,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:30:56" (1/1) ... [2024-06-20 19:30:57,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:30:56" (1/1) ... [2024-06-20 19:30:57,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:30:56" (1/1) ... [2024-06-20 19:30:57,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:30:56" (1/1) ... [2024-06-20 19:30:57,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:30:56" (1/1) ... [2024-06-20 19:30:57,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 19:30:57,045 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 19:30:57,045 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 19:30:57,045 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 19:30:57,046 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:30:56" (1/1) ... [2024-06-20 19:30:57,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:30:57,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 19:30:57,069 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:57,087 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:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-20 19:30:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 19:30:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-20 19:30:57,100 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-20 19:30:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-20 19:30:57,101 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-20 19:30:57,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 19:30:57,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-20 19:30:57,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 19:30:57,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 19:30:57,102 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:57,225 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 19:30:57,226 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 19:30:57,863 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 19:30:57,864 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 19:30:58,041 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 19:30:58,041 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-20 19:30:58,043 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:30:58 BoogieIcfgContainer [2024-06-20 19:30:58,043 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 19:30:58,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 19:30:58,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 19:30:58,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 19:30:58,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:30:55" (1/4) ... [2024-06-20 19:30:58,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f362867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:30:58, skipping insertion in model container [2024-06-20 19:30:58,054 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:56" (2/4) ... [2024-06-20 19:30:58,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f362867 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:30:58, skipping insertion in model container [2024-06-20 19:30:58,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:30:56" (3/4) ... [2024-06-20 19:30:58,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f362867 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:30:58, skipping insertion in model container [2024-06-20 19:30:58,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:30:58" (4/4) ... [2024-06-20 19:30:58,056 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-20 19:30:58,069 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 19:30:58,070 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-20 19:30:58,070 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 19:30:58,133 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-20 19:30:58,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 72 flow [2024-06-20 19:30:58,207 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-06-20 19:30:58,209 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:30:58,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-20 19:30:58,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 72 flow [2024-06-20 19:30:58,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 54 flow [2024-06-20 19:30:58,248 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 19:30:58,269 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;@24c0aeac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 19:30:58,269 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-20 19:30:58,276 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 19:30:58,277 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-20 19:30:58,277 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:30:58,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:30:58,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 19:30:58,278 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:58,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:30:58,328 INFO L85 PathProgramCache]: Analyzing trace with hash 325199742, now seen corresponding path program 1 times [2024-06-20 19:30:58,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:30:58,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745007332] [2024-06-20 19:30:58,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:30:58,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:30:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:02,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:31:02,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:02,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745007332] [2024-06-20 19:31:02,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745007332] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:02,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:02,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 19:31:02,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157842159] [2024-06-20 19:31:02,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:02,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 19:31:02,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:02,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 19:31:02,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 19:31:02,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2024-06-20 19:31:02,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call 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,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:02,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2024-06-20 19:31:02,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:02,377 INFO L124 PetriNetUnfolderBase]: 131/269 cut-off events. [2024-06-20 19:31:02,377 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-20 19:31:02,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 269 events. 131/269 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1071 event pairs, 75 based on Foata normal form. 1/257 useless extension candidates. Maximal degree in co-relation 514. Up to 235 conditions per place. [2024-06-20 19:31:02,381 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 20 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-20 19:31:02,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 115 flow [2024-06-20 19:31:02,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 19:31:02,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 19:31:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2024-06-20 19:31:02,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2024-06-20 19:31:02,391 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 61 transitions. [2024-06-20 19:31:02,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 115 flow [2024-06-20 19:31:02,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-20 19:31:02,395 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 73 flow [2024-06-20 19:31:02,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-06-20 19:31:02,399 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-20 19:31:02,399 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 73 flow [2024-06-20 19:31:02,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call 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,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:02,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:02,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 19:31:02,400 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:31:02,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:02,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1015624547, now seen corresponding path program 1 times [2024-06-20 19:31:02,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:02,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45960161] [2024-06-20 19:31:02,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:02,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:05,158 INFO L134 CoverageAnalysis]: 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:05,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:05,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45960161] [2024-06-20 19:31:05,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45960161] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:05,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:05,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 19:31:05,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832043938] [2024-06-20 19:31:05,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:05,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 19:31:05,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:05,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 19:31:05,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-20 19:31:05,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-06-20 19:31:05,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:31:05,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:05,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-06-20 19:31:05,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:05,376 INFO L124 PetriNetUnfolderBase]: 172/322 cut-off events. [2024-06-20 19:31:05,376 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-06-20 19:31:05,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 322 events. 172/322 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1275 event pairs, 79 based on Foata normal form. 2/323 useless extension candidates. Maximal degree in co-relation 723. Up to 295 conditions per place. [2024-06-20 19:31:05,379 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 26 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-20 19:31:05,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 161 flow [2024-06-20 19:31:05,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 19:31:05,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 19:31:05,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2024-06-20 19:31:05,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5703125 [2024-06-20 19:31:05,380 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 73 flow. Second operand 4 states and 73 transitions. [2024-06-20 19:31:05,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 161 flow [2024-06-20 19:31:05,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 19:31:05,382 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 97 flow [2024-06-20 19:31:05,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-20 19:31:05,383 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-20 19:31:05,383 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 97 flow [2024-06-20 19:31:05,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:31:05,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:05,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:05,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 19:31:05,384 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:31:05,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:05,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1057575492, now seen corresponding path program 1 times [2024-06-20 19:31:05,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:05,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007613720] [2024-06-20 19:31:05,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:05,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:08,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:31:08,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:08,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007613720] [2024-06-20 19:31:08,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007613720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:08,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:08,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 19:31:08,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301331556] [2024-06-20 19:31:08,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:08,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 19:31:08,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:08,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 19:31:08,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-20 19:31:08,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-06-20 19:31:08,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call 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:08,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:08,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-06-20 19:31:08,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:09,092 INFO L124 PetriNetUnfolderBase]: 169/317 cut-off events. [2024-06-20 19:31:09,093 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2024-06-20 19:31:09,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 317 events. 169/317 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1223 event pairs, 55 based on Foata normal form. 2/318 useless extension candidates. Maximal degree in co-relation 792. Up to 281 conditions per place. [2024-06-20 19:31:09,095 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 30 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2024-06-20 19:31:09,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 209 flow [2024-06-20 19:31:09,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:31:09,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:31:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-06-20 19:31:09,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55625 [2024-06-20 19:31:09,097 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 97 flow. Second operand 5 states and 89 transitions. [2024-06-20 19:31:09,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 209 flow [2024-06-20 19:31:09,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 200 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-20 19:31:09,099 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 121 flow [2024-06-20 19:31:09,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-06-20 19:31:09,099 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-06-20 19:31:09,100 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 121 flow [2024-06-20 19:31:09,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call 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:09,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:09,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:09,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 19:31:09,100 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting 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:09,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:09,101 INFO L85 PathProgramCache]: Analyzing trace with hash 844517404, now seen corresponding path program 1 times [2024-06-20 19:31:09,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:09,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958921521] [2024-06-20 19:31:09,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:09,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:13,720 INFO L134 CoverageAnalysis]: 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,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:13,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958921521] [2024-06-20 19:31:13,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958921521] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:13,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:13,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:31:13,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980055404] [2024-06-20 19:31:13,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:13,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:31:13,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:13,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:31:13,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:31:13,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-06-20 19:31:13,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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:31:13,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:13,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-06-20 19:31:13,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:14,040 INFO L124 PetriNetUnfolderBase]: 123/264 cut-off events. [2024-06-20 19:31:14,041 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2024-06-20 19:31:14,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 264 events. 123/264 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1035 event pairs, 38 based on Foata normal form. 1/261 useless extension candidates. Maximal degree in co-relation 693. Up to 219 conditions per place. [2024-06-20 19:31:14,044 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 25 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2024-06-20 19:31:14,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 201 flow [2024-06-20 19:31:14,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:31:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:31:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2024-06-20 19:31:14,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4875 [2024-06-20 19:31:14,049 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 121 flow. Second operand 5 states and 78 transitions. [2024-06-20 19:31:14,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 201 flow [2024-06-20 19:31:14,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 186 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-20 19:31:14,053 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 133 flow [2024-06-20 19:31:14,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2024-06-20 19:31:14,054 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-06-20 19:31:14,054 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 133 flow [2024-06-20 19:31:14,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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:31:14,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:14,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:14,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 19:31:14,055 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:31:14,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:14,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1577241307, now seen corresponding path program 1 times [2024-06-20 19:31:14,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:14,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033956295] [2024-06-20 19:31:14,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:14,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:17,169 INFO L134 CoverageAnalysis]: 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:17,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:17,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033956295] [2024-06-20 19:31:17,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033956295] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:17,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:17,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:31:17,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26046589] [2024-06-20 19:31:17,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:17,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:31:17,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:17,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:31:17,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:31:17,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-06-20 19:31:17,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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:17,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:17,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-06-20 19:31:17,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:17,578 INFO L124 PetriNetUnfolderBase]: 163/306 cut-off events. [2024-06-20 19:31:17,579 INFO L125 PetriNetUnfolderBase]: For 475/475 co-relation queries the response was YES. [2024-06-20 19:31:17,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 907 conditions, 306 events. 163/306 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1165 event pairs, 29 based on Foata normal form. 4/309 useless extension candidates. Maximal degree in co-relation 890. Up to 252 conditions per place. [2024-06-20 19:31:17,581 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 32 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2024-06-20 19:31:17,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 239 flow [2024-06-20 19:31:17,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:31:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:31:17,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-20 19:31:17,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-06-20 19:31:17,583 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 133 flow. Second operand 6 states and 100 transitions. [2024-06-20 19:31:17,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 239 flow [2024-06-20 19:31:17,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 228 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-20 19:31:17,585 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 134 flow [2024-06-20 19:31:17,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2024-06-20 19:31:17,585 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2024-06-20 19:31:17,585 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 134 flow [2024-06-20 19:31:17,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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:17,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:17,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:17,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 19:31:17,586 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:17,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:17,587 INFO L85 PathProgramCache]: Analyzing trace with hash 410236581, now seen corresponding path program 1 times [2024-06-20 19:31:17,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:17,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625750607] [2024-06-20 19:31:17,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:17,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:22,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:31:22,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:22,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625750607] [2024-06-20 19:31:22,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625750607] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:22,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:22,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:31:22,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249286986] [2024-06-20 19:31:22,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:22,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:31:22,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:22,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:31:22,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:31:22,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:31:22,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 134 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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:31:22,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:22,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:31:22,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:22,778 INFO L124 PetriNetUnfolderBase]: 179/336 cut-off events. [2024-06-20 19:31:22,779 INFO L125 PetriNetUnfolderBase]: For 705/705 co-relation queries the response was YES. [2024-06-20 19:31:22,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 336 events. 179/336 cut-off events. For 705/705 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1346 event pairs, 49 based on Foata normal form. 3/337 useless extension candidates. Maximal degree in co-relation 1017. Up to 269 conditions per place. [2024-06-20 19:31:22,782 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 30 selfloop transitions, 12 changer transitions 0/46 dead transitions. [2024-06-20 19:31:22,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 274 flow [2024-06-20 19:31:22,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:31:22,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:31:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2024-06-20 19:31:22,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.453125 [2024-06-20 19:31:22,783 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 134 flow. Second operand 6 states and 87 transitions. [2024-06-20 19:31:22,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 274 flow [2024-06-20 19:31:22,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 254 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-20 19:31:22,786 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 182 flow [2024-06-20 19:31:22,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=182, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2024-06-20 19:31:22,786 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2024-06-20 19:31:22,787 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 182 flow [2024-06-20 19:31:22,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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:31:22,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:22,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:22,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 19:31:22,787 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:22,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:22,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1569247621, now seen corresponding path program 1 times [2024-06-20 19:31:22,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:22,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168348320] [2024-06-20 19:31:22,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:22,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:27,373 INFO L134 CoverageAnalysis]: 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:27,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:27,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168348320] [2024-06-20 19:31:27,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168348320] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:27,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:27,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:31:27,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899881683] [2024-06-20 19:31:27,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:27,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:31:27,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:27,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:31:27,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:31:27,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:31:27,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 182 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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:31:27,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:27,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:31:27,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:27,711 INFO L124 PetriNetUnfolderBase]: 189/359 cut-off events. [2024-06-20 19:31:27,712 INFO L125 PetriNetUnfolderBase]: For 1011/1011 co-relation queries the response was YES. [2024-06-20 19:31:27,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 359 events. 189/359 cut-off events. For 1011/1011 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1459 event pairs, 53 based on Foata normal form. 2/360 useless extension candidates. Maximal degree in co-relation 1224. Up to 315 conditions per place. [2024-06-20 19:31:27,714 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 38 selfloop transitions, 11 changer transitions 0/53 dead transitions. [2024-06-20 19:31:27,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 342 flow [2024-06-20 19:31:27,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:31:27,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:31:27,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2024-06-20 19:31:27,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-20 19:31:27,715 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 182 flow. Second operand 7 states and 96 transitions. [2024-06-20 19:31:27,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 342 flow [2024-06-20 19:31:27,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 328 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-20 19:31:27,718 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 237 flow [2024-06-20 19:31:27,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=237, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-06-20 19:31:27,719 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2024-06-20 19:31:27,719 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 237 flow [2024-06-20 19:31:27,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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:31:27,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:27,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:27,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 19:31:27,720 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:27,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:27,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1033116711, now seen corresponding path program 2 times [2024-06-20 19:31:27,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:27,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629156923] [2024-06-20 19:31:27,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:27,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:31:32,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:32,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629156923] [2024-06-20 19:31:32,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629156923] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:32,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:32,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:31:32,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566644782] [2024-06-20 19:31:32,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:32,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:31:32,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:32,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:31:32,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:31:32,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:31:32,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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:31:32,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:32,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:31:32,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:32,646 INFO L124 PetriNetUnfolderBase]: 195/373 cut-off events. [2024-06-20 19:31:32,646 INFO L125 PetriNetUnfolderBase]: For 1378/1378 co-relation queries the response was YES. [2024-06-20 19:31:32,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1382 conditions, 373 events. 195/373 cut-off events. For 1378/1378 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1543 event pairs, 50 based on Foata normal form. 2/374 useless extension candidates. Maximal degree in co-relation 1358. Up to 319 conditions per place. [2024-06-20 19:31:32,650 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 37 selfloop transitions, 12 changer transitions 0/53 dead transitions. [2024-06-20 19:31:32,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 380 flow [2024-06-20 19:31:32,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:31:32,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:31:32,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-06-20 19:31:32,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-20 19:31:32,653 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 237 flow. Second operand 6 states and 84 transitions. [2024-06-20 19:31:32,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 380 flow [2024-06-20 19:31:32,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 359 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-20 19:31:32,656 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 271 flow [2024-06-20 19:31:32,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2024-06-20 19:31:32,663 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 22 predicate places. [2024-06-20 19:31:32,663 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 271 flow [2024-06-20 19:31:32,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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:31:32,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:32,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:32,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 19:31:32,664 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:32,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:32,664 INFO L85 PathProgramCache]: Analyzing trace with hash -288708477, now seen corresponding path program 3 times [2024-06-20 19:31:32,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:32,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367368410] [2024-06-20 19:31:32,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:32,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:37,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:31:37,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:37,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367368410] [2024-06-20 19:31:37,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367368410] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:37,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:37,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:31:37,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836038977] [2024-06-20 19:31:37,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:37,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:31:37,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:37,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:31:37,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:31:37,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:31:37,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 271 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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:31:37,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:37,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:31:37,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:37,675 INFO L124 PetriNetUnfolderBase]: 185/352 cut-off events. [2024-06-20 19:31:37,675 INFO L125 PetriNetUnfolderBase]: For 1674/1674 co-relation queries the response was YES. [2024-06-20 19:31:37,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 352 events. 185/352 cut-off events. For 1674/1674 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1443 event pairs, 55 based on Foata normal form. 4/352 useless extension candidates. Maximal degree in co-relation 1317. Up to 248 conditions per place. [2024-06-20 19:31:37,677 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 34 selfloop transitions, 18 changer transitions 0/56 dead transitions. [2024-06-20 19:31:37,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 433 flow [2024-06-20 19:31:37,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:31:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:31:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2024-06-20 19:31:37,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-20 19:31:37,679 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 271 flow. Second operand 6 states and 88 transitions. [2024-06-20 19:31:37,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 433 flow [2024-06-20 19:31:37,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 56 transitions, 401 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-20 19:31:37,681 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 311 flow [2024-06-20 19:31:37,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=311, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-06-20 19:31:37,682 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 25 predicate places. [2024-06-20 19:31:37,682 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 311 flow [2024-06-20 19:31:37,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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:31:37,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:37,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:37,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 19:31:37,683 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,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:37,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1026441543, now seen corresponding path program 1 times [2024-06-20 19:31:37,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:37,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155417298] [2024-06-20 19:31:37,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:37,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:42,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:42,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:42,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155417298] [2024-06-20 19:31:42,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155417298] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:42,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:42,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:31:42,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409424667] [2024-06-20 19:31:42,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:42,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:31:42,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:42,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:31:42,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:31:42,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:31:42,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 311 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:31:42,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:42,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:31:42,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:43,086 INFO L124 PetriNetUnfolderBase]: 194/374 cut-off events. [2024-06-20 19:31:43,086 INFO L125 PetriNetUnfolderBase]: For 1712/1712 co-relation queries the response was YES. [2024-06-20 19:31:43,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 374 events. 194/374 cut-off events. For 1712/1712 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1555 event pairs, 49 based on Foata normal form. 3/374 useless extension candidates. Maximal degree in co-relation 1431. Up to 260 conditions per place. [2024-06-20 19:31:43,088 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 36 selfloop transitions, 22 changer transitions 0/62 dead transitions. [2024-06-20 19:31:43,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 62 transitions, 503 flow [2024-06-20 19:31:43,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:31:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:31:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2024-06-20 19:31:43,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45089285714285715 [2024-06-20 19:31:43,090 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 311 flow. Second operand 7 states and 101 transitions. [2024-06-20 19:31:43,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 62 transitions, 503 flow [2024-06-20 19:31:43,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 62 transitions, 467 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-20 19:31:43,093 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 359 flow [2024-06-20 19:31:43,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=359, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2024-06-20 19:31:43,093 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 28 predicate places. [2024-06-20 19:31:43,093 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 359 flow [2024-06-20 19:31:43,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:31:43,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:43,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:43,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-20 19:31:43,094 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:43,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:43,094 INFO L85 PathProgramCache]: Analyzing trace with hash -899609212, now seen corresponding path program 1 times [2024-06-20 19:31:43,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:43,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347331221] [2024-06-20 19:31:43,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:43,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:48,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:31:48,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:48,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347331221] [2024-06-20 19:31:48,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347331221] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:48,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:48,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:31:48,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499888244] [2024-06-20 19:31:48,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:48,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:31:48,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:48,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:31:48,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:31:48,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:31:48,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 359 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call 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:48,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:48,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:31:48,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:48,789 INFO L124 PetriNetUnfolderBase]: 203/393 cut-off events. [2024-06-20 19:31:48,790 INFO L125 PetriNetUnfolderBase]: For 2044/2044 co-relation queries the response was YES. [2024-06-20 19:31:48,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1599 conditions, 393 events. 203/393 cut-off events. For 2044/2044 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1667 event pairs, 48 based on Foata normal form. 3/393 useless extension candidates. Maximal degree in co-relation 1571. Up to 249 conditions per place. [2024-06-20 19:31:48,792 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 39 selfloop transitions, 26 changer transitions 0/69 dead transitions. [2024-06-20 19:31:48,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 69 transitions, 579 flow [2024-06-20 19:31:48,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:31:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:31:48,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2024-06-20 19:31:48,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44921875 [2024-06-20 19:31:48,795 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 359 flow. Second operand 8 states and 115 transitions. [2024-06-20 19:31:48,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 69 transitions, 579 flow [2024-06-20 19:31:48,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 552 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-20 19:31:48,799 INFO L231 Difference]: Finished difference. Result has 64 places, 56 transitions, 430 flow [2024-06-20 19:31:48,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=430, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2024-06-20 19:31:48,799 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 33 predicate places. [2024-06-20 19:31:48,799 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 430 flow [2024-06-20 19:31:48,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call 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:48,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:48,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:48,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-20 19:31:48,800 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:48,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:48,800 INFO L85 PathProgramCache]: Analyzing trace with hash -617941768, now seen corresponding path program 1 times [2024-06-20 19:31:48,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:48,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508278248] [2024-06-20 19:31:48,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:48,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:53,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:31:53,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:53,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508278248] [2024-06-20 19:31:53,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508278248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:53,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:53,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:31:53,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227008408] [2024-06-20 19:31:53,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:53,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:31:53,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:53,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:31:53,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:31:53,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:31:53,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 430 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:31:53,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:31:53,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:31:53,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:31:54,259 INFO L124 PetriNetUnfolderBase]: 201/388 cut-off events. [2024-06-20 19:31:54,260 INFO L125 PetriNetUnfolderBase]: For 2421/2421 co-relation queries the response was YES. [2024-06-20 19:31:54,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1704 conditions, 388 events. 201/388 cut-off events. For 2421/2421 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1641 event pairs, 54 based on Foata normal form. 1/388 useless extension candidates. Maximal degree in co-relation 1674. Up to 327 conditions per place. [2024-06-20 19:31:54,262 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 54 selfloop transitions, 12 changer transitions 0/70 dead transitions. [2024-06-20 19:31:54,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 610 flow [2024-06-20 19:31:54,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:31:54,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:31:54,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-06-20 19:31:54,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4330357142857143 [2024-06-20 19:31:54,264 INFO L175 Difference]: Start difference. First operand has 64 places, 56 transitions, 430 flow. Second operand 7 states and 97 transitions. [2024-06-20 19:31:54,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 610 flow [2024-06-20 19:31:54,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 70 transitions, 575 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-20 19:31:54,268 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 442 flow [2024-06-20 19:31:54,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=442, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2024-06-20 19:31:54,269 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 36 predicate places. [2024-06-20 19:31:54,269 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 442 flow [2024-06-20 19:31:54,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:31:54,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:31:54,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:31:54,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-20 19:31:54,269 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:54,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:31:54,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2118091782, now seen corresponding path program 1 times [2024-06-20 19:31:54,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:31:54,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136137958] [2024-06-20 19:31:54,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:31:54,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:31:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:31:59,921 INFO L134 CoverageAnalysis]: 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:59,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:31:59,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136137958] [2024-06-20 19:31:59,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136137958] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:31:59,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:31:59,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:31:59,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848001816] [2024-06-20 19:31:59,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:31:59,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:31:59,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:31:59,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:31:59,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:32:00,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:32:00,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 442 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call 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:00,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:00,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:32:00,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:00,348 INFO L124 PetriNetUnfolderBase]: 207/400 cut-off events. [2024-06-20 19:32:00,348 INFO L125 PetriNetUnfolderBase]: For 2821/2821 co-relation queries the response was YES. [2024-06-20 19:32:00,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 400 events. 207/400 cut-off events. For 2821/2821 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1694 event pairs, 49 based on Foata normal form. 2/399 useless extension candidates. Maximal degree in co-relation 1749. Up to 278 conditions per place. [2024-06-20 19:32:00,351 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 45 selfloop transitions, 24 changer transitions 0/73 dead transitions. [2024-06-20 19:32:00,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 73 transitions, 656 flow [2024-06-20 19:32:00,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:32:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:32:00,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-20 19:32:00,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44140625 [2024-06-20 19:32:00,352 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 442 flow. Second operand 8 states and 113 transitions. [2024-06-20 19:32:00,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 73 transitions, 656 flow [2024-06-20 19:32:00,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 73 transitions, 627 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-20 19:32:00,359 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 482 flow [2024-06-20 19:32:00,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=482, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2024-06-20 19:32:00,360 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 39 predicate places. [2024-06-20 19:32:00,360 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 482 flow [2024-06-20 19:32:00,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call 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:00,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:00,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:00,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-20 19:32:00,361 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:32:00,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:00,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1431876346, now seen corresponding path program 2 times [2024-06-20 19:32:00,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:00,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043298995] [2024-06-20 19:32:00,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:00,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:32:05,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:05,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043298995] [2024-06-20 19:32:05,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043298995] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:05,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:05,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:32:05,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481923238] [2024-06-20 19:32:05,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:05,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:32:05,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:05,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:32:05,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:32:05,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:32:05,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 482 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:32:05,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:05,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:32:05,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:05,604 INFO L124 PetriNetUnfolderBase]: 205/397 cut-off events. [2024-06-20 19:32:05,604 INFO L125 PetriNetUnfolderBase]: For 3209/3209 co-relation queries the response was YES. [2024-06-20 19:32:05,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1832 conditions, 397 events. 205/397 cut-off events. For 3209/3209 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1677 event pairs, 46 based on Foata normal form. 1/395 useless extension candidates. Maximal degree in co-relation 1799. Up to 312 conditions per place. [2024-06-20 19:32:05,607 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 56 selfloop transitions, 18 changer transitions 0/78 dead transitions. [2024-06-20 19:32:05,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 78 transitions, 738 flow [2024-06-20 19:32:05,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:32:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:32:05,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-06-20 19:32:05,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4330357142857143 [2024-06-20 19:32:05,608 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 482 flow. Second operand 7 states and 97 transitions. [2024-06-20 19:32:05,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 78 transitions, 738 flow [2024-06-20 19:32:05,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 78 transitions, 670 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-20 19:32:05,616 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 542 flow [2024-06-20 19:32:05,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=542, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2024-06-20 19:32:05,617 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 42 predicate places. [2024-06-20 19:32:05,617 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 542 flow [2024-06-20 19:32:05,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:32:05,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:05,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:05,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-20 19:32:05,618 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:05,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:05,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1432183928, now seen corresponding path program 1 times [2024-06-20 19:32:05,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:05,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359298531] [2024-06-20 19:32:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:05,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:11,662 INFO L134 CoverageAnalysis]: 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:11,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:11,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359298531] [2024-06-20 19:32:11,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359298531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:11,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:11,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:32:11,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029785068] [2024-06-20 19:32:11,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:11,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:32:11,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:11,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:32:11,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:32:11,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:32:11,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 542 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call 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:11,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:11,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:32:11,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:12,036 INFO L124 PetriNetUnfolderBase]: 206/401 cut-off events. [2024-06-20 19:32:12,036 INFO L125 PetriNetUnfolderBase]: For 3510/3510 co-relation queries the response was YES. [2024-06-20 19:32:12,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1887 conditions, 401 events. 206/401 cut-off events. For 3510/3510 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1691 event pairs, 44 based on Foata normal form. 2/400 useless extension candidates. Maximal degree in co-relation 1851. Up to 294 conditions per place. [2024-06-20 19:32:12,039 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 58 selfloop transitions, 28 changer transitions 0/90 dead transitions. [2024-06-20 19:32:12,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 90 transitions, 850 flow [2024-06-20 19:32:12,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:32:12,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:32:12,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-20 19:32:12,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2024-06-20 19:32:12,042 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 542 flow. Second operand 9 states and 123 transitions. [2024-06-20 19:32:12,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 90 transitions, 850 flow [2024-06-20 19:32:12,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 90 transitions, 832 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-06-20 19:32:12,047 INFO L231 Difference]: Finished difference. Result has 83 places, 80 transitions, 714 flow [2024-06-20 19:32:12,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=714, PETRI_PLACES=83, PETRI_TRANSITIONS=80} [2024-06-20 19:32:12,048 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 52 predicate places. [2024-06-20 19:32:12,048 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 80 transitions, 714 flow [2024-06-20 19:32:12,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call 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:12,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:12,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:12,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-20 19:32:12,050 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:12,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:12,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1976324791, now seen corresponding path program 1 times [2024-06-20 19:32:12,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:12,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184969692] [2024-06-20 19:32:12,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:12,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:16,931 INFO L134 CoverageAnalysis]: 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:16,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:16,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184969692] [2024-06-20 19:32:16,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184969692] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:16,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:16,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:32:16,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535167493] [2024-06-20 19:32:16,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:16,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:32:16,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:16,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:32:16,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:32:17,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:32:17,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 80 transitions, 714 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:32:17,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:17,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:32:17,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:17,267 INFO L124 PetriNetUnfolderBase]: 204/395 cut-off events. [2024-06-20 19:32:17,267 INFO L125 PetriNetUnfolderBase]: For 3790/3790 co-relation queries the response was YES. [2024-06-20 19:32:17,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2035 conditions, 395 events. 204/395 cut-off events. For 3790/3790 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1684 event pairs, 48 based on Foata normal form. 1/392 useless extension candidates. Maximal degree in co-relation 1994. Up to 284 conditions per place. [2024-06-20 19:32:17,270 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 56 selfloop transitions, 27 changer transitions 0/87 dead transitions. [2024-06-20 19:32:17,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 87 transitions, 904 flow [2024-06-20 19:32:17,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:32:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:32:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2024-06-20 19:32:17,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.453125 [2024-06-20 19:32:17,272 INFO L175 Difference]: Start difference. First operand has 83 places, 80 transitions, 714 flow. Second operand 6 states and 87 transitions. [2024-06-20 19:32:17,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 87 transitions, 904 flow [2024-06-20 19:32:17,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 87 transitions, 874 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-20 19:32:17,278 INFO L231 Difference]: Finished difference. Result has 87 places, 80 transitions, 754 flow [2024-06-20 19:32:17,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=754, PETRI_PLACES=87, PETRI_TRANSITIONS=80} [2024-06-20 19:32:17,279 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 56 predicate places. [2024-06-20 19:32:17,279 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 80 transitions, 754 flow [2024-06-20 19:32:17,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:32:17,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:17,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:17,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-20 19:32:17,281 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:17,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:17,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1236334907, now seen corresponding path program 1 times [2024-06-20 19:32:17,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:17,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305671424] [2024-06-20 19:32:17,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:17,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:23,083 INFO L134 CoverageAnalysis]: 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:23,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:23,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305671424] [2024-06-20 19:32:23,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305671424] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:23,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:23,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:32:23,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925871969] [2024-06-20 19:32:23,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:23,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:32:23,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:23,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:32:23,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:32:23,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:32:23,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 80 transitions, 754 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call 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:23,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:23,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:32:23,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:23,596 INFO L124 PetriNetUnfolderBase]: 220/430 cut-off events. [2024-06-20 19:32:23,597 INFO L125 PetriNetUnfolderBase]: For 4712/4712 co-relation queries the response was YES. [2024-06-20 19:32:23,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2267 conditions, 430 events. 220/430 cut-off events. For 4712/4712 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1891 event pairs, 44 based on Foata normal form. 2/429 useless extension candidates. Maximal degree in co-relation 2224. Up to 262 conditions per place. [2024-06-20 19:32:23,600 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 56 selfloop transitions, 40 changer transitions 0/100 dead transitions. [2024-06-20 19:32:23,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 100 transitions, 1108 flow [2024-06-20 19:32:23,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:32:23,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:32:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2024-06-20 19:32:23,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2024-06-20 19:32:23,602 INFO L175 Difference]: Start difference. First operand has 87 places, 80 transitions, 754 flow. Second operand 9 states and 129 transitions. [2024-06-20 19:32:23,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 100 transitions, 1108 flow [2024-06-20 19:32:23,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 100 transitions, 1050 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-20 19:32:23,612 INFO L231 Difference]: Finished difference. Result has 91 places, 86 transitions, 833 flow [2024-06-20 19:32:23,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=833, PETRI_PLACES=91, PETRI_TRANSITIONS=86} [2024-06-20 19:32:23,613 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 60 predicate places. [2024-06-20 19:32:23,614 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 86 transitions, 833 flow [2024-06-20 19:32:23,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call 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:23,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:23,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:23,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-20 19:32:23,614 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:23,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:23,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1236008477, now seen corresponding path program 2 times [2024-06-20 19:32:23,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:23,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756540584] [2024-06-20 19:32:23,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:23,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:29,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:32:29,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:29,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756540584] [2024-06-20 19:32:29,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756540584] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:29,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:29,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:32:29,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986730537] [2024-06-20 19:32:29,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:29,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:32:29,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:29,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:32:29,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:32:29,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:32:29,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 86 transitions, 833 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call 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:29,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:29,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:32:29,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:30,109 INFO L124 PetriNetUnfolderBase]: 216/420 cut-off events. [2024-06-20 19:32:30,109 INFO L125 PetriNetUnfolderBase]: For 4944/4944 co-relation queries the response was YES. [2024-06-20 19:32:30,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2276 conditions, 420 events. 216/420 cut-off events. For 4944/4944 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1820 event pairs, 43 based on Foata normal form. 2/419 useless extension candidates. Maximal degree in co-relation 2232. Up to 259 conditions per place. [2024-06-20 19:32:30,128 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 53 selfloop transitions, 40 changer transitions 0/97 dead transitions. [2024-06-20 19:32:30,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 97 transitions, 1084 flow [2024-06-20 19:32:30,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:32:30,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:32:30,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2024-06-20 19:32:30,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4409722222222222 [2024-06-20 19:32:30,133 INFO L175 Difference]: Start difference. First operand has 91 places, 86 transitions, 833 flow. Second operand 9 states and 127 transitions. [2024-06-20 19:32:30,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 97 transitions, 1084 flow [2024-06-20 19:32:30,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 97 transitions, 994 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-20 19:32:30,141 INFO L231 Difference]: Finished difference. Result has 94 places, 86 transitions, 829 flow [2024-06-20 19:32:30,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=829, PETRI_PLACES=94, PETRI_TRANSITIONS=86} [2024-06-20 19:32:30,142 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 63 predicate places. [2024-06-20 19:32:30,142 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 86 transitions, 829 flow [2024-06-20 19:32:30,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call 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:30,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:30,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:30,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-20 19:32:30,143 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:30,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:30,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1245531677, now seen corresponding path program 3 times [2024-06-20 19:32:30,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:30,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085445989] [2024-06-20 19:32:30,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:30,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:35,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:32:35,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:35,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085445989] [2024-06-20 19:32:35,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085445989] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:35,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:35,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:32:35,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510621526] [2024-06-20 19:32:35,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:35,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:32:35,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:35,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:32:35,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:32:35,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:32:35,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 86 transitions, 829 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:32:35,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:35,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:32:35,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:35,871 INFO L124 PetriNetUnfolderBase]: 213/416 cut-off events. [2024-06-20 19:32:35,872 INFO L125 PetriNetUnfolderBase]: For 5073/5073 co-relation queries the response was YES. [2024-06-20 19:32:35,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2252 conditions, 416 events. 213/416 cut-off events. For 5073/5073 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1815 event pairs, 42 based on Foata normal form. 2/415 useless extension candidates. Maximal degree in co-relation 2207. Up to 258 conditions per place. [2024-06-20 19:32:35,875 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 56 selfloop transitions, 36 changer transitions 0/96 dead transitions. [2024-06-20 19:32:35,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 96 transitions, 1078 flow [2024-06-20 19:32:35,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:32:35,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:32:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2024-06-20 19:32:35,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44921875 [2024-06-20 19:32:35,885 INFO L175 Difference]: Start difference. First operand has 94 places, 86 transitions, 829 flow. Second operand 8 states and 115 transitions. [2024-06-20 19:32:35,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 96 transitions, 1078 flow [2024-06-20 19:32:35,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 96 transitions, 988 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-20 19:32:35,892 INFO L231 Difference]: Finished difference. Result has 94 places, 86 transitions, 820 flow [2024-06-20 19:32:35,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=820, PETRI_PLACES=94, PETRI_TRANSITIONS=86} [2024-06-20 19:32:35,892 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 63 predicate places. [2024-06-20 19:32:35,892 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 86 transitions, 820 flow [2024-06-20 19:32:35,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:32:35,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:35,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:32:35,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-20 19:32:35,893 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:35,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:35,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1235996573, now seen corresponding path program 1 times [2024-06-20 19:32:35,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:35,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751667983] [2024-06-20 19:32:35,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:35,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:42,245 INFO L134 CoverageAnalysis]: 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:42,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:42,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751667983] [2024-06-20 19:32:42,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751667983] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:42,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:42,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:32:42,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967293607] [2024-06-20 19:32:42,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:42,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:32:42,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:42,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:32:42,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:32:42,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:32:42,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 86 transitions, 820 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call 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:42,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:42,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:32:42,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:42,735 INFO L124 PetriNetUnfolderBase]: 229/452 cut-off events. [2024-06-20 19:32:42,735 INFO L125 PetriNetUnfolderBase]: For 7035/7035 co-relation queries the response was YES. [2024-06-20 19:32:42,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2333 conditions, 452 events. 229/452 cut-off events. For 7035/7035 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2010 event pairs, 46 based on Foata normal form. 13/462 useless extension candidates. Maximal degree in co-relation 2287. Up to 241 conditions per place. [2024-06-20 19:32:42,738 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 50 selfloop transitions, 44 changer transitions 6/104 dead transitions. [2024-06-20 19:32:42,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 104 transitions, 1124 flow [2024-06-20 19:32:42,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:32:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:32:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2024-06-20 19:32:42,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.446875 [2024-06-20 19:32:42,740 INFO L175 Difference]: Start difference. First operand has 94 places, 86 transitions, 820 flow. Second operand 10 states and 143 transitions. [2024-06-20 19:32:42,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 104 transitions, 1124 flow [2024-06-20 19:32:42,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 104 transitions, 1015 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-20 19:32:42,746 INFO L231 Difference]: Finished difference. Result has 98 places, 86 transitions, 815 flow [2024-06-20 19:32:42,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=815, PETRI_PLACES=98, PETRI_TRANSITIONS=86} [2024-06-20 19:32:42,747 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 67 predicate places. [2024-06-20 19:32:42,747 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 86 transitions, 815 flow [2024-06-20 19:32:42,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call 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:42,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:42,747 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:32:42,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-20 19:32:42,748 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:42,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:42,748 INFO L85 PathProgramCache]: Analyzing trace with hash -842056017, now seen corresponding path program 1 times [2024-06-20 19:32:42,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:42,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674626193] [2024-06-20 19:32:42,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:42,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:48,525 INFO L134 CoverageAnalysis]: 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:48,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:48,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674626193] [2024-06-20 19:32:48,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674626193] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:48,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:48,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:32:48,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266220675] [2024-06-20 19:32:48,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:48,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:32:48,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:48,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:32:48,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:32:48,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-06-20 19:32:48,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 86 transitions, 815 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:32:48,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:48,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-06-20 19:32:48,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:48,880 INFO L124 PetriNetUnfolderBase]: 216/429 cut-off events. [2024-06-20 19:32:48,880 INFO L125 PetriNetUnfolderBase]: For 5962/5962 co-relation queries the response was YES. [2024-06-20 19:32:48,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2352 conditions, 429 events. 216/429 cut-off events. For 5962/5962 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1910 event pairs, 17 based on Foata normal form. 2/430 useless extension candidates. Maximal degree in co-relation 2305. Up to 335 conditions per place. [2024-06-20 19:32:48,884 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 86 selfloop transitions, 11 changer transitions 0/102 dead transitions. [2024-06-20 19:32:48,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 102 transitions, 1057 flow [2024-06-20 19:32:48,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:32:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:32:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-20 19:32:48,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-20 19:32:48,885 INFO L175 Difference]: Start difference. First operand has 98 places, 86 transitions, 815 flow. Second operand 7 states and 112 transitions. [2024-06-20 19:32:48,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 102 transitions, 1057 flow [2024-06-20 19:32:48,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 102 transitions, 952 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-20 19:32:48,892 INFO L231 Difference]: Finished difference. Result has 96 places, 87 transitions, 746 flow [2024-06-20 19:32:48,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=746, PETRI_PLACES=96, PETRI_TRANSITIONS=87} [2024-06-20 19:32:48,893 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 65 predicate places. [2024-06-20 19:32:48,893 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 87 transitions, 746 flow [2024-06-20 19:32:48,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:32:48,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:48,893 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:32:48,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-20 19:32:48,893 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:48,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:48,894 INFO L85 PathProgramCache]: Analyzing trace with hash 412385567, now seen corresponding path program 2 times [2024-06-20 19:32:48,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:48,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348335410] [2024-06-20 19:32:48,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:48,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:32:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:32:54,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:32:54,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348335410] [2024-06-20 19:32:54,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348335410] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:32:54,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:32:54,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:32:54,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901380341] [2024-06-20 19:32:54,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:32:54,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:32:54,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:32:54,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:32:54,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:32:54,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:32:54,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 87 transitions, 746 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call 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:54,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:32:54,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:32:54,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:32:54,548 INFO L124 PetriNetUnfolderBase]: 220/443 cut-off events. [2024-06-20 19:32:54,548 INFO L125 PetriNetUnfolderBase]: For 6291/6291 co-relation queries the response was YES. [2024-06-20 19:32:54,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2316 conditions, 443 events. 220/443 cut-off events. For 6291/6291 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2004 event pairs, 38 based on Foata normal form. 2/444 useless extension candidates. Maximal degree in co-relation 2269. Up to 360 conditions per place. [2024-06-20 19:32:54,551 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 85 selfloop transitions, 13 changer transitions 0/102 dead transitions. [2024-06-20 19:32:54,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 102 transitions, 990 flow [2024-06-20 19:32:54,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:32:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:32:54,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-20 19:32:54,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-20 19:32:54,554 INFO L175 Difference]: Start difference. First operand has 96 places, 87 transitions, 746 flow. Second operand 8 states and 108 transitions. [2024-06-20 19:32:54,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 102 transitions, 990 flow [2024-06-20 19:32:54,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 102 transitions, 943 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-20 19:32:54,560 INFO L231 Difference]: Finished difference. Result has 97 places, 88 transitions, 741 flow [2024-06-20 19:32:54,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=741, PETRI_PLACES=97, PETRI_TRANSITIONS=88} [2024-06-20 19:32:54,561 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 66 predicate places. [2024-06-20 19:32:54,561 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 88 transitions, 741 flow [2024-06-20 19:32:54,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call 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:54,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:32:54,563 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:32:54,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-20 19:32:54,563 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:54,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:32:54,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1227583501, now seen corresponding path program 1 times [2024-06-20 19:32:54,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:32:54,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907201936] [2024-06-20 19:32:54,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:32:54,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:32:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:00,145 INFO L134 CoverageAnalysis]: 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:00,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:00,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907201936] [2024-06-20 19:33:00,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907201936] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:00,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:00,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:33:00,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309015655] [2024-06-20 19:33:00,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:00,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:33:00,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:00,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:33:00,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:33:00,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:33:00,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 88 transitions, 741 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:33:00,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:00,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:33:00,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:00,524 INFO L124 PetriNetUnfolderBase]: 218/435 cut-off events. [2024-06-20 19:33:00,524 INFO L125 PetriNetUnfolderBase]: For 5518/5518 co-relation queries the response was YES. [2024-06-20 19:33:00,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2227 conditions, 435 events. 218/435 cut-off events. For 5518/5518 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1965 event pairs, 44 based on Foata normal form. 1/432 useless extension candidates. Maximal degree in co-relation 2180. Up to 285 conditions per place. [2024-06-20 19:33:00,528 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 57 selfloop transitions, 37 changer transitions 0/98 dead transitions. [2024-06-20 19:33:00,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 98 transitions, 1007 flow [2024-06-20 19:33:00,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:33:00,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:33:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2024-06-20 19:33:00,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2024-06-20 19:33:00,548 INFO L175 Difference]: Start difference. First operand has 97 places, 88 transitions, 741 flow. Second operand 7 states and 102 transitions. [2024-06-20 19:33:00,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 98 transitions, 1007 flow [2024-06-20 19:33:00,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 98 transitions, 975 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-20 19:33:00,556 INFO L231 Difference]: Finished difference. Result has 98 places, 90 transitions, 816 flow [2024-06-20 19:33:00,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=816, PETRI_PLACES=98, PETRI_TRANSITIONS=90} [2024-06-20 19:33:00,556 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 67 predicate places. [2024-06-20 19:33:00,557 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 90 transitions, 816 flow [2024-06-20 19:33:00,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:33:00,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:00,557 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:33:00,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-20 19:33:00,557 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:33:00,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:00,558 INFO L85 PathProgramCache]: Analyzing trace with hash 186433745, now seen corresponding path program 3 times [2024-06-20 19:33:00,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:00,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798974092] [2024-06-20 19:33:00,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:00,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:05,986 INFO L134 CoverageAnalysis]: 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:05,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:05,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798974092] [2024-06-20 19:33:05,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798974092] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:05,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:05,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:33:05,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310414129] [2024-06-20 19:33:05,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:05,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:33:05,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:05,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:33:05,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:33:06,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:33:06,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 90 transitions, 816 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call 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:06,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:06,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:33:06,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:06,324 INFO L124 PetriNetUnfolderBase]: 222/442 cut-off events. [2024-06-20 19:33:06,325 INFO L125 PetriNetUnfolderBase]: For 6258/6258 co-relation queries the response was YES. [2024-06-20 19:33:06,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2350 conditions, 442 events. 222/442 cut-off events. For 6258/6258 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1996 event pairs, 36 based on Foata normal form. 2/443 useless extension candidates. Maximal degree in co-relation 2302. Up to 366 conditions per place. [2024-06-20 19:33:06,328 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 82 selfloop transitions, 16 changer transitions 0/102 dead transitions. [2024-06-20 19:33:06,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 102 transitions, 1052 flow [2024-06-20 19:33:06,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:33:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:33:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-20 19:33:06,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-20 19:33:06,330 INFO L175 Difference]: Start difference. First operand has 98 places, 90 transitions, 816 flow. Second operand 8 states and 105 transitions. [2024-06-20 19:33:06,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 102 transitions, 1052 flow [2024-06-20 19:33:06,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 102 transitions, 971 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-20 19:33:06,337 INFO L231 Difference]: Finished difference. Result has 100 places, 91 transitions, 786 flow [2024-06-20 19:33:06,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=786, PETRI_PLACES=100, PETRI_TRANSITIONS=91} [2024-06-20 19:33:06,338 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 69 predicate places. [2024-06-20 19:33:06,338 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 786 flow [2024-06-20 19:33:06,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call 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:06,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:06,338 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:33:06,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-20 19:33:06,338 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:06,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:06,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1047624383, now seen corresponding path program 4 times [2024-06-20 19:33:06,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:06,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6870622] [2024-06-20 19:33:06,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:06,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:33:12,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:12,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6870622] [2024-06-20 19:33:12,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6870622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:12,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:12,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:33:12,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402031703] [2024-06-20 19:33:12,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:12,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:33:12,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:12,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:33:12,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:33:12,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:33:12,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 786 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call 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:12,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:12,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:33:12,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:13,217 INFO L124 PetriNetUnfolderBase]: 223/445 cut-off events. [2024-06-20 19:33:13,217 INFO L125 PetriNetUnfolderBase]: For 6247/6247 co-relation queries the response was YES. [2024-06-20 19:33:13,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2268 conditions, 445 events. 223/445 cut-off events. For 6247/6247 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2011 event pairs, 38 based on Foata normal form. 4/446 useless extension candidates. Maximal degree in co-relation 2220. Up to 331 conditions per place. [2024-06-20 19:33:13,220 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 76 selfloop transitions, 22 changer transitions 0/102 dead transitions. [2024-06-20 19:33:13,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 102 transitions, 1018 flow [2024-06-20 19:33:13,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:33:13,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:33:13,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-20 19:33:13,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42578125 [2024-06-20 19:33:13,222 INFO L175 Difference]: Start difference. First operand has 100 places, 91 transitions, 786 flow. Second operand 8 states and 109 transitions. [2024-06-20 19:33:13,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 102 transitions, 1018 flow [2024-06-20 19:33:13,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 102 transitions, 966 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-20 19:33:13,230 INFO L231 Difference]: Finished difference. Result has 103 places, 93 transitions, 806 flow [2024-06-20 19:33:13,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=806, PETRI_PLACES=103, PETRI_TRANSITIONS=93} [2024-06-20 19:33:13,230 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 72 predicate places. [2024-06-20 19:33:13,230 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 93 transitions, 806 flow [2024-06-20 19:33:13,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call 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:13,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:13,232 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:33:13,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-20 19:33:13,232 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:13,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:13,232 INFO L85 PathProgramCache]: Analyzing trace with hash 42978525, now seen corresponding path program 2 times [2024-06-20 19:33:13,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:13,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834952988] [2024-06-20 19:33:13,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:13,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:33:19,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:19,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834952988] [2024-06-20 19:33:19,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834952988] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:19,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:19,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:33:19,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471643750] [2024-06-20 19:33:19,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:19,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:33:19,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:19,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:33:19,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:33:19,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:33:19,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 93 transitions, 806 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:33:19,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:19,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:33:19,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:19,461 INFO L124 PetriNetUnfolderBase]: 226/450 cut-off events. [2024-06-20 19:33:19,461 INFO L125 PetriNetUnfolderBase]: For 5960/5960 co-relation queries the response was YES. [2024-06-20 19:33:19,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2327 conditions, 450 events. 226/450 cut-off events. For 5960/5960 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2036 event pairs, 38 based on Foata normal form. 1/448 useless extension candidates. Maximal degree in co-relation 2277. Up to 321 conditions per place. [2024-06-20 19:33:19,466 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 69 selfloop transitions, 31 changer transitions 0/104 dead transitions. [2024-06-20 19:33:19,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 104 transitions, 1087 flow [2024-06-20 19:33:19,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:33:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:33:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2024-06-20 19:33:19,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-20 19:33:19,469 INFO L175 Difference]: Start difference. First operand has 103 places, 93 transitions, 806 flow. Second operand 8 states and 112 transitions. [2024-06-20 19:33:19,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 104 transitions, 1087 flow [2024-06-20 19:33:19,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 104 transitions, 1012 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-20 19:33:19,480 INFO L231 Difference]: Finished difference. Result has 105 places, 95 transitions, 813 flow [2024-06-20 19:33:19,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=813, PETRI_PLACES=105, PETRI_TRANSITIONS=95} [2024-06-20 19:33:19,480 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 74 predicate places. [2024-06-20 19:33:19,481 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 95 transitions, 813 flow [2024-06-20 19:33:19,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:33:19,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:19,481 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:33:19,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-20 19:33:19,481 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:19,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:19,482 INFO L85 PathProgramCache]: Analyzing trace with hash 43215675, now seen corresponding path program 3 times [2024-06-20 19:33:19,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:19,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408119] [2024-06-20 19:33:19,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:19,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:25,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:33:25,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:25,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408119] [2024-06-20 19:33:25,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408119] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:25,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:25,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:33:25,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009816134] [2024-06-20 19:33:25,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:25,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:33:25,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:25,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:33:25,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:33:25,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:33:25,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 95 transitions, 813 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:33:25,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:25,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:33:25,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:25,684 INFO L124 PetriNetUnfolderBase]: 223/445 cut-off events. [2024-06-20 19:33:25,684 INFO L125 PetriNetUnfolderBase]: For 6086/6086 co-relation queries the response was YES. [2024-06-20 19:33:25,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2267 conditions, 445 events. 223/445 cut-off events. For 6086/6086 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2014 event pairs, 38 based on Foata normal form. 1/443 useless extension candidates. Maximal degree in co-relation 2217. Up to 317 conditions per place. [2024-06-20 19:33:25,687 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 69 selfloop transitions, 30 changer transitions 0/103 dead transitions. [2024-06-20 19:33:25,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 103 transitions, 1031 flow [2024-06-20 19:33:25,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:33:25,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:33:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2024-06-20 19:33:25,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43359375 [2024-06-20 19:33:25,701 INFO L175 Difference]: Start difference. First operand has 105 places, 95 transitions, 813 flow. Second operand 8 states and 111 transitions. [2024-06-20 19:33:25,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 103 transitions, 1031 flow [2024-06-20 19:33:25,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 103 transitions, 964 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-20 19:33:25,710 INFO L231 Difference]: Finished difference. Result has 107 places, 95 transitions, 811 flow [2024-06-20 19:33:25,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=811, PETRI_PLACES=107, PETRI_TRANSITIONS=95} [2024-06-20 19:33:25,711 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 76 predicate places. [2024-06-20 19:33:25,711 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 95 transitions, 811 flow [2024-06-20 19:33:25,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:33:25,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:25,711 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:33:25,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-20 19:33:25,712 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:25,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:25,713 INFO L85 PathProgramCache]: Analyzing trace with hash 43224603, now seen corresponding path program 1 times [2024-06-20 19:33:25,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:25,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692658437] [2024-06-20 19:33:25,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:25,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:32,309 INFO L134 CoverageAnalysis]: 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,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:32,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692658437] [2024-06-20 19:33:32,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692658437] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:32,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:32,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:33:32,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291337342] [2024-06-20 19:33:32,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:32,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:33:32,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:32,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:33:32,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:33:32,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:33:32,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 95 transitions, 811 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:33:32,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:32,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:33:32,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:32,706 INFO L124 PetriNetUnfolderBase]: 229/461 cut-off events. [2024-06-20 19:33:32,706 INFO L125 PetriNetUnfolderBase]: For 6845/6845 co-relation queries the response was YES. [2024-06-20 19:33:32,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2324 conditions, 461 events. 229/461 cut-off events. For 6845/6845 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2107 event pairs, 39 based on Foata normal form. 2/460 useless extension candidates. Maximal degree in co-relation 2274. Up to 286 conditions per place. [2024-06-20 19:33:32,710 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 64 selfloop transitions, 40 changer transitions 0/108 dead transitions. [2024-06-20 19:33:32,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 108 transitions, 1076 flow [2024-06-20 19:33:32,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:33:32,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:33:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2024-06-20 19:33:32,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-20 19:33:32,712 INFO L175 Difference]: Start difference. First operand has 107 places, 95 transitions, 811 flow. Second operand 9 states and 126 transitions. [2024-06-20 19:33:32,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 108 transitions, 1076 flow [2024-06-20 19:33:32,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 108 transitions, 1012 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-20 19:33:32,721 INFO L231 Difference]: Finished difference. Result has 109 places, 98 transitions, 868 flow [2024-06-20 19:33:32,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=868, PETRI_PLACES=109, PETRI_TRANSITIONS=98} [2024-06-20 19:33:32,722 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 78 predicate places. [2024-06-20 19:33:32,722 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 98 transitions, 868 flow [2024-06-20 19:33:32,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:33:32,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:32,722 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:33:32,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-20 19:33:32,723 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:32,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:32,723 INFO L85 PathProgramCache]: Analyzing trace with hash 338799993, now seen corresponding path program 2 times [2024-06-20 19:33:32,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:32,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221999578] [2024-06-20 19:33:32,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:32,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:39,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:33:39,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:39,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221999578] [2024-06-20 19:33:39,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221999578] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:39,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:39,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:33:39,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877910864] [2024-06-20 19:33:39,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:39,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:33:39,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:39,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:33:39,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:33:39,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:33:39,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 98 transitions, 868 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call 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:39,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:39,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:33:39,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:39,554 INFO L124 PetriNetUnfolderBase]: 235/465 cut-off events. [2024-06-20 19:33:39,555 INFO L125 PetriNetUnfolderBase]: For 7434/7434 co-relation queries the response was YES. [2024-06-20 19:33:39,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 465 events. 235/465 cut-off events. For 7434/7434 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2105 event pairs, 38 based on Foata normal form. 2/464 useless extension candidates. Maximal degree in co-relation 2400. Up to 288 conditions per place. [2024-06-20 19:33:39,558 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 63 selfloop transitions, 46 changer transitions 0/113 dead transitions. [2024-06-20 19:33:39,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 113 transitions, 1153 flow [2024-06-20 19:33:39,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:33:39,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:33:39,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 150 transitions. [2024-06-20 19:33:39,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42613636363636365 [2024-06-20 19:33:39,561 INFO L175 Difference]: Start difference. First operand has 109 places, 98 transitions, 868 flow. Second operand 11 states and 150 transitions. [2024-06-20 19:33:39,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 113 transitions, 1153 flow [2024-06-20 19:33:39,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 1056 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-20 19:33:39,571 INFO L231 Difference]: Finished difference. Result has 113 places, 101 transitions, 911 flow [2024-06-20 19:33:39,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=911, PETRI_PLACES=113, PETRI_TRANSITIONS=101} [2024-06-20 19:33:39,571 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 82 predicate places. [2024-06-20 19:33:39,572 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 101 transitions, 911 flow [2024-06-20 19:33:39,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call 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:39,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:39,572 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:33:39,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-20 19:33:39,572 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:39,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:39,573 INFO L85 PathProgramCache]: Analyzing trace with hash 328324473, now seen corresponding path program 3 times [2024-06-20 19:33:39,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:39,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071779667] [2024-06-20 19:33:39,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:39,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:46,750 INFO L134 CoverageAnalysis]: 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:46,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:46,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071779667] [2024-06-20 19:33:46,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071779667] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:46,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:46,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:33:46,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233869004] [2024-06-20 19:33:46,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:46,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:33:46,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:46,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:33:46,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:33:46,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:33:46,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 101 transitions, 911 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call 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:46,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:46,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:33:46,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:47,285 INFO L124 PetriNetUnfolderBase]: 236/467 cut-off events. [2024-06-20 19:33:47,285 INFO L125 PetriNetUnfolderBase]: For 7720/7720 co-relation queries the response was YES. [2024-06-20 19:33:47,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2504 conditions, 467 events. 236/467 cut-off events. For 7720/7720 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2126 event pairs, 37 based on Foata normal form. 2/466 useless extension candidates. Maximal degree in co-relation 2452. Up to 298 conditions per place. [2024-06-20 19:33:47,288 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 69 selfloop transitions, 43 changer transitions 0/116 dead transitions. [2024-06-20 19:33:47,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 116 transitions, 1213 flow [2024-06-20 19:33:47,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:33:47,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:33:47,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2024-06-20 19:33:47,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.434375 [2024-06-20 19:33:47,290 INFO L175 Difference]: Start difference. First operand has 113 places, 101 transitions, 911 flow. Second operand 10 states and 139 transitions. [2024-06-20 19:33:47,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 116 transitions, 1213 flow [2024-06-20 19:33:47,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 116 transitions, 1099 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-20 19:33:47,302 INFO L231 Difference]: Finished difference. Result has 114 places, 104 transitions, 936 flow [2024-06-20 19:33:47,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=936, PETRI_PLACES=114, PETRI_TRANSITIONS=104} [2024-06-20 19:33:47,302 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 83 predicate places. [2024-06-20 19:33:47,303 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 104 transitions, 936 flow [2024-06-20 19:33:47,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call 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:47,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:47,303 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:33:47,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-20 19:33:47,303 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:47,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:47,304 INFO L85 PathProgramCache]: Analyzing trace with hash -333931918, now seen corresponding path program 1 times [2024-06-20 19:33:47,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:47,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732439382] [2024-06-20 19:33:47,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:47,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:52,549 INFO L134 CoverageAnalysis]: 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:52,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:52,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732439382] [2024-06-20 19:33:52,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732439382] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:52,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:52,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:33:52,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132627417] [2024-06-20 19:33:52,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:52,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:33:52,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:52,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:33:52,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:33:52,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:33:52,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 104 transitions, 936 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:33:52,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:52,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:33:52,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:33:52,969 INFO L124 PetriNetUnfolderBase]: 240/474 cut-off events. [2024-06-20 19:33:52,969 INFO L125 PetriNetUnfolderBase]: For 8355/8355 co-relation queries the response was YES. [2024-06-20 19:33:52,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2549 conditions, 474 events. 240/474 cut-off events. For 8355/8355 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2183 event pairs, 20 based on Foata normal form. 2/472 useless extension candidates. Maximal degree in co-relation 2496. Up to 373 conditions per place. [2024-06-20 19:33:52,973 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 101 selfloop transitions, 10 changer transitions 0/115 dead transitions. [2024-06-20 19:33:52,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 115 transitions, 1190 flow [2024-06-20 19:33:52,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:33:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:33:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-20 19:33:52,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2024-06-20 19:33:52,975 INFO L175 Difference]: Start difference. First operand has 114 places, 104 transitions, 936 flow. Second operand 7 states and 92 transitions. [2024-06-20 19:33:52,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 115 transitions, 1190 flow [2024-06-20 19:33:52,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 115 transitions, 1075 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-20 19:33:52,987 INFO L231 Difference]: Finished difference. Result has 113 places, 105 transitions, 855 flow [2024-06-20 19:33:52,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=855, PETRI_PLACES=113, PETRI_TRANSITIONS=105} [2024-06-20 19:33:52,988 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 82 predicate places. [2024-06-20 19:33:52,988 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 105 transitions, 855 flow [2024-06-20 19:33:52,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:33:52,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:33:52,988 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:33:52,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-20 19:33:52,989 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:52,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:33:52,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1025886646, now seen corresponding path program 2 times [2024-06-20 19:33:52,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:33:52,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643175452] [2024-06-20 19:33:52,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:33:52,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:33:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:33:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:33:59,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:33:59,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643175452] [2024-06-20 19:33:59,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643175452] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:33:59,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:33:59,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:33:59,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978917416] [2024-06-20 19:33:59,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:33:59,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:33:59,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:33:59,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:33:59,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:33:59,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:33:59,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 105 transitions, 855 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:33:59,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:33:59,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:33:59,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:00,228 INFO L124 PetriNetUnfolderBase]: 244/482 cut-off events. [2024-06-20 19:34:00,229 INFO L125 PetriNetUnfolderBase]: For 8622/8622 co-relation queries the response was YES. [2024-06-20 19:34:00,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2505 conditions, 482 events. 244/482 cut-off events. For 8622/8622 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2233 event pairs, 41 based on Foata normal form. 2/480 useless extension candidates. Maximal degree in co-relation 2451. Up to 355 conditions per place. [2024-06-20 19:34:00,231 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 82 selfloop transitions, 28 changer transitions 0/114 dead transitions. [2024-06-20 19:34:00,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 114 transitions, 1105 flow [2024-06-20 19:34:00,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:34:00,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:34:00,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-06-20 19:34:00,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-20 19:34:00,233 INFO L175 Difference]: Start difference. First operand has 113 places, 105 transitions, 855 flow. Second operand 7 states and 98 transitions. [2024-06-20 19:34:00,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 114 transitions, 1105 flow [2024-06-20 19:34:00,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 114 transitions, 1081 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-20 19:34:00,245 INFO L231 Difference]: Finished difference. Result has 115 places, 106 transitions, 904 flow [2024-06-20 19:34:00,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=904, PETRI_PLACES=115, PETRI_TRANSITIONS=106} [2024-06-20 19:34:00,246 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 84 predicate places. [2024-06-20 19:34:00,247 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 904 flow [2024-06-20 19:34:00,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:34:00,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:00,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:34:00,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-20 19:34:00,248 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:34:00,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:00,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1638450392, now seen corresponding path program 3 times [2024-06-20 19:34:00,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:00,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735660728] [2024-06-20 19:34:00,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:00,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:05,997 INFO L134 CoverageAnalysis]: 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:05,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:05,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735660728] [2024-06-20 19:34:05,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735660728] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:05,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:05,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:34:05,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078773781] [2024-06-20 19:34:05,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:05,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:34:05,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:05,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:34:05,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:34:06,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:34:06,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 904 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:34:06,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:06,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:34:06,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:06,400 INFO L124 PetriNetUnfolderBase]: 252/498 cut-off events. [2024-06-20 19:34:06,400 INFO L125 PetriNetUnfolderBase]: For 9358/9358 co-relation queries the response was YES. [2024-06-20 19:34:06,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2638 conditions, 498 events. 252/498 cut-off events. For 9358/9358 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2353 event pairs, 41 based on Foata normal form. 2/496 useless extension candidates. Maximal degree in co-relation 2583. Up to 380 conditions per place. [2024-06-20 19:34:06,403 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 95 selfloop transitions, 18 changer transitions 0/117 dead transitions. [2024-06-20 19:34:06,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 1177 flow [2024-06-20 19:34:06,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:34:06,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:34:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-06-20 19:34:06,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4330357142857143 [2024-06-20 19:34:06,404 INFO L175 Difference]: Start difference. First operand has 115 places, 106 transitions, 904 flow. Second operand 7 states and 97 transitions. [2024-06-20 19:34:06,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 1177 flow [2024-06-20 19:34:06,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 117 transitions, 1107 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-20 19:34:06,417 INFO L231 Difference]: Finished difference. Result has 118 places, 108 transitions, 907 flow [2024-06-20 19:34:06,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=907, PETRI_PLACES=118, PETRI_TRANSITIONS=108} [2024-06-20 19:34:06,417 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 87 predicate places. [2024-06-20 19:34:06,418 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 108 transitions, 907 flow [2024-06-20 19:34:06,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:34:06,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:06,418 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:34:06,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-20 19:34:06,418 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:34:06,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:06,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1638296570, now seen corresponding path program 1 times [2024-06-20 19:34:06,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:06,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655345337] [2024-06-20 19:34:06,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:06,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:12,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:34:12,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:12,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655345337] [2024-06-20 19:34:12,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655345337] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:12,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:12,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:34:12,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018753715] [2024-06-20 19:34:12,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:12,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:34:12,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:12,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:34:12,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:34:12,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:34:12,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 108 transitions, 907 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:34:12,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:12,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:34:12,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:12,958 INFO L124 PetriNetUnfolderBase]: 253/502 cut-off events. [2024-06-20 19:34:12,958 INFO L125 PetriNetUnfolderBase]: For 9516/9516 co-relation queries the response was YES. [2024-06-20 19:34:12,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2627 conditions, 502 events. 253/502 cut-off events. For 9516/9516 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2365 event pairs, 41 based on Foata normal form. 2/500 useless extension candidates. Maximal degree in co-relation 2570. Up to 349 conditions per place. [2024-06-20 19:34:12,961 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 77 selfloop transitions, 41 changer transitions 0/122 dead transitions. [2024-06-20 19:34:12,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 122 transitions, 1211 flow [2024-06-20 19:34:12,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:34:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:34:12,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2024-06-20 19:34:12,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45703125 [2024-06-20 19:34:12,972 INFO L175 Difference]: Start difference. First operand has 118 places, 108 transitions, 907 flow. Second operand 8 states and 117 transitions. [2024-06-20 19:34:12,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 122 transitions, 1211 flow [2024-06-20 19:34:12,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 122 transitions, 1183 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-20 19:34:12,987 INFO L231 Difference]: Finished difference. Result has 124 places, 113 transitions, 1051 flow [2024-06-20 19:34:12,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1051, PETRI_PLACES=124, PETRI_TRANSITIONS=113} [2024-06-20 19:34:12,988 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 93 predicate places. [2024-06-20 19:34:12,988 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 113 transitions, 1051 flow [2024-06-20 19:34:12,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:34:12,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:12,988 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:34:12,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-20 19:34:12,989 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:12,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:12,989 INFO L85 PathProgramCache]: Analyzing trace with hash -126461326, now seen corresponding path program 4 times [2024-06-20 19:34:12,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:12,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737028785] [2024-06-20 19:34:12,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:12,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:19,084 INFO L134 CoverageAnalysis]: 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,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:19,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737028785] [2024-06-20 19:34:19,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737028785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:19,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:19,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:34:19,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107428322] [2024-06-20 19:34:19,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:19,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:34:19,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:19,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:34:19,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:34:19,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:34:19,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 113 transitions, 1051 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:34:19,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:19,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:34:19,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:19,443 INFO L124 PetriNetUnfolderBase]: 250/500 cut-off events. [2024-06-20 19:34:19,443 INFO L125 PetriNetUnfolderBase]: For 9202/9202 co-relation queries the response was YES. [2024-06-20 19:34:19,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2695 conditions, 500 events. 250/500 cut-off events. For 9202/9202 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2336 event pairs, 34 based on Foata normal form. 2/499 useless extension candidates. Maximal degree in co-relation 2636. Up to 356 conditions per place. [2024-06-20 19:34:19,446 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 96 selfloop transitions, 23 changer transitions 0/123 dead transitions. [2024-06-20 19:34:19,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 123 transitions, 1313 flow [2024-06-20 19:34:19,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:34:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:34:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-20 19:34:19,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2024-06-20 19:34:19,452 INFO L175 Difference]: Start difference. First operand has 124 places, 113 transitions, 1051 flow. Second operand 8 states and 107 transitions. [2024-06-20 19:34:19,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 123 transitions, 1313 flow [2024-06-20 19:34:19,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 123 transitions, 1219 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-20 19:34:19,469 INFO L231 Difference]: Finished difference. Result has 126 places, 113 transitions, 1008 flow [2024-06-20 19:34:19,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1008, PETRI_PLACES=126, PETRI_TRANSITIONS=113} [2024-06-20 19:34:19,469 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 95 predicate places. [2024-06-20 19:34:19,469 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 113 transitions, 1008 flow [2024-06-20 19:34:19,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:34:19,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:19,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:34:19,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-20 19:34:19,470 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:19,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:19,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1588125028, now seen corresponding path program 1 times [2024-06-20 19:34:19,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:19,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086422716] [2024-06-20 19:34:19,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:19,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:26,262 INFO L134 CoverageAnalysis]: 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,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:26,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086422716] [2024-06-20 19:34:26,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086422716] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:26,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:26,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:34:26,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251326812] [2024-06-20 19:34:26,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:26,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:34:26,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:26,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:34:26,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:34:26,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:34:26,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 113 transitions, 1008 flow. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:26,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:34:26,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:26,801 INFO L124 PetriNetUnfolderBase]: 254/508 cut-off events. [2024-06-20 19:34:26,802 INFO L125 PetriNetUnfolderBase]: For 9341/9341 co-relation queries the response was YES. [2024-06-20 19:34:26,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2657 conditions, 508 events. 254/508 cut-off events. For 9341/9341 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2384 event pairs, 36 based on Foata normal form. 2/507 useless extension candidates. Maximal degree in co-relation 2597. Up to 387 conditions per place. [2024-06-20 19:34:26,806 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 91 selfloop transitions, 33 changer transitions 0/128 dead transitions. [2024-06-20 19:34:26,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 128 transitions, 1316 flow [2024-06-20 19:34:26,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:34:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:34:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-20 19:34:26,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-20 19:34:26,812 INFO L175 Difference]: Start difference. First operand has 126 places, 113 transitions, 1008 flow. Second operand 11 states and 144 transitions. [2024-06-20 19:34:26,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 128 transitions, 1316 flow [2024-06-20 19:34:26,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 128 transitions, 1263 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-20 19:34:26,831 INFO L231 Difference]: Finished difference. Result has 131 places, 116 transitions, 1059 flow [2024-06-20 19:34:26,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1059, PETRI_PLACES=131, PETRI_TRANSITIONS=116} [2024-06-20 19:34:26,831 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 100 predicate places. [2024-06-20 19:34:26,831 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 116 transitions, 1059 flow [2024-06-20 19:34:26,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:26,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:34:26,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-20 19:34:26,832 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:26,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:26,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1339963650, now seen corresponding path program 2 times [2024-06-20 19:34:26,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:26,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789769366] [2024-06-20 19:34:26,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:26,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:33,954 INFO L134 CoverageAnalysis]: 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,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:33,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789769366] [2024-06-20 19:34:33,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789769366] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:33,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:33,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:34:33,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743145636] [2024-06-20 19:34:33,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:33,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:34:33,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:33,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:34:33,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:34:34,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:34:34,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 116 transitions, 1059 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:34,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:34,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:34:34,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:34,329 INFO L124 PetriNetUnfolderBase]: 258/516 cut-off events. [2024-06-20 19:34:34,329 INFO L125 PetriNetUnfolderBase]: For 9963/9963 co-relation queries the response was YES. [2024-06-20 19:34:34,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2719 conditions, 516 events. 258/516 cut-off events. For 9963/9963 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2437 event pairs, 36 based on Foata normal form. 2/515 useless extension candidates. Maximal degree in co-relation 2660. Up to 395 conditions per place. [2024-06-20 19:34:34,332 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 93 selfloop transitions, 31 changer transitions 0/128 dead transitions. [2024-06-20 19:34:34,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 128 transitions, 1349 flow [2024-06-20 19:34:34,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:34:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:34:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-20 19:34:34,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-20 19:34:34,337 INFO L175 Difference]: Start difference. First operand has 131 places, 116 transitions, 1059 flow. Second operand 10 states and 132 transitions. [2024-06-20 19:34:34,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 128 transitions, 1349 flow [2024-06-20 19:34:34,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 128 transitions, 1269 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-20 19:34:34,357 INFO L231 Difference]: Finished difference. Result has 134 places, 117 transitions, 1063 flow [2024-06-20 19:34:34,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1063, PETRI_PLACES=134, PETRI_TRANSITIONS=117} [2024-06-20 19:34:34,358 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 103 predicate places. [2024-06-20 19:34:34,358 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 117 transitions, 1063 flow [2024-06-20 19:34:34,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:34,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:34,358 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:34:34,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-20 19:34:34,358 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:34,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:34,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1901824258, now seen corresponding path program 3 times [2024-06-20 19:34:34,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:34,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227909865] [2024-06-20 19:34:34,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:34,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:41,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:34:41,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:41,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227909865] [2024-06-20 19:34:41,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227909865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:41,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:41,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:34:41,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68227542] [2024-06-20 19:34:41,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:41,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:34:41,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:41,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:34:41,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:34:41,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:34:41,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 117 transitions, 1063 flow. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:41,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:41,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:34:41,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:42,373 INFO L124 PetriNetUnfolderBase]: 281/567 cut-off events. [2024-06-20 19:34:42,373 INFO L125 PetriNetUnfolderBase]: For 15957/15957 co-relation queries the response was YES. [2024-06-20 19:34:42,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2908 conditions, 567 events. 281/567 cut-off events. For 15957/15957 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2739 event pairs, 40 based on Foata normal form. 12/576 useless extension candidates. Maximal degree in co-relation 2849. Up to 344 conditions per place. [2024-06-20 19:34:42,377 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 82 selfloop transitions, 41 changer transitions 9/136 dead transitions. [2024-06-20 19:34:42,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 136 transitions, 1423 flow [2024-06-20 19:34:42,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:34:42,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:34:42,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 153 transitions. [2024-06-20 19:34:42,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4346590909090909 [2024-06-20 19:34:42,378 INFO L175 Difference]: Start difference. First operand has 134 places, 117 transitions, 1063 flow. Second operand 11 states and 153 transitions. [2024-06-20 19:34:42,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 136 transitions, 1423 flow [2024-06-20 19:34:42,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 136 transitions, 1340 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-20 19:34:42,398 INFO L231 Difference]: Finished difference. Result has 139 places, 115 transitions, 1072 flow [2024-06-20 19:34:42,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=980, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1072, PETRI_PLACES=139, PETRI_TRANSITIONS=115} [2024-06-20 19:34:42,399 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 108 predicate places. [2024-06-20 19:34:42,399 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 115 transitions, 1072 flow [2024-06-20 19:34:42,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:42,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:42,400 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:34:42,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-20 19:34:42,400 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:42,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:42,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1912866148, now seen corresponding path program 4 times [2024-06-20 19:34:42,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:42,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059981127] [2024-06-20 19:34:42,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:42,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:34:49,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:49,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059981127] [2024-06-20 19:34:49,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059981127] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:49,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:49,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:34:49,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654400830] [2024-06-20 19:34:49,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:49,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:34:49,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:49,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:34:49,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:34:49,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:34:49,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 115 transitions, 1072 flow. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:49,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:49,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:34:49,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:50,049 INFO L124 PetriNetUnfolderBase]: 261/527 cut-off events. [2024-06-20 19:34:50,049 INFO L125 PetriNetUnfolderBase]: For 11216/11216 co-relation queries the response was YES. [2024-06-20 19:34:50,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2803 conditions, 527 events. 261/527 cut-off events. For 11216/11216 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2515 event pairs, 38 based on Foata normal form. 2/526 useless extension candidates. Maximal degree in co-relation 2742. Up to 395 conditions per place. [2024-06-20 19:34:50,053 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 88 selfloop transitions, 37 changer transitions 0/129 dead transitions. [2024-06-20 19:34:50,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 129 transitions, 1372 flow [2024-06-20 19:34:50,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:34:50,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:34:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 154 transitions. [2024-06-20 19:34:50,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010416666666667 [2024-06-20 19:34:50,055 INFO L175 Difference]: Start difference. First operand has 139 places, 115 transitions, 1072 flow. Second operand 12 states and 154 transitions. [2024-06-20 19:34:50,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 129 transitions, 1372 flow [2024-06-20 19:34:50,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 129 transitions, 1239 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-20 19:34:50,076 INFO L231 Difference]: Finished difference. Result has 141 places, 116 transitions, 1039 flow [2024-06-20 19:34:50,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1039, PETRI_PLACES=141, PETRI_TRANSITIONS=116} [2024-06-20 19:34:50,077 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 110 predicate places. [2024-06-20 19:34:50,077 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 116 transitions, 1039 flow [2024-06-20 19:34:50,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:50,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:50,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:34:50,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-20 19:34:50,078 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:50,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:50,078 INFO L85 PathProgramCache]: Analyzing trace with hash -12781980, now seen corresponding path program 5 times [2024-06-20 19:34:50,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:50,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98806831] [2024-06-20 19:34:50,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:50,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:34:57,678 INFO L134 CoverageAnalysis]: 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:57,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:34:57,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98806831] [2024-06-20 19:34:57,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98806831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:34:57,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:34:57,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:34:57,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387383861] [2024-06-20 19:34:57,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:34:57,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:34:57,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:34:57,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:34:57,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:34:57,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:34:57,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 116 transitions, 1039 flow. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:57,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:34:57,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:34:57,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:34:58,374 INFO L124 PetriNetUnfolderBase]: 280/570 cut-off events. [2024-06-20 19:34:58,374 INFO L125 PetriNetUnfolderBase]: For 15142/15142 co-relation queries the response was YES. [2024-06-20 19:34:58,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3052 conditions, 570 events. 280/570 cut-off events. For 15142/15142 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2732 event pairs, 51 based on Foata normal form. 2/569 useless extension candidates. Maximal degree in co-relation 2991. Up to 310 conditions per place. [2024-06-20 19:34:58,387 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 81 selfloop transitions, 49 changer transitions 0/134 dead transitions. [2024-06-20 19:34:58,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 134 transitions, 1419 flow [2024-06-20 19:34:58,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:34:58,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:34:58,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 162 transitions. [2024-06-20 19:34:58,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-20 19:34:58,389 INFO L175 Difference]: Start difference. First operand has 141 places, 116 transitions, 1039 flow. Second operand 12 states and 162 transitions. [2024-06-20 19:34:58,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 134 transitions, 1419 flow [2024-06-20 19:34:58,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 134 transitions, 1319 flow, removed 11 selfloop flow, removed 11 redundant places. [2024-06-20 19:34:58,415 INFO L231 Difference]: Finished difference. Result has 142 places, 116 transitions, 1041 flow [2024-06-20 19:34:58,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1041, PETRI_PLACES=142, PETRI_TRANSITIONS=116} [2024-06-20 19:34:58,416 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 111 predicate places. [2024-06-20 19:34:58,416 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 116 transitions, 1041 flow [2024-06-20 19:34:58,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:58,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:34:58,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:34:58,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-20 19:34:58,417 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:58,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:34:58,417 INFO L85 PathProgramCache]: Analyzing trace with hash 131449478, now seen corresponding path program 1 times [2024-06-20 19:34:58,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:34:58,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013317670] [2024-06-20 19:34:58,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:34:58,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:34:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:05,531 INFO L134 CoverageAnalysis]: 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,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:05,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013317670] [2024-06-20 19:35:05,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013317670] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:05,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:05,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:35:05,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815547148] [2024-06-20 19:35:05,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:05,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:35:05,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:05,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:35:05,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:35:05,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:35:05,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 116 transitions, 1041 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:05,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:05,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:35:05,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:05,945 INFO L124 PetriNetUnfolderBase]: 284/575 cut-off events. [2024-06-20 19:35:05,946 INFO L125 PetriNetUnfolderBase]: For 15927/15927 co-relation queries the response was YES. [2024-06-20 19:35:05,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3084 conditions, 575 events. 284/575 cut-off events. For 15927/15927 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2775 event pairs, 39 based on Foata normal form. 2/573 useless extension candidates. Maximal degree in co-relation 3023. Up to 460 conditions per place. [2024-06-20 19:35:05,950 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 114 selfloop transitions, 11 changer transitions 0/129 dead transitions. [2024-06-20 19:35:05,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 129 transitions, 1325 flow [2024-06-20 19:35:05,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:35:05,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:35:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-20 19:35:05,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40234375 [2024-06-20 19:35:05,953 INFO L175 Difference]: Start difference. First operand has 142 places, 116 transitions, 1041 flow. Second operand 8 states and 103 transitions. [2024-06-20 19:35:05,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 129 transitions, 1325 flow [2024-06-20 19:35:05,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 129 transitions, 1191 flow, removed 10 selfloop flow, removed 11 redundant places. [2024-06-20 19:35:05,978 INFO L231 Difference]: Finished difference. Result has 139 places, 117 transitions, 941 flow [2024-06-20 19:35:05,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=941, PETRI_PLACES=139, PETRI_TRANSITIONS=117} [2024-06-20 19:35:05,978 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 108 predicate places. [2024-06-20 19:35:05,979 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 117 transitions, 941 flow [2024-06-20 19:35:05,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:05,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:05,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:05,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-20 19:35:05,980 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:35:05,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:05,980 INFO L85 PathProgramCache]: Analyzing trace with hash 747761584, now seen corresponding path program 2 times [2024-06-20 19:35:05,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:05,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255659288] [2024-06-20 19:35:05,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:05,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:12,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:35:12,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:12,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255659288] [2024-06-20 19:35:12,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255659288] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:12,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:12,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:35:12,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834274469] [2024-06-20 19:35:12,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:12,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:35:12,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:12,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:35:12,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:35:12,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:35:12,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 117 transitions, 941 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:12,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:12,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:35:12,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:12,934 INFO L124 PetriNetUnfolderBase]: 273/550 cut-off events. [2024-06-20 19:35:12,935 INFO L125 PetriNetUnfolderBase]: For 12351/12351 co-relation queries the response was YES. [2024-06-20 19:35:12,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2674 conditions, 550 events. 273/550 cut-off events. For 12351/12351 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2684 event pairs, 42 based on Foata normal form. 2/548 useless extension candidates. Maximal degree in co-relation 2613. Up to 408 conditions per place. [2024-06-20 19:35:12,938 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 96 selfloop transitions, 30 changer transitions 0/130 dead transitions. [2024-06-20 19:35:12,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 130 transitions, 1309 flow [2024-06-20 19:35:12,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:35:12,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:35:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-20 19:35:12,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44140625 [2024-06-20 19:35:12,941 INFO L175 Difference]: Start difference. First operand has 139 places, 117 transitions, 941 flow. Second operand 8 states and 113 transitions. [2024-06-20 19:35:12,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 130 transitions, 1309 flow [2024-06-20 19:35:12,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 130 transitions, 1285 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-20 19:35:12,965 INFO L231 Difference]: Finished difference. Result has 141 places, 119 transitions, 999 flow [2024-06-20 19:35:12,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=999, PETRI_PLACES=141, PETRI_TRANSITIONS=119} [2024-06-20 19:35:12,965 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 110 predicate places. [2024-06-20 19:35:12,965 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 119 transitions, 999 flow [2024-06-20 19:35:12,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:12,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:12,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:12,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-20 19:35:12,966 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:35:12,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:12,966 INFO L85 PathProgramCache]: Analyzing trace with hash 752407864, now seen corresponding path program 3 times [2024-06-20 19:35:12,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:12,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642412777] [2024-06-20 19:35:12,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:12,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:18,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:35:18,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:18,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642412777] [2024-06-20 19:35:18,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642412777] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:18,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:18,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:35:18,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103551498] [2024-06-20 19:35:18,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:18,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:35:18,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:18,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:35:18,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:35:18,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:35:18,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 119 transitions, 999 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:18,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:18,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:35:18,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:19,250 INFO L124 PetriNetUnfolderBase]: 274/553 cut-off events. [2024-06-20 19:35:19,250 INFO L125 PetriNetUnfolderBase]: For 13200/13200 co-relation queries the response was YES. [2024-06-20 19:35:19,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 553 events. 274/553 cut-off events. For 13200/13200 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2712 event pairs, 43 based on Foata normal form. 4/553 useless extension candidates. Maximal degree in co-relation 2616. Up to 387 conditions per place. [2024-06-20 19:35:19,254 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 84 selfloop transitions, 41 changer transitions 0/129 dead transitions. [2024-06-20 19:35:19,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 129 transitions, 1281 flow [2024-06-20 19:35:19,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:35:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:35:19,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2024-06-20 19:35:19,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-20 19:35:19,255 INFO L175 Difference]: Start difference. First operand has 141 places, 119 transitions, 999 flow. Second operand 8 states and 112 transitions. [2024-06-20 19:35:19,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 129 transitions, 1281 flow [2024-06-20 19:35:19,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 129 transitions, 1230 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-20 19:35:19,277 INFO L231 Difference]: Finished difference. Result has 145 places, 120 transitions, 1048 flow [2024-06-20 19:35:19,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1048, PETRI_PLACES=145, PETRI_TRANSITIONS=120} [2024-06-20 19:35:19,278 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 114 predicate places. [2024-06-20 19:35:19,278 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 120 transitions, 1048 flow [2024-06-20 19:35:19,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:19,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:19,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:19,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-20 19:35:19,279 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:35:19,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:19,279 INFO L85 PathProgramCache]: Analyzing trace with hash 747646264, now seen corresponding path program 4 times [2024-06-20 19:35:19,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:19,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557282063] [2024-06-20 19:35:19,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:19,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:26,417 INFO L134 CoverageAnalysis]: 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:26,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:26,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557282063] [2024-06-20 19:35:26,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557282063] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:26,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:26,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:35:26,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309090624] [2024-06-20 19:35:26,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:26,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:35:26,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:26,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:35:26,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:35:26,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:35:26,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 120 transitions, 1048 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:26,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:26,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:35:26,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:26,856 INFO L124 PetriNetUnfolderBase]: 278/561 cut-off events. [2024-06-20 19:35:26,856 INFO L125 PetriNetUnfolderBase]: For 12395/12395 co-relation queries the response was YES. [2024-06-20 19:35:26,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2788 conditions, 561 events. 278/561 cut-off events. For 12395/12395 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2758 event pairs, 39 based on Foata normal form. 2/559 useless extension candidates. Maximal degree in co-relation 2724. Up to 296 conditions per place. [2024-06-20 19:35:26,860 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 93 selfloop transitions, 36 changer transitions 0/133 dead transitions. [2024-06-20 19:35:26,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 133 transitions, 1424 flow [2024-06-20 19:35:26,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:35:26,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:35:26,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2024-06-20 19:35:26,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43359375 [2024-06-20 19:35:26,861 INFO L175 Difference]: Start difference. First operand has 145 places, 120 transitions, 1048 flow. Second operand 8 states and 111 transitions. [2024-06-20 19:35:26,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 133 transitions, 1424 flow [2024-06-20 19:35:26,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 133 transitions, 1340 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-20 19:35:26,887 INFO L231 Difference]: Finished difference. Result has 147 places, 121 transitions, 1053 flow [2024-06-20 19:35:26,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1053, PETRI_PLACES=147, PETRI_TRANSITIONS=121} [2024-06-20 19:35:26,887 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 116 predicate places. [2024-06-20 19:35:26,887 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 121 transitions, 1053 flow [2024-06-20 19:35:26,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:26,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:26,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:26,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-20 19:35:26,888 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:26,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:26,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1757093364, now seen corresponding path program 5 times [2024-06-20 19:35:26,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:26,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786456325] [2024-06-20 19:35:26,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:26,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:32,415 INFO L134 CoverageAnalysis]: 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:32,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:32,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786456325] [2024-06-20 19:35:32,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786456325] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:32,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:32,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:35:32,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34164120] [2024-06-20 19:35:32,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:32,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:35:32,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:32,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:35:32,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:35:32,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:35:32,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 121 transitions, 1053 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:32,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:32,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:35:32,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:32,695 INFO L124 PetriNetUnfolderBase]: 296/598 cut-off events. [2024-06-20 19:35:32,696 INFO L125 PetriNetUnfolderBase]: For 13111/13111 co-relation queries the response was YES. [2024-06-20 19:35:32,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2959 conditions, 598 events. 296/598 cut-off events. For 13111/13111 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3005 event pairs, 41 based on Foata normal form. 2/597 useless extension candidates. Maximal degree in co-relation 2894. Up to 438 conditions per place. [2024-06-20 19:35:32,714 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 96 selfloop transitions, 39 changer transitions 0/139 dead transitions. [2024-06-20 19:35:32,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 139 transitions, 1420 flow [2024-06-20 19:35:32,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:35:32,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:35:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-20 19:35:32,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2024-06-20 19:35:32,730 INFO L175 Difference]: Start difference. First operand has 147 places, 121 transitions, 1053 flow. Second operand 9 states and 123 transitions. [2024-06-20 19:35:32,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 139 transitions, 1420 flow [2024-06-20 19:35:32,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 139 transitions, 1349 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-20 19:35:32,759 INFO L231 Difference]: Finished difference. Result has 152 places, 127 transitions, 1136 flow [2024-06-20 19:35:32,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1136, PETRI_PLACES=152, PETRI_TRANSITIONS=127} [2024-06-20 19:35:32,761 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 121 predicate places. [2024-06-20 19:35:32,761 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 127 transitions, 1136 flow [2024-06-20 19:35:32,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:32,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:32,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:32,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-20 19:35:32,762 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:32,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:32,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1586390934, now seen corresponding path program 6 times [2024-06-20 19:35:32,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:32,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57874201] [2024-06-20 19:35:32,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:32,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:38,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:35:38,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:38,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57874201] [2024-06-20 19:35:38,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57874201] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:38,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:38,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:35:38,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776337169] [2024-06-20 19:35:38,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:38,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:35:38,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:38,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:35:38,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:35:39,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:35:39,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 127 transitions, 1136 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:39,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:39,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:35:39,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:39,434 INFO L124 PetriNetUnfolderBase]: 300/603 cut-off events. [2024-06-20 19:35:39,434 INFO L125 PetriNetUnfolderBase]: For 13825/13825 co-relation queries the response was YES. [2024-06-20 19:35:39,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3016 conditions, 603 events. 300/603 cut-off events. For 13825/13825 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3036 event pairs, 45 based on Foata normal form. 2/601 useless extension candidates. Maximal degree in co-relation 2949. Up to 425 conditions per place. [2024-06-20 19:35:39,439 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 95 selfloop transitions, 41 changer transitions 0/140 dead transitions. [2024-06-20 19:35:39,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 140 transitions, 1456 flow [2024-06-20 19:35:39,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:35:39,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:35:39,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-20 19:35:39,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2024-06-20 19:35:39,441 INFO L175 Difference]: Start difference. First operand has 152 places, 127 transitions, 1136 flow. Second operand 9 states and 123 transitions. [2024-06-20 19:35:39,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 140 transitions, 1456 flow [2024-06-20 19:35:39,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 140 transitions, 1392 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-20 19:35:39,472 INFO L231 Difference]: Finished difference. Result has 157 places, 128 transitions, 1173 flow [2024-06-20 19:35:39,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1173, PETRI_PLACES=157, PETRI_TRANSITIONS=128} [2024-06-20 19:35:39,472 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 126 predicate places. [2024-06-20 19:35:39,473 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 128 transitions, 1173 flow [2024-06-20 19:35:39,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:39,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:39,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:39,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-20 19:35:39,473 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:39,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:39,474 INFO L85 PathProgramCache]: Analyzing trace with hash 898857968, now seen corresponding path program 1 times [2024-06-20 19:35:39,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:39,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568281259] [2024-06-20 19:35:39,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:39,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:35:45,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:45,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568281259] [2024-06-20 19:35:45,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568281259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:45,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:45,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:35:45,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950118830] [2024-06-20 19:35:45,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:45,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:35:45,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:45,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:35:45,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:35:45,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:35:45,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 128 transitions, 1173 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:45,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:35:45,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:45,915 INFO L124 PetriNetUnfolderBase]: 303/610 cut-off events. [2024-06-20 19:35:45,915 INFO L125 PetriNetUnfolderBase]: For 13775/13775 co-relation queries the response was YES. [2024-06-20 19:35:45,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3091 conditions, 610 events. 303/610 cut-off events. For 13775/13775 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3075 event pairs, 47 based on Foata normal form. 1/607 useless extension candidates. Maximal degree in co-relation 3023. Up to 401 conditions per place. [2024-06-20 19:35:45,919 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 82 selfloop transitions, 56 changer transitions 0/142 dead transitions. [2024-06-20 19:35:45,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 142 transitions, 1517 flow [2024-06-20 19:35:45,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:35:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:35:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2024-06-20 19:35:45,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.434375 [2024-06-20 19:35:45,920 INFO L175 Difference]: Start difference. First operand has 157 places, 128 transitions, 1173 flow. Second operand 10 states and 139 transitions. [2024-06-20 19:35:45,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 142 transitions, 1517 flow [2024-06-20 19:35:45,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 142 transitions, 1399 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-20 19:35:45,951 INFO L231 Difference]: Finished difference. Result has 160 places, 132 transitions, 1231 flow [2024-06-20 19:35:45,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1231, PETRI_PLACES=160, PETRI_TRANSITIONS=132} [2024-06-20 19:35:45,951 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 129 predicate places. [2024-06-20 19:35:45,951 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 132 transitions, 1231 flow [2024-06-20 19:35:45,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:45,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:45,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-20 19:35:45,952 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:45,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:45,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1978647864, now seen corresponding path program 7 times [2024-06-20 19:35:45,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:45,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231379671] [2024-06-20 19:35:45,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:45,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:52,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:35:52,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:52,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231379671] [2024-06-20 19:35:52,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231379671] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:52,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:52,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:35:52,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846417009] [2024-06-20 19:35:52,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:52,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:35:52,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:52,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:35:52,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:35:52,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:35:52,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 132 transitions, 1231 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:52,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:52,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:35:52,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:52,795 INFO L124 PetriNetUnfolderBase]: 307/621 cut-off events. [2024-06-20 19:35:52,796 INFO L125 PetriNetUnfolderBase]: For 15202/15202 co-relation queries the response was YES. [2024-06-20 19:35:52,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3155 conditions, 621 events. 307/621 cut-off events. For 15202/15202 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3149 event pairs, 45 based on Foata normal form. 2/620 useless extension candidates. Maximal degree in co-relation 3087. Up to 473 conditions per place. [2024-06-20 19:35:52,800 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 102 selfloop transitions, 38 changer transitions 0/144 dead transitions. [2024-06-20 19:35:52,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 144 transitions, 1552 flow [2024-06-20 19:35:52,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:35:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:35:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-20 19:35:52,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-20 19:35:52,802 INFO L175 Difference]: Start difference. First operand has 160 places, 132 transitions, 1231 flow. Second operand 10 states and 133 transitions. [2024-06-20 19:35:52,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 144 transitions, 1552 flow [2024-06-20 19:35:52,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 144 transitions, 1427 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-20 19:35:52,835 INFO L231 Difference]: Finished difference. Result has 164 places, 133 transitions, 1203 flow [2024-06-20 19:35:52,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1106, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1203, PETRI_PLACES=164, PETRI_TRANSITIONS=133} [2024-06-20 19:35:52,836 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 133 predicate places. [2024-06-20 19:35:52,836 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 133 transitions, 1203 flow [2024-06-20 19:35:52,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:52,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:52,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:52,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-20 19:35:52,837 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:52,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:52,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1647466338, now seen corresponding path program 8 times [2024-06-20 19:35:52,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:52,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875694061] [2024-06-20 19:35:52,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:52,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:58,460 INFO L134 CoverageAnalysis]: 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:58,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:58,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875694061] [2024-06-20 19:35:58,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875694061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:58,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:58,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:35:58,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627417799] [2024-06-20 19:35:58,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:58,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:35:58,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:58,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:35:58,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:35:58,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:35:58,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 133 transitions, 1203 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:58,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:58,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:35:58,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:58,855 INFO L124 PetriNetUnfolderBase]: 311/629 cut-off events. [2024-06-20 19:35:58,856 INFO L125 PetriNetUnfolderBase]: For 15873/15873 co-relation queries the response was YES. [2024-06-20 19:35:58,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3172 conditions, 629 events. 311/629 cut-off events. For 15873/15873 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3187 event pairs, 43 based on Foata normal form. 2/628 useless extension candidates. Maximal degree in co-relation 3103. Up to 450 conditions per place. [2024-06-20 19:35:58,860 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 104 selfloop transitions, 38 changer transitions 0/146 dead transitions. [2024-06-20 19:35:58,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 146 transitions, 1620 flow [2024-06-20 19:35:58,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:35:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:35:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2024-06-20 19:35:58,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4340277777777778 [2024-06-20 19:35:58,862 INFO L175 Difference]: Start difference. First operand has 164 places, 133 transitions, 1203 flow. Second operand 9 states and 125 transitions. [2024-06-20 19:35:58,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 146 transitions, 1620 flow [2024-06-20 19:35:58,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 146 transitions, 1513 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-20 19:35:58,896 INFO L231 Difference]: Finished difference. Result has 163 places, 134 transitions, 1193 flow [2024-06-20 19:35:58,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1193, PETRI_PLACES=163, PETRI_TRANSITIONS=134} [2024-06-20 19:35:58,896 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 132 predicate places. [2024-06-20 19:35:58,897 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 134 transitions, 1193 flow [2024-06-20 19:35:58,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:58,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:58,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:58,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-20 19:35:58,897 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:58,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:58,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1647288708, now seen corresponding path program 9 times [2024-06-20 19:35:58,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:58,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540112589] [2024-06-20 19:35:58,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:58,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:04,193 INFO L134 CoverageAnalysis]: 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:04,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:04,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540112589] [2024-06-20 19:36:04,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540112589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:04,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:04,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:36:04,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357227684] [2024-06-20 19:36:04,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:04,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:36:04,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:04,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:36:04,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:36:04,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:36:04,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 134 transitions, 1193 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:04,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:04,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:36:04,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:04,671 INFO L124 PetriNetUnfolderBase]: 315/637 cut-off events. [2024-06-20 19:36:04,671 INFO L125 PetriNetUnfolderBase]: For 16640/16640 co-relation queries the response was YES. [2024-06-20 19:36:04,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3208 conditions, 637 events. 315/637 cut-off events. For 16640/16640 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3255 event pairs, 45 based on Foata normal form. 2/636 useless extension candidates. Maximal degree in co-relation 3138. Up to 489 conditions per place. [2024-06-20 19:36:04,676 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 106 selfloop transitions, 35 changer transitions 0/145 dead transitions. [2024-06-20 19:36:04,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 145 transitions, 1518 flow [2024-06-20 19:36:04,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:36:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:36:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-20 19:36:04,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2024-06-20 19:36:04,677 INFO L175 Difference]: Start difference. First operand has 163 places, 134 transitions, 1193 flow. Second operand 9 states and 122 transitions. [2024-06-20 19:36:04,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 145 transitions, 1518 flow [2024-06-20 19:36:04,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 145 transitions, 1392 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-20 19:36:04,710 INFO L231 Difference]: Finished difference. Result has 164 places, 135 transitions, 1162 flow [2024-06-20 19:36:04,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1162, PETRI_PLACES=164, PETRI_TRANSITIONS=135} [2024-06-20 19:36:04,711 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 133 predicate places. [2024-06-20 19:36:04,711 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 135 transitions, 1162 flow [2024-06-20 19:36:04,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:04,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:04,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:04,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-20 19:36:04,712 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:36:04,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:04,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1641032598, now seen corresponding path program 10 times [2024-06-20 19:36:04,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:04,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135750271] [2024-06-20 19:36:04,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:04,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:10,619 INFO L134 CoverageAnalysis]: 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,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:10,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135750271] [2024-06-20 19:36:10,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135750271] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:10,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:10,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:36:10,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062384710] [2024-06-20 19:36:10,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:10,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:36:10,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:10,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:36:10,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:36:10,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:36:10,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 135 transitions, 1162 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:10,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:10,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:36:10,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:11,086 INFO L124 PetriNetUnfolderBase]: 312/632 cut-off events. [2024-06-20 19:36:11,086 INFO L125 PetriNetUnfolderBase]: For 14972/14972 co-relation queries the response was YES. [2024-06-20 19:36:11,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3002 conditions, 632 events. 312/632 cut-off events. For 14972/14972 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3236 event pairs, 44 based on Foata normal form. 2/631 useless extension candidates. Maximal degree in co-relation 2932. Up to 484 conditions per place. [2024-06-20 19:36:11,091 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 107 selfloop transitions, 34 changer transitions 0/145 dead transitions. [2024-06-20 19:36:11,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 145 transitions, 1468 flow [2024-06-20 19:36:11,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:36:11,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:36:11,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-20 19:36:11,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2024-06-20 19:36:11,093 INFO L175 Difference]: Start difference. First operand has 164 places, 135 transitions, 1162 flow. Second operand 9 states and 122 transitions. [2024-06-20 19:36:11,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 145 transitions, 1468 flow [2024-06-20 19:36:11,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 145 transitions, 1378 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-20 19:36:11,132 INFO L231 Difference]: Finished difference. Result has 166 places, 135 transitions, 1144 flow [2024-06-20 19:36:11,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1144, PETRI_PLACES=166, PETRI_TRANSITIONS=135} [2024-06-20 19:36:11,133 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 135 predicate places. [2024-06-20 19:36:11,133 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 135 transitions, 1144 flow [2024-06-20 19:36:11,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:11,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:11,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:11,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-20 19:36:11,133 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:36:11,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:11,134 INFO L85 PathProgramCache]: Analyzing trace with hash -830701480, now seen corresponding path program 2 times [2024-06-20 19:36:11,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:11,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360779607] [2024-06-20 19:36:11,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:11,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:17,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:17,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360779607] [2024-06-20 19:36:17,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360779607] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:17,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:17,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:36:17,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283138119] [2024-06-20 19:36:17,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:17,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:36:17,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:17,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:36:17,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:36:17,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:36:17,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 135 transitions, 1144 flow. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:17,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:36:17,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:17,642 INFO L124 PetriNetUnfolderBase]: 320/646 cut-off events. [2024-06-20 19:36:17,643 INFO L125 PetriNetUnfolderBase]: For 15635/15635 co-relation queries the response was YES. [2024-06-20 19:36:17,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3126 conditions, 646 events. 320/646 cut-off events. For 15635/15635 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3326 event pairs, 48 based on Foata normal form. 1/643 useless extension candidates. Maximal degree in co-relation 3055. Up to 420 conditions per place. [2024-06-20 19:36:17,646 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 86 selfloop transitions, 62 changer transitions 0/152 dead transitions. [2024-06-20 19:36:17,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 152 transitions, 1636 flow [2024-06-20 19:36:17,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:36:17,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:36:17,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2024-06-20 19:36:17,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4192708333333333 [2024-06-20 19:36:17,648 INFO L175 Difference]: Start difference. First operand has 166 places, 135 transitions, 1144 flow. Second operand 12 states and 161 transitions. [2024-06-20 19:36:17,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 152 transitions, 1636 flow [2024-06-20 19:36:17,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 152 transitions, 1524 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-20 19:36:17,687 INFO L231 Difference]: Finished difference. Result has 169 places, 139 transitions, 1237 flow [2024-06-20 19:36:17,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1237, PETRI_PLACES=169, PETRI_TRANSITIONS=139} [2024-06-20 19:36:17,688 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 138 predicate places. [2024-06-20 19:36:17,688 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 139 transitions, 1237 flow [2024-06-20 19:36:17,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:17,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:17,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-20 19:36:17,689 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:36:17,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:17,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1173288370, now seen corresponding path program 3 times [2024-06-20 19:36:17,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:17,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736813621] [2024-06-20 19:36:17,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:17,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:24,624 INFO L134 CoverageAnalysis]: 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:24,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:24,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736813621] [2024-06-20 19:36:24,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736813621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:24,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:24,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:36:24,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361986061] [2024-06-20 19:36:24,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:24,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:36:24,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:24,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:36:24,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:36:24,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:36:24,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 139 transitions, 1237 flow. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:24,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:24,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:36:24,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:25,156 INFO L124 PetriNetUnfolderBase]: 318/643 cut-off events. [2024-06-20 19:36:25,156 INFO L125 PetriNetUnfolderBase]: For 15199/15199 co-relation queries the response was YES. [2024-06-20 19:36:25,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3094 conditions, 643 events. 318/643 cut-off events. For 15199/15199 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3326 event pairs, 48 based on Foata normal form. 1/640 useless extension candidates. Maximal degree in co-relation 3022. Up to 436 conditions per place. [2024-06-20 19:36:25,160 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 93 selfloop transitions, 53 changer transitions 0/150 dead transitions. [2024-06-20 19:36:25,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 150 transitions, 1555 flow [2024-06-20 19:36:25,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:36:25,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:36:25,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-20 19:36:25,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41761363636363635 [2024-06-20 19:36:25,162 INFO L175 Difference]: Start difference. First operand has 169 places, 139 transitions, 1237 flow. Second operand 11 states and 147 transitions. [2024-06-20 19:36:25,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 150 transitions, 1555 flow [2024-06-20 19:36:25,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 150 transitions, 1405 flow, removed 29 selfloop flow, removed 9 redundant places. [2024-06-20 19:36:25,203 INFO L231 Difference]: Finished difference. Result has 171 places, 139 transitions, 1198 flow [2024-06-20 19:36:25,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1087, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1198, PETRI_PLACES=171, PETRI_TRANSITIONS=139} [2024-06-20 19:36:25,203 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 140 predicate places. [2024-06-20 19:36:25,203 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 139 transitions, 1198 flow [2024-06-20 19:36:25,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:25,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:25,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:25,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-20 19:36:25,204 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:25,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:25,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1410809734, now seen corresponding path program 4 times [2024-06-20 19:36:25,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:25,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60663162] [2024-06-20 19:36:25,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:25,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:31,432 INFO L134 CoverageAnalysis]: 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:31,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:31,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60663162] [2024-06-20 19:36:31,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60663162] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:31,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:31,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:36:31,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786569705] [2024-06-20 19:36:31,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:31,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:36:31,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:31,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:36:31,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:36:31,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:36:31,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 139 transitions, 1198 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:31,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:31,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:36:31,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:31,884 INFO L124 PetriNetUnfolderBase]: 321/650 cut-off events. [2024-06-20 19:36:31,884 INFO L125 PetriNetUnfolderBase]: For 15294/15294 co-relation queries the response was YES. [2024-06-20 19:36:31,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3110 conditions, 650 events. 321/650 cut-off events. For 15294/15294 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3381 event pairs, 48 based on Foata normal form. 1/647 useless extension candidates. Maximal degree in co-relation 3037. Up to 438 conditions per place. [2024-06-20 19:36:31,889 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 99 selfloop transitions, 48 changer transitions 0/151 dead transitions. [2024-06-20 19:36:31,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 151 transitions, 1550 flow [2024-06-20 19:36:31,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:36:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:36:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-20 19:36:31,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43125 [2024-06-20 19:36:31,890 INFO L175 Difference]: Start difference. First operand has 171 places, 139 transitions, 1198 flow. Second operand 10 states and 138 transitions. [2024-06-20 19:36:31,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 151 transitions, 1550 flow [2024-06-20 19:36:31,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 151 transitions, 1423 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-20 19:36:31,930 INFO L231 Difference]: Finished difference. Result has 171 places, 141 transitions, 1210 flow [2024-06-20 19:36:31,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1210, PETRI_PLACES=171, PETRI_TRANSITIONS=141} [2024-06-20 19:36:31,930 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 140 predicate places. [2024-06-20 19:36:31,930 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 141 transitions, 1210 flow [2024-06-20 19:36:31,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:31,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:31,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:31,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-20 19:36:31,932 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:31,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:31,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1987225688, now seen corresponding path program 5 times [2024-06-20 19:36:31,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:31,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201715452] [2024-06-20 19:36:31,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:31,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:38,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:38,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201715452] [2024-06-20 19:36:38,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201715452] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:38,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:38,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:36:38,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868834350] [2024-06-20 19:36:38,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:38,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:36:38,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:38,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:36:38,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:36:38,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:36:38,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 141 transitions, 1210 flow. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:38,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:38,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:36:38,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:39,179 INFO L124 PetriNetUnfolderBase]: 319/647 cut-off events. [2024-06-20 19:36:39,179 INFO L125 PetriNetUnfolderBase]: For 14650/14650 co-relation queries the response was YES. [2024-06-20 19:36:39,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3037 conditions, 647 events. 319/647 cut-off events. For 14650/14650 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3353 event pairs, 48 based on Foata normal form. 1/644 useless extension candidates. Maximal degree in co-relation 2963. Up to 435 conditions per place. [2024-06-20 19:36:39,184 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 97 selfloop transitions, 53 changer transitions 0/154 dead transitions. [2024-06-20 19:36:39,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 154 transitions, 1574 flow [2024-06-20 19:36:39,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:36:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:36:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2024-06-20 19:36:39,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4289772727272727 [2024-06-20 19:36:39,186 INFO L175 Difference]: Start difference. First operand has 171 places, 141 transitions, 1210 flow. Second operand 11 states and 151 transitions. [2024-06-20 19:36:39,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 154 transitions, 1574 flow [2024-06-20 19:36:39,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 154 transitions, 1451 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-20 19:36:39,223 INFO L231 Difference]: Finished difference. Result has 174 places, 143 transitions, 1240 flow [2024-06-20 19:36:39,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1087, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1240, PETRI_PLACES=174, PETRI_TRANSITIONS=143} [2024-06-20 19:36:39,224 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 143 predicate places. [2024-06-20 19:36:39,224 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 143 transitions, 1240 flow [2024-06-20 19:36:39,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:39,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:39,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:39,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-20 19:36:39,225 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:39,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:39,225 INFO L85 PathProgramCache]: Analyzing trace with hash 878908201, now seen corresponding path program 1 times [2024-06-20 19:36:39,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:39,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697109877] [2024-06-20 19:36:39,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:39,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:45,838 INFO L134 CoverageAnalysis]: 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:45,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:45,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697109877] [2024-06-20 19:36:45,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697109877] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:45,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:45,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:36:45,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878063791] [2024-06-20 19:36:45,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:45,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:36:45,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:45,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:36:45,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:36:46,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:36:46,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 143 transitions, 1240 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:46,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:46,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:36:46,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:46,277 INFO L124 PetriNetUnfolderBase]: 323/655 cut-off events. [2024-06-20 19:36:46,278 INFO L125 PetriNetUnfolderBase]: For 16334/16334 co-relation queries the response was YES. [2024-06-20 19:36:46,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3074 conditions, 655 events. 323/655 cut-off events. For 16334/16334 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3415 event pairs, 31 based on Foata normal form. 2/653 useless extension candidates. Maximal degree in co-relation 2999. Up to 524 conditions per place. [2024-06-20 19:36:46,284 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 142 selfloop transitions, 12 changer transitions 0/158 dead transitions. [2024-06-20 19:36:46,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 158 transitions, 1586 flow [2024-06-20 19:36:46,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:36:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:36:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-20 19:36:46,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-20 19:36:46,301 INFO L175 Difference]: Start difference. First operand has 174 places, 143 transitions, 1240 flow. Second operand 9 states and 114 transitions. [2024-06-20 19:36:46,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 158 transitions, 1586 flow [2024-06-20 19:36:46,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 158 transitions, 1449 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-20 19:36:46,340 INFO L231 Difference]: Finished difference. Result has 174 places, 144 transitions, 1139 flow [2024-06-20 19:36:46,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1139, PETRI_PLACES=174, PETRI_TRANSITIONS=144} [2024-06-20 19:36:46,341 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 143 predicate places. [2024-06-20 19:36:46,341 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 144 transitions, 1139 flow [2024-06-20 19:36:46,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:46,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:46,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:46,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-20 19:36:46,342 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:46,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:46,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1844301669, now seen corresponding path program 2 times [2024-06-20 19:36:46,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:46,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652963922] [2024-06-20 19:36:46,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:46,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:52,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:36:52,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:52,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652963922] [2024-06-20 19:36:52,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652963922] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:52,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:52,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:36:52,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598637404] [2024-06-20 19:36:52,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:52,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:36:52,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:52,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:36:52,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:36:53,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:36:53,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 144 transitions, 1139 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:53,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:53,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:36:53,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:53,473 INFO L124 PetriNetUnfolderBase]: 334/676 cut-off events. [2024-06-20 19:36:53,474 INFO L125 PetriNetUnfolderBase]: For 19213/19213 co-relation queries the response was YES. [2024-06-20 19:36:53,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3159 conditions, 676 events. 334/676 cut-off events. For 19213/19213 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3548 event pairs, 45 based on Foata normal form. 2/674 useless extension candidates. Maximal degree in co-relation 3083. Up to 374 conditions per place. [2024-06-20 19:36:53,480 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 105 selfloop transitions, 50 changer transitions 0/159 dead transitions. [2024-06-20 19:36:53,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 159 transitions, 1599 flow [2024-06-20 19:36:53,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:36:53,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:36:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2024-06-20 19:36:53,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4409722222222222 [2024-06-20 19:36:53,481 INFO L175 Difference]: Start difference. First operand has 174 places, 144 transitions, 1139 flow. Second operand 9 states and 127 transitions. [2024-06-20 19:36:53,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 159 transitions, 1599 flow [2024-06-20 19:36:53,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 159 transitions, 1573 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-20 19:36:53,522 INFO L231 Difference]: Finished difference. Result has 176 places, 146 transitions, 1237 flow [2024-06-20 19:36:53,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1237, PETRI_PLACES=176, PETRI_TRANSITIONS=146} [2024-06-20 19:36:53,523 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 145 predicate places. [2024-06-20 19:36:53,523 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 146 transitions, 1237 flow [2024-06-20 19:36:53,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:53,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:53,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:53,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-20 19:36:53,523 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:53,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:53,524 INFO L85 PathProgramCache]: Analyzing trace with hash 233504861, now seen corresponding path program 3 times [2024-06-20 19:36:53,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:53,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469069480] [2024-06-20 19:36:53,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:53,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:00,238 INFO L134 CoverageAnalysis]: 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:00,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:00,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469069480] [2024-06-20 19:37:00,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469069480] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:00,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:00,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:37:00,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295795912] [2024-06-20 19:37:00,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:00,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:37:00,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:00,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:37:00,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:37:00,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:37:00,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 146 transitions, 1237 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:00,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:00,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:37:00,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:00,784 INFO L124 PetriNetUnfolderBase]: 338/684 cut-off events. [2024-06-20 19:37:00,785 INFO L125 PetriNetUnfolderBase]: For 20219/20219 co-relation queries the response was YES. [2024-06-20 19:37:00,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3298 conditions, 684 events. 338/684 cut-off events. For 20219/20219 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3600 event pairs, 51 based on Foata normal form. 2/682 useless extension candidates. Maximal degree in co-relation 3221. Up to 436 conditions per place. [2024-06-20 19:37:00,789 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 105 selfloop transitions, 50 changer transitions 0/159 dead transitions. [2024-06-20 19:37:00,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 159 transitions, 1691 flow [2024-06-20 19:37:00,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:37:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:37:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2024-06-20 19:37:00,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4409722222222222 [2024-06-20 19:37:00,791 INFO L175 Difference]: Start difference. First operand has 176 places, 146 transitions, 1237 flow. Second operand 9 states and 127 transitions. [2024-06-20 19:37:00,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 159 transitions, 1691 flow [2024-06-20 19:37:00,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 159 transitions, 1602 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-20 19:37:00,835 INFO L231 Difference]: Finished difference. Result has 179 places, 147 transitions, 1264 flow [2024-06-20 19:37:00,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1264, PETRI_PLACES=179, PETRI_TRANSITIONS=147} [2024-06-20 19:37:00,836 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 148 predicate places. [2024-06-20 19:37:00,836 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 147 transitions, 1264 flow [2024-06-20 19:37:00,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:00,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:00,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:00,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-20 19:37:00,836 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:37:00,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:00,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1702198599, now seen corresponding path program 4 times [2024-06-20 19:37:00,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:00,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672719254] [2024-06-20 19:37:00,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:00,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:07,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:37:07,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:07,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672719254] [2024-06-20 19:37:07,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672719254] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:07,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:07,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:37:07,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078835735] [2024-06-20 19:37:07,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:07,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:37:07,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:07,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:37:07,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:37:08,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:37:08,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 147 transitions, 1264 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:08,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:08,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:37:08,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:08,382 INFO L124 PetriNetUnfolderBase]: 342/692 cut-off events. [2024-06-20 19:37:08,382 INFO L125 PetriNetUnfolderBase]: For 20951/20951 co-relation queries the response was YES. [2024-06-20 19:37:08,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3370 conditions, 692 events. 342/692 cut-off events. For 20951/20951 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3644 event pairs, 45 based on Foata normal form. 2/690 useless extension candidates. Maximal degree in co-relation 3292. Up to 267 conditions per place. [2024-06-20 19:37:08,387 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 116 selfloop transitions, 42 changer transitions 0/162 dead transitions. [2024-06-20 19:37:08,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 162 transitions, 1728 flow [2024-06-20 19:37:08,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:37:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:37:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2024-06-20 19:37:08,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2024-06-20 19:37:08,388 INFO L175 Difference]: Start difference. First operand has 179 places, 147 transitions, 1264 flow. Second operand 9 states and 124 transitions. [2024-06-20 19:37:08,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 162 transitions, 1728 flow [2024-06-20 19:37:08,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 162 transitions, 1626 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-20 19:37:08,437 INFO L231 Difference]: Finished difference. Result has 181 places, 148 transitions, 1258 flow [2024-06-20 19:37:08,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1258, PETRI_PLACES=181, PETRI_TRANSITIONS=148} [2024-06-20 19:37:08,438 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 150 predicate places. [2024-06-20 19:37:08,438 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 148 transitions, 1258 flow [2024-06-20 19:37:08,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:08,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:08,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:08,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-20 19:37:08,439 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:37:08,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:08,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1849813779, now seen corresponding path program 5 times [2024-06-20 19:37:08,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:08,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542017750] [2024-06-20 19:37:08,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:08,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:37:16,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:16,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542017750] [2024-06-20 19:37:16,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542017750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:16,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:16,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:37:16,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105079483] [2024-06-20 19:37:16,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:16,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:37:16,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:16,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:37:16,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:37:16,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:37:16,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 148 transitions, 1258 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:16,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:16,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:37:16,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:16,445 INFO L124 PetriNetUnfolderBase]: 339/687 cut-off events. [2024-06-20 19:37:16,445 INFO L125 PetriNetUnfolderBase]: For 18671/18671 co-relation queries the response was YES. [2024-06-20 19:37:16,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3257 conditions, 687 events. 339/687 cut-off events. For 18671/18671 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3621 event pairs, 54 based on Foata normal form. 2/685 useless extension candidates. Maximal degree in co-relation 3178. Up to 476 conditions per place. [2024-06-20 19:37:16,450 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 104 selfloop transitions, 50 changer transitions 0/158 dead transitions. [2024-06-20 19:37:16,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 158 transitions, 1590 flow [2024-06-20 19:37:16,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:37:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:37:16,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2024-06-20 19:37:16,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-20 19:37:16,452 INFO L175 Difference]: Start difference. First operand has 181 places, 148 transitions, 1258 flow. Second operand 9 states and 126 transitions. [2024-06-20 19:37:16,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 158 transitions, 1590 flow [2024-06-20 19:37:16,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 158 transitions, 1522 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-20 19:37:16,491 INFO L231 Difference]: Finished difference. Result has 184 places, 148 transitions, 1295 flow [2024-06-20 19:37:16,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1295, PETRI_PLACES=184, PETRI_TRANSITIONS=148} [2024-06-20 19:37:16,493 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 153 predicate places. [2024-06-20 19:37:16,494 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 148 transitions, 1295 flow [2024-06-20 19:37:16,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:16,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:16,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:16,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-20 19:37:16,494 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:37:16,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:16,495 INFO L85 PathProgramCache]: Analyzing trace with hash 239082567, now seen corresponding path program 1 times [2024-06-20 19:37:16,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:16,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592394766] [2024-06-20 19:37:16,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:16,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:37:24,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:24,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592394766] [2024-06-20 19:37:24,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592394766] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:24,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:24,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:37:24,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500732067] [2024-06-20 19:37:24,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:24,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:37:24,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:24,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:37:24,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:37:24,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:37:24,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 148 transitions, 1295 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:24,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:37:24,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:24,493 INFO L124 PetriNetUnfolderBase]: 355/727 cut-off events. [2024-06-20 19:37:24,494 INFO L125 PetriNetUnfolderBase]: For 28477/28477 co-relation queries the response was YES. [2024-06-20 19:37:24,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3454 conditions, 727 events. 355/727 cut-off events. For 28477/28477 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3885 event pairs, 55 based on Foata normal form. 8/731 useless extension candidates. Maximal degree in co-relation 3374. Up to 503 conditions per place. [2024-06-20 19:37:24,498 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 106 selfloop transitions, 43 changer transitions 9/162 dead transitions. [2024-06-20 19:37:24,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 162 transitions, 1687 flow [2024-06-20 19:37:24,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:37:24,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:37:24,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2024-06-20 19:37:24,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-20 19:37:24,501 INFO L175 Difference]: Start difference. First operand has 184 places, 148 transitions, 1295 flow. Second operand 9 states and 132 transitions. [2024-06-20 19:37:24,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 162 transitions, 1687 flow [2024-06-20 19:37:24,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 162 transitions, 1575 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-20 19:37:24,544 INFO L231 Difference]: Finished difference. Result has 185 places, 143 transitions, 1236 flow [2024-06-20 19:37:24,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1236, PETRI_PLACES=185, PETRI_TRANSITIONS=143} [2024-06-20 19:37:24,544 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 154 predicate places. [2024-06-20 19:37:24,544 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 143 transitions, 1236 flow [2024-06-20 19:37:24,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:24,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:24,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-20 19:37:24,545 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:37:24,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:24,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2095120619, now seen corresponding path program 2 times [2024-06-20 19:37:24,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:24,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140160264] [2024-06-20 19:37:24,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:24,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:30,751 INFO L134 CoverageAnalysis]: 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,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:30,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140160264] [2024-06-20 19:37:30,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140160264] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:30,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:30,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:37:30,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152773] [2024-06-20 19:37:30,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:30,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:37:30,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:30,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:37:30,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:37:30,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:37:30,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 143 transitions, 1236 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:30,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:37:30,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:31,190 INFO L124 PetriNetUnfolderBase]: 361/748 cut-off events. [2024-06-20 19:37:31,190 INFO L125 PetriNetUnfolderBase]: For 38106/38106 co-relation queries the response was YES. [2024-06-20 19:37:31,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3968 conditions, 748 events. 361/748 cut-off events. For 38106/38106 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4001 event pairs, 58 based on Foata normal form. 6/751 useless extension candidates. Maximal degree in co-relation 3887. Up to 467 conditions per place. [2024-06-20 19:37:31,195 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 107 selfloop transitions, 46 changer transitions 5/162 dead transitions. [2024-06-20 19:37:31,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 162 transitions, 1764 flow [2024-06-20 19:37:31,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:37:31,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:37:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 154 transitions. [2024-06-20 19:37:31,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-20 19:37:31,197 INFO L175 Difference]: Start difference. First operand has 185 places, 143 transitions, 1236 flow. Second operand 11 states and 154 transitions. [2024-06-20 19:37:31,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 162 transitions, 1764 flow [2024-06-20 19:37:31,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 162 transitions, 1628 flow, removed 3 selfloop flow, removed 14 redundant places. [2024-06-20 19:37:31,269 INFO L231 Difference]: Finished difference. Result has 182 places, 142 transitions, 1192 flow [2024-06-20 19:37:31,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1192, PETRI_PLACES=182, PETRI_TRANSITIONS=142} [2024-06-20 19:37:31,270 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 151 predicate places. [2024-06-20 19:37:31,270 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 142 transitions, 1192 flow [2024-06-20 19:37:31,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:31,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:31,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-20 19:37:31,271 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:31,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:31,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2094794189, now seen corresponding path program 3 times [2024-06-20 19:37:31,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:31,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203538147] [2024-06-20 19:37:31,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:31,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:39,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:37:39,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:39,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203538147] [2024-06-20 19:37:39,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203538147] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:39,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:39,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:37:39,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726179799] [2024-06-20 19:37:39,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:39,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:37:39,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:39,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:37:39,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:37:39,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:37:39,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 142 transitions, 1192 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:39,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:39,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:37:39,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:39,997 INFO L124 PetriNetUnfolderBase]: 344/713 cut-off events. [2024-06-20 19:37:39,997 INFO L125 PetriNetUnfolderBase]: For 29078/29078 co-relation queries the response was YES. [2024-06-20 19:37:40,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3309 conditions, 713 events. 344/713 cut-off events. For 29078/29078 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3820 event pairs, 54 based on Foata normal form. 8/718 useless extension candidates. Maximal degree in co-relation 3230. Up to 483 conditions per place. [2024-06-20 19:37:40,002 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 103 selfloop transitions, 46 changer transitions 7/160 dead transitions. [2024-06-20 19:37:40,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 160 transitions, 1593 flow [2024-06-20 19:37:40,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:37:40,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:37:40,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2024-06-20 19:37:40,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4192708333333333 [2024-06-20 19:37:40,004 INFO L175 Difference]: Start difference. First operand has 182 places, 142 transitions, 1192 flow. Second operand 12 states and 161 transitions. [2024-06-20 19:37:40,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 160 transitions, 1593 flow [2024-06-20 19:37:40,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 160 transitions, 1497 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-20 19:37:40,057 INFO L231 Difference]: Finished difference. Result has 183 places, 141 transitions, 1195 flow [2024-06-20 19:37:40,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1195, PETRI_PLACES=183, PETRI_TRANSITIONS=141} [2024-06-20 19:37:40,058 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 152 predicate places. [2024-06-20 19:37:40,058 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 141 transitions, 1195 flow [2024-06-20 19:37:40,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:40,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:40,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:40,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-20 19:37:40,059 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:40,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:40,059 INFO L85 PathProgramCache]: Analyzing trace with hash 468151969, now seen corresponding path program 6 times [2024-06-20 19:37:40,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:40,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432640747] [2024-06-20 19:37:40,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:40,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:45,906 INFO L134 CoverageAnalysis]: 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,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:45,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432640747] [2024-06-20 19:37:45,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432640747] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:45,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:45,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:37:45,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203679801] [2024-06-20 19:37:45,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:45,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:37:45,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:45,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:37:45,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:37:46,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 19:37:46,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 141 transitions, 1195 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call 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,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:46,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 19:37:46,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:46,249 INFO L124 PetriNetUnfolderBase]: 331/684 cut-off events. [2024-06-20 19:37:46,250 INFO L125 PetriNetUnfolderBase]: For 19836/19836 co-relation queries the response was YES. [2024-06-20 19:37:46,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3183 conditions, 684 events. 331/684 cut-off events. For 19836/19836 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3607 event pairs, 48 based on Foata normal form. 2/683 useless extension candidates. Maximal degree in co-relation 3104. Up to 434 conditions per place. [2024-06-20 19:37:46,255 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 109 selfloop transitions, 43 changer transitions 0/156 dead transitions. [2024-06-20 19:37:46,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 156 transitions, 1652 flow [2024-06-20 19:37:46,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:37:46,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:37:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-20 19:37:46,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-20 19:37:46,257 INFO L175 Difference]: Start difference. First operand has 183 places, 141 transitions, 1195 flow. Second operand 10 states and 130 transitions. [2024-06-20 19:37:46,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 156 transitions, 1652 flow [2024-06-20 19:37:46,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 156 transitions, 1552 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-20 19:37:46,303 INFO L231 Difference]: Finished difference. Result has 182 places, 142 transitions, 1196 flow [2024-06-20 19:37:46,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1196, PETRI_PLACES=182, PETRI_TRANSITIONS=142} [2024-06-20 19:37:46,304 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 151 predicate places. [2024-06-20 19:37:46,304 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 142 transitions, 1196 flow [2024-06-20 19:37:46,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call 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,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:46,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:46,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-20 19:37:46,305 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:46,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:46,305 INFO L85 PathProgramCache]: Analyzing trace with hash 473658499, now seen corresponding path program 7 times [2024-06-20 19:37:46,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:46,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051960265] [2024-06-20 19:37:46,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:46,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:52,882 INFO L134 CoverageAnalysis]: 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,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:52,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051960265] [2024-06-20 19:37:52,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051960265] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:52,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:52,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:37:52,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465393400] [2024-06-20 19:37:52,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:52,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:37:52,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:52,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:37:52,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:37:53,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:37:53,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 142 transitions, 1196 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:53,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:37:53,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:53,277 INFO L124 PetriNetUnfolderBase]: 345/710 cut-off events. [2024-06-20 19:37:53,277 INFO L125 PetriNetUnfolderBase]: For 22519/22519 co-relation queries the response was YES. [2024-06-20 19:37:53,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3387 conditions, 710 events. 345/710 cut-off events. For 22519/22519 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3765 event pairs, 51 based on Foata normal form. 2/709 useless extension candidates. Maximal degree in co-relation 3308. Up to 505 conditions per place. [2024-06-20 19:37:53,282 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 111 selfloop transitions, 44 changer transitions 0/159 dead transitions. [2024-06-20 19:37:53,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 159 transitions, 1689 flow [2024-06-20 19:37:53,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:37:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:37:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2024-06-20 19:37:53,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.434375 [2024-06-20 19:37:53,285 INFO L175 Difference]: Start difference. First operand has 182 places, 142 transitions, 1196 flow. Second operand 10 states and 139 transitions. [2024-06-20 19:37:53,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 159 transitions, 1689 flow [2024-06-20 19:37:53,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 159 transitions, 1538 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-20 19:37:53,340 INFO L231 Difference]: Finished difference. Result has 183 places, 146 transitions, 1180 flow [2024-06-20 19:37:53,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1180, PETRI_PLACES=183, PETRI_TRANSITIONS=146} [2024-06-20 19:37:53,341 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 152 predicate places. [2024-06-20 19:37:53,341 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 146 transitions, 1180 flow [2024-06-20 19:37:53,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:53,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:53,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-20 19:37:53,342 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:53,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:53,343 INFO L85 PathProgramCache]: Analyzing trace with hash 473865889, now seen corresponding path program 8 times [2024-06-20 19:37:53,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:53,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756905341] [2024-06-20 19:37:53,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:53,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:59,427 INFO L134 CoverageAnalysis]: 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:59,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:59,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756905341] [2024-06-20 19:37:59,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756905341] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:59,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:59,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:37:59,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563279439] [2024-06-20 19:37:59,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:59,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:37:59,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:59,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:37:59,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:37:59,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:37:59,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 146 transitions, 1180 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:59,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:37:59,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:59,807 INFO L124 PetriNetUnfolderBase]: 342/705 cut-off events. [2024-06-20 19:37:59,807 INFO L125 PetriNetUnfolderBase]: For 20010/20010 co-relation queries the response was YES. [2024-06-20 19:37:59,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3139 conditions, 705 events. 342/705 cut-off events. For 20010/20010 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3742 event pairs, 52 based on Foata normal form. 2/704 useless extension candidates. Maximal degree in co-relation 3061. Up to 517 conditions per place. [2024-06-20 19:37:59,812 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 110 selfloop transitions, 43 changer transitions 0/157 dead transitions. [2024-06-20 19:37:59,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 157 transitions, 1512 flow [2024-06-20 19:37:59,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:37:59,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:37:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-20 19:37:59,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-20 19:37:59,814 INFO L175 Difference]: Start difference. First operand has 183 places, 146 transitions, 1180 flow. Second operand 10 states and 136 transitions. [2024-06-20 19:37:59,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 157 transitions, 1512 flow [2024-06-20 19:37:59,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 157 transitions, 1453 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-20 19:37:59,863 INFO L231 Difference]: Finished difference. Result has 188 places, 146 transitions, 1211 flow [2024-06-20 19:37:59,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1211, PETRI_PLACES=188, PETRI_TRANSITIONS=146} [2024-06-20 19:37:59,863 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 157 predicate places. [2024-06-20 19:37:59,863 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 146 transitions, 1211 flow [2024-06-20 19:37:59,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:59,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:59,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-20 19:37:59,864 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:59,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:59,864 INFO L85 PathProgramCache]: Analyzing trace with hash 879960917, now seen corresponding path program 9 times [2024-06-20 19:37:59,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:59,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512826289] [2024-06-20 19:37:59,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:59,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:06,095 INFO L134 CoverageAnalysis]: 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:06,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:06,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512826289] [2024-06-20 19:38:06,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512826289] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:06,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:06,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:38:06,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869371241] [2024-06-20 19:38:06,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:06,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:38:06,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:06,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:38:06,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:38:06,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:38:06,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 146 transitions, 1211 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:06,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:38:06,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:06,626 INFO L124 PetriNetUnfolderBase]: 349/720 cut-off events. [2024-06-20 19:38:06,626 INFO L125 PetriNetUnfolderBase]: For 20647/20647 co-relation queries the response was YES. [2024-06-20 19:38:06,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3271 conditions, 720 events. 349/720 cut-off events. For 20647/20647 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3860 event pairs, 54 based on Foata normal form. 2/719 useless extension candidates. Maximal degree in co-relation 3191. Up to 529 conditions per place. [2024-06-20 19:38:06,631 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 113 selfloop transitions, 43 changer transitions 0/160 dead transitions. [2024-06-20 19:38:06,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 160 transitions, 1579 flow [2024-06-20 19:38:06,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:38:06,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:38:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-20 19:38:06,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.428125 [2024-06-20 19:38:06,633 INFO L175 Difference]: Start difference. First operand has 188 places, 146 transitions, 1211 flow. Second operand 10 states and 137 transitions. [2024-06-20 19:38:06,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 160 transitions, 1579 flow [2024-06-20 19:38:06,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 160 transitions, 1486 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-20 19:38:06,683 INFO L231 Difference]: Finished difference. Result has 189 places, 149 transitions, 1240 flow [2024-06-20 19:38:06,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1240, PETRI_PLACES=189, PETRI_TRANSITIONS=149} [2024-06-20 19:38:06,684 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 158 predicate places. [2024-06-20 19:38:06,684 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 149 transitions, 1240 flow [2024-06-20 19:38:06,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:06,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:06,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-20 19:38:06,685 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:38:06,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:06,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1051340443, now seen corresponding path program 10 times [2024-06-20 19:38:06,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:06,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463285886] [2024-06-20 19:38:06,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:06,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:12,676 INFO L134 CoverageAnalysis]: 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,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:12,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463285886] [2024-06-20 19:38:12,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463285886] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:12,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:12,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:38:12,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677184378] [2024-06-20 19:38:12,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:12,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:38:12,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:12,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:38:12,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:38:12,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:38:12,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 149 transitions, 1240 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:12,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:38:12,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:13,171 INFO L124 PetriNetUnfolderBase]: 360/741 cut-off events. [2024-06-20 19:38:13,171 INFO L125 PetriNetUnfolderBase]: For 24878/24878 co-relation queries the response was YES. [2024-06-20 19:38:13,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3474 conditions, 741 events. 360/741 cut-off events. For 24878/24878 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4000 event pairs, 53 based on Foata normal form. 2/740 useless extension candidates. Maximal degree in co-relation 3393. Up to 527 conditions per place. [2024-06-20 19:38:13,176 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 115 selfloop transitions, 45 changer transitions 0/164 dead transitions. [2024-06-20 19:38:13,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 164 transitions, 1726 flow [2024-06-20 19:38:13,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:38:13,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:38:13,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2024-06-20 19:38:13,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.434375 [2024-06-20 19:38:13,177 INFO L175 Difference]: Start difference. First operand has 189 places, 149 transitions, 1240 flow. Second operand 10 states and 139 transitions. [2024-06-20 19:38:13,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 164 transitions, 1726 flow [2024-06-20 19:38:13,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 164 transitions, 1647 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-20 19:38:13,234 INFO L231 Difference]: Finished difference. Result has 193 places, 151 transitions, 1275 flow [2024-06-20 19:38:13,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1275, PETRI_PLACES=193, PETRI_TRANSITIONS=151} [2024-06-20 19:38:13,234 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 162 predicate places. [2024-06-20 19:38:13,234 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 151 transitions, 1275 flow [2024-06-20 19:38:13,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:13,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:13,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-20 19:38:13,235 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:38:13,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:13,235 INFO L85 PathProgramCache]: Analyzing trace with hash -794632543, now seen corresponding path program 11 times [2024-06-20 19:38:13,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:13,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167166797] [2024-06-20 19:38:13,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:13,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:20,373 INFO L134 CoverageAnalysis]: 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:20,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:20,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167166797] [2024-06-20 19:38:20,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167166797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:20,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:20,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:38:20,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947146874] [2024-06-20 19:38:20,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:20,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:38:20,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:20,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:38:20,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:38:20,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:38:20,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 151 transitions, 1275 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:20,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:20,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:38:20,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:20,923 INFO L124 PetriNetUnfolderBase]: 357/736 cut-off events. [2024-06-20 19:38:20,923 INFO L125 PetriNetUnfolderBase]: For 22203/22203 co-relation queries the response was YES. [2024-06-20 19:38:20,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3371 conditions, 736 events. 357/736 cut-off events. For 22203/22203 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3961 event pairs, 54 based on Foata normal form. 2/735 useless extension candidates. Maximal degree in co-relation 3289. Up to 545 conditions per place. [2024-06-20 19:38:20,928 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 114 selfloop transitions, 44 changer transitions 0/162 dead transitions. [2024-06-20 19:38:20,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 162 transitions, 1617 flow [2024-06-20 19:38:20,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:38:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:38:20,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-20 19:38:20,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-20 19:38:20,930 INFO L175 Difference]: Start difference. First operand has 193 places, 151 transitions, 1275 flow. Second operand 10 states and 136 transitions. [2024-06-20 19:38:20,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 162 transitions, 1617 flow [2024-06-20 19:38:20,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 162 transitions, 1552 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-20 19:38:20,988 INFO L231 Difference]: Finished difference. Result has 197 places, 151 transitions, 1302 flow [2024-06-20 19:38:20,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1302, PETRI_PLACES=197, PETRI_TRANSITIONS=151} [2024-06-20 19:38:20,989 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 166 predicate places. [2024-06-20 19:38:20,989 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 151 transitions, 1302 flow [2024-06-20 19:38:20,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:20,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:20,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:20,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-20 19:38:20,989 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:38:20,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:20,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1465250435, now seen corresponding path program 12 times [2024-06-20 19:38:20,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:20,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000436405] [2024-06-20 19:38:20,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:20,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:27,124 INFO L134 CoverageAnalysis]: 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:27,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:27,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000436405] [2024-06-20 19:38:27,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000436405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:27,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:27,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:38:27,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933242955] [2024-06-20 19:38:27,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:27,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:38:27,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:27,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:38:27,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:38:27,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:38:27,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 151 transitions, 1302 flow. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:27,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:27,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:38:27,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:27,541 INFO L124 PetriNetUnfolderBase]: 364/749 cut-off events. [2024-06-20 19:38:27,541 INFO L125 PetriNetUnfolderBase]: For 22920/22920 co-relation queries the response was YES. [2024-06-20 19:38:27,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3505 conditions, 749 events. 364/749 cut-off events. For 22920/22920 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4059 event pairs, 54 based on Foata normal form. 2/748 useless extension candidates. Maximal degree in co-relation 3421. Up to 557 conditions per place. [2024-06-20 19:38:27,546 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 113 selfloop transitions, 49 changer transitions 0/166 dead transitions. [2024-06-20 19:38:27,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 166 transitions, 1690 flow [2024-06-20 19:38:27,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:38:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:38:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-20 19:38:27,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42329545454545453 [2024-06-20 19:38:27,547 INFO L175 Difference]: Start difference. First operand has 197 places, 151 transitions, 1302 flow. Second operand 11 states and 149 transitions. [2024-06-20 19:38:27,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 166 transitions, 1690 flow [2024-06-20 19:38:27,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 166 transitions, 1579 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-20 19:38:27,614 INFO L231 Difference]: Finished difference. Result has 198 places, 154 transitions, 1331 flow [2024-06-20 19:38:27,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1331, PETRI_PLACES=198, PETRI_TRANSITIONS=154} [2024-06-20 19:38:27,615 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 167 predicate places. [2024-06-20 19:38:27,615 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 154 transitions, 1331 flow [2024-06-20 19:38:27,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:27,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:27,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:27,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-20 19:38:27,616 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:38:27,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:27,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1943509569, now seen corresponding path program 13 times [2024-06-20 19:38:27,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:27,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610549371] [2024-06-20 19:38:27,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:27,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:34,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:38:34,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:34,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610549371] [2024-06-20 19:38:34,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610549371] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:34,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:34,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:38:34,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957045473] [2024-06-20 19:38:34,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:34,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:38:34,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:34,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:38:34,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:38:34,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:38:34,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 154 transitions, 1331 flow. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:34,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:34,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:38:34,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:34,489 INFO L124 PetriNetUnfolderBase]: 368/757 cut-off events. [2024-06-20 19:38:34,490 INFO L125 PetriNetUnfolderBase]: For 23639/23639 co-relation queries the response was YES. [2024-06-20 19:38:34,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3556 conditions, 757 events. 368/757 cut-off events. For 23639/23639 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4101 event pairs, 56 based on Foata normal form. 2/756 useless extension candidates. Maximal degree in co-relation 3471. Up to 565 conditions per place. [2024-06-20 19:38:34,495 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 114 selfloop transitions, 49 changer transitions 0/167 dead transitions. [2024-06-20 19:38:34,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 167 transitions, 1698 flow [2024-06-20 19:38:34,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:38:34,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:38:34,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2024-06-20 19:38:34,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2024-06-20 19:38:34,498 INFO L175 Difference]: Start difference. First operand has 198 places, 154 transitions, 1331 flow. Second operand 11 states and 148 transitions. [2024-06-20 19:38:34,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 167 transitions, 1698 flow [2024-06-20 19:38:34,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 167 transitions, 1596 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-20 19:38:34,567 INFO L231 Difference]: Finished difference. Result has 201 places, 155 transitions, 1346 flow [2024-06-20 19:38:34,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1229, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1346, PETRI_PLACES=201, PETRI_TRANSITIONS=155} [2024-06-20 19:38:34,567 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 170 predicate places. [2024-06-20 19:38:34,567 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 155 transitions, 1346 flow [2024-06-20 19:38:34,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call 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:34,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:34,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:34,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-20 19:38:34,568 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:34,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:34,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1208542535, now seen corresponding path program 14 times [2024-06-20 19:38:34,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:34,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872555303] [2024-06-20 19:38:34,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:34,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:41,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:41,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872555303] [2024-06-20 19:38:41,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872555303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:41,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:41,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:38:41,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810340401] [2024-06-20 19:38:41,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:41,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:38:41,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:41,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:38:41,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:38:41,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:38:41,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 155 transitions, 1346 flow. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:38:41,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:41,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:38:41,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:41,551 INFO L124 PetriNetUnfolderBase]: 365/752 cut-off events. [2024-06-20 19:38:41,551 INFO L125 PetriNetUnfolderBase]: For 20398/20398 co-relation queries the response was YES. [2024-06-20 19:38:41,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3417 conditions, 752 events. 365/752 cut-off events. For 20398/20398 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4079 event pairs, 53 based on Foata normal form. 2/751 useless extension candidates. Maximal degree in co-relation 3331. Up to 540 conditions per place. [2024-06-20 19:38:41,557 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 113 selfloop transitions, 51 changer transitions 0/168 dead transitions. [2024-06-20 19:38:41,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 168 transitions, 1704 flow [2024-06-20 19:38:41,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:38:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:38:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-20 19:38:41,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42329545454545453 [2024-06-20 19:38:41,558 INFO L175 Difference]: Start difference. First operand has 201 places, 155 transitions, 1346 flow. Second operand 11 states and 149 transitions. [2024-06-20 19:38:41,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 168 transitions, 1704 flow [2024-06-20 19:38:41,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 168 transitions, 1575 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-20 19:38:41,608 INFO L231 Difference]: Finished difference. Result has 202 places, 155 transitions, 1323 flow [2024-06-20 19:38:41,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1323, PETRI_PLACES=202, PETRI_TRANSITIONS=155} [2024-06-20 19:38:41,609 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 171 predicate places. [2024-06-20 19:38:41,609 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 155 transitions, 1323 flow [2024-06-20 19:38:41,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:38:41,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:41,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:41,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-20 19:38:41,610 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:41,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:41,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2012200145, now seen corresponding path program 4 times [2024-06-20 19:38:41,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:41,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964450675] [2024-06-20 19:38:41,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:41,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:47,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:47,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:47,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964450675] [2024-06-20 19:38:47,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964450675] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:47,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:47,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:38:47,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340226355] [2024-06-20 19:38:47,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:47,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:38:47,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:47,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:38:47,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:38:47,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:38:47,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 155 transitions, 1323 flow. Second operand has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:38:47,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:47,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:38:47,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:48,122 INFO L124 PetriNetUnfolderBase]: 377/784 cut-off events. [2024-06-20 19:38:48,122 INFO L125 PetriNetUnfolderBase]: For 32617/32617 co-relation queries the response was YES. [2024-06-20 19:38:48,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3528 conditions, 784 events. 377/784 cut-off events. For 32617/32617 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4264 event pairs, 61 based on Foata normal form. 8/789 useless extension candidates. Maximal degree in co-relation 3441. Up to 556 conditions per place. [2024-06-20 19:38:48,128 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 109 selfloop transitions, 49 changer transitions 9/171 dead transitions. [2024-06-20 19:38:48,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 171 transitions, 1725 flow [2024-06-20 19:38:48,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:38:48,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:38:48,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 159 transitions. [2024-06-20 19:38:48,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4140625 [2024-06-20 19:38:48,129 INFO L175 Difference]: Start difference. First operand has 202 places, 155 transitions, 1323 flow. Second operand 12 states and 159 transitions. [2024-06-20 19:38:48,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 171 transitions, 1725 flow [2024-06-20 19:38:48,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 171 transitions, 1494 flow, removed 5 selfloop flow, removed 13 redundant places. [2024-06-20 19:38:48,196 INFO L231 Difference]: Finished difference. Result has 201 places, 152 transitions, 1175 flow [2024-06-20 19:38:48,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1175, PETRI_PLACES=201, PETRI_TRANSITIONS=152} [2024-06-20 19:38:48,196 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 170 predicate places. [2024-06-20 19:38:48,196 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 152 transitions, 1175 flow [2024-06-20 19:38:48,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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:48,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:48,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:48,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-20 19:38:48,197 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:48,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:48,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2002936415, now seen corresponding path program 5 times [2024-06-20 19:38:48,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:48,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150824795] [2024-06-20 19:38:48,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:48,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:56,028 INFO L134 CoverageAnalysis]: 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:56,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:56,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150824795] [2024-06-20 19:38:56,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150824795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:56,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:56,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:38:56,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760640764] [2024-06-20 19:38:56,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:56,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:38:56,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:56,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:38:56,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:38:56,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:38:56,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 152 transitions, 1175 flow. Second operand has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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:56,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:56,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:38:56,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:56,670 INFO L124 PetriNetUnfolderBase]: 368/764 cut-off events. [2024-06-20 19:38:56,670 INFO L125 PetriNetUnfolderBase]: For 29152/29152 co-relation queries the response was YES. [2024-06-20 19:38:56,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3208 conditions, 764 events. 368/764 cut-off events. For 29152/29152 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4167 event pairs, 59 based on Foata normal form. 6/766 useless extension candidates. Maximal degree in co-relation 3122. Up to 525 conditions per place. [2024-06-20 19:38:56,676 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 101 selfloop transitions, 51 changer transitions 12/168 dead transitions. [2024-06-20 19:38:56,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 168 transitions, 1557 flow [2024-06-20 19:38:56,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:38:56,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:38:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 158 transitions. [2024-06-20 19:38:56,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4114583333333333 [2024-06-20 19:38:56,677 INFO L175 Difference]: Start difference. First operand has 201 places, 152 transitions, 1175 flow. Second operand 12 states and 158 transitions. [2024-06-20 19:38:56,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 168 transitions, 1557 flow [2024-06-20 19:38:56,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 168 transitions, 1455 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-20 19:38:56,732 INFO L231 Difference]: Finished difference. Result has 199 places, 148 transitions, 1150 flow [2024-06-20 19:38:56,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1150, PETRI_PLACES=199, PETRI_TRANSITIONS=148} [2024-06-20 19:38:56,733 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 168 predicate places. [2024-06-20 19:38:56,733 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 148 transitions, 1150 flow [2024-06-20 19:38:56,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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:56,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:56,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:56,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-20 19:38:56,734 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:56,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:56,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1677602543, now seen corresponding path program 6 times [2024-06-20 19:38:56,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:56,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615624294] [2024-06-20 19:38:56,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:56,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:04,320 INFO L134 CoverageAnalysis]: 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:04,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:04,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615624294] [2024-06-20 19:39:04,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615624294] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:04,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:04,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:39:04,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130084041] [2024-06-20 19:39:04,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:04,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:39:04,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:04,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:39:04,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:39:04,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:39:04,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 148 transitions, 1150 flow. Second operand has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:39:04,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:04,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:39:04,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:04,786 INFO L124 PetriNetUnfolderBase]: 360/742 cut-off events. [2024-06-20 19:39:04,786 INFO L125 PetriNetUnfolderBase]: For 25109/25109 co-relation queries the response was YES. [2024-06-20 19:39:04,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3164 conditions, 742 events. 360/742 cut-off events. For 25109/25109 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4009 event pairs, 61 based on Foata normal form. 4/742 useless extension candidates. Maximal degree in co-relation 3079. Up to 518 conditions per place. [2024-06-20 19:39:04,799 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 102 selfloop transitions, 58 changer transitions 0/164 dead transitions. [2024-06-20 19:39:04,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 164 transitions, 1538 flow [2024-06-20 19:39:04,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:39:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:39:04,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 163 transitions. [2024-06-20 19:39:04,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4244791666666667 [2024-06-20 19:39:04,800 INFO L175 Difference]: Start difference. First operand has 199 places, 148 transitions, 1150 flow. Second operand 12 states and 163 transitions. [2024-06-20 19:39:04,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 164 transitions, 1538 flow [2024-06-20 19:39:04,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 164 transitions, 1430 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-20 19:39:04,841 INFO L231 Difference]: Finished difference. Result has 194 places, 150 transitions, 1204 flow [2024-06-20 19:39:04,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1204, PETRI_PLACES=194, PETRI_TRANSITIONS=150} [2024-06-20 19:39:04,841 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 163 predicate places. [2024-06-20 19:39:04,841 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 150 transitions, 1204 flow [2024-06-20 19:39:04,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:39:04,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:04,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:39:04,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-20 19:39:04,842 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:39:04,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:04,842 INFO L85 PathProgramCache]: Analyzing trace with hash 389283233, now seen corresponding path program 7 times [2024-06-20 19:39:04,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:04,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199953866] [2024-06-20 19:39:04,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:04,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:39:10,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:10,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199953866] [2024-06-20 19:39:10,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199953866] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:10,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:10,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:39:10,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119724372] [2024-06-20 19:39:10,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:10,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:39:10,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:10,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:39:10,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:39:10,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:39:10,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 150 transitions, 1204 flow. Second operand has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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:10,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:10,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:39:10,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:11,280 INFO L124 PetriNetUnfolderBase]: 390/816 cut-off events. [2024-06-20 19:39:11,280 INFO L125 PetriNetUnfolderBase]: For 41482/41482 co-relation queries the response was YES. [2024-06-20 19:39:11,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3966 conditions, 816 events. 390/816 cut-off events. For 41482/41482 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4491 event pairs, 73 based on Foata normal form. 6/818 useless extension candidates. Maximal degree in co-relation 3883. Up to 491 conditions per place. [2024-06-20 19:39:11,285 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 104 selfloop transitions, 54 changer transitions 9/171 dead transitions. [2024-06-20 19:39:11,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 171 transitions, 1764 flow [2024-06-20 19:39:11,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:39:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:39:11,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 165 transitions. [2024-06-20 19:39:11,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4296875 [2024-06-20 19:39:11,286 INFO L175 Difference]: Start difference. First operand has 194 places, 150 transitions, 1204 flow. Second operand 12 states and 165 transitions. [2024-06-20 19:39:11,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 171 transitions, 1764 flow [2024-06-20 19:39:11,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 171 transitions, 1620 flow, removed 16 selfloop flow, removed 10 redundant places. [2024-06-20 19:39:11,363 INFO L231 Difference]: Finished difference. Result has 196 places, 147 transitions, 1153 flow [2024-06-20 19:39:11,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1153, PETRI_PLACES=196, PETRI_TRANSITIONS=147} [2024-06-20 19:39:11,364 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 165 predicate places. [2024-06-20 19:39:11,364 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 147 transitions, 1153 flow [2024-06-20 19:39:11,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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:11,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:11,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:39:11,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-20 19:39:11,365 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:39:11,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:11,365 INFO L85 PathProgramCache]: Analyzing trace with hash 18385283, now seen corresponding path program 8 times [2024-06-20 19:39:11,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:11,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493934313] [2024-06-20 19:39:11,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:11,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:17,889 INFO L134 CoverageAnalysis]: 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:17,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:17,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493934313] [2024-06-20 19:39:17,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493934313] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:17,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:17,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:39:17,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620789290] [2024-06-20 19:39:17,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:17,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:39:17,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:17,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:39:17,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:39:18,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:39:18,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 147 transitions, 1153 flow. Second operand has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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:18,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:18,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:39:18,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:18,495 INFO L124 PetriNetUnfolderBase]: 378/787 cut-off events. [2024-06-20 19:39:18,496 INFO L125 PetriNetUnfolderBase]: For 42550/42550 co-relation queries the response was YES. [2024-06-20 19:39:18,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3836 conditions, 787 events. 378/787 cut-off events. For 42550/42550 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4247 event pairs, 67 based on Foata normal form. 6/790 useless extension candidates. Maximal degree in co-relation 3752. Up to 512 conditions per place. [2024-06-20 19:39:18,501 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 108 selfloop transitions, 49 changer transitions 6/167 dead transitions. [2024-06-20 19:39:18,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 167 transitions, 1705 flow [2024-06-20 19:39:18,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:39:18,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:39:18,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2024-06-20 19:39:18,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4192708333333333 [2024-06-20 19:39:18,503 INFO L175 Difference]: Start difference. First operand has 196 places, 147 transitions, 1153 flow. Second operand 12 states and 161 transitions. [2024-06-20 19:39:18,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 167 transitions, 1705 flow [2024-06-20 19:39:18,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 167 transitions, 1588 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-20 19:39:18,583 INFO L231 Difference]: Finished difference. Result has 193 places, 145 transitions, 1129 flow [2024-06-20 19:39:18,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1129, PETRI_PLACES=193, PETRI_TRANSITIONS=145} [2024-06-20 19:39:18,583 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 162 predicate places. [2024-06-20 19:39:18,584 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 145 transitions, 1129 flow [2024-06-20 19:39:18,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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:18,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:18,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:39:18,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-20 19:39:18,584 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:39:18,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:18,585 INFO L85 PathProgramCache]: Analyzing trace with hash -454245701, now seen corresponding path program 9 times [2024-06-20 19:39:18,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:18,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068575419] [2024-06-20 19:39:18,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:18,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:25,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:39:25,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:25,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068575419] [2024-06-20 19:39:25,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068575419] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:25,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:25,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:39:25,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866231807] [2024-06-20 19:39:25,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:25,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:39:25,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:25,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:39:25,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:39:25,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:39:25,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 145 transitions, 1129 flow. Second operand has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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:25,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:25,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:39:25,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:26,053 INFO L124 PetriNetUnfolderBase]: 354/728 cut-off events. [2024-06-20 19:39:26,053 INFO L125 PetriNetUnfolderBase]: For 29500/29500 co-relation queries the response was YES. [2024-06-20 19:39:26,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3114 conditions, 728 events. 354/728 cut-off events. For 29500/29500 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3861 event pairs, 61 based on Foata normal form. 8/732 useless extension candidates. Maximal degree in co-relation 3032. Up to 491 conditions per place. [2024-06-20 19:39:26,059 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 94 selfloop transitions, 50 changer transitions 13/161 dead transitions. [2024-06-20 19:39:26,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 161 transitions, 1515 flow [2024-06-20 19:39:26,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:39:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:39:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 157 transitions. [2024-06-20 19:39:26,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4088541666666667 [2024-06-20 19:39:26,060 INFO L175 Difference]: Start difference. First operand has 193 places, 145 transitions, 1129 flow. Second operand 12 states and 157 transitions. [2024-06-20 19:39:26,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 161 transitions, 1515 flow [2024-06-20 19:39:26,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 161 transitions, 1415 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-20 19:39:26,106 INFO L231 Difference]: Finished difference. Result has 192 places, 140 transitions, 1097 flow [2024-06-20 19:39:26,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1097, PETRI_PLACES=192, PETRI_TRANSITIONS=140} [2024-06-20 19:39:26,109 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 161 predicate places. [2024-06-20 19:39:26,110 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 140 transitions, 1097 flow [2024-06-20 19:39:26,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:39:26,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:26,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:39:26,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-20 19:39:26,110 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:39:26,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:26,112 INFO L85 PathProgramCache]: Analyzing trace with hash 473873825, now seen corresponding path program 10 times [2024-06-20 19:39:26,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:26,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895996744] [2024-06-20 19:39:26,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:26,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:32,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:39:32,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:32,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895996744] [2024-06-20 19:39:32,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895996744] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:32,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:32,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:39:32,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345646553] [2024-06-20 19:39:32,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:32,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:39:32,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:32,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:39:32,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:39:32,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:39:32,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 140 transitions, 1097 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:39:32,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:32,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:39:32,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:33,220 INFO L124 PetriNetUnfolderBase]: 349/720 cut-off events. [2024-06-20 19:39:33,220 INFO L125 PetriNetUnfolderBase]: For 29102/29102 co-relation queries the response was YES. [2024-06-20 19:39:33,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3057 conditions, 720 events. 349/720 cut-off events. For 29102/29102 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3794 event pairs, 59 based on Foata normal form. 8/725 useless extension candidates. Maximal degree in co-relation 2976. Up to 510 conditions per place. [2024-06-20 19:39:33,225 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 102 selfloop transitions, 42 changer transitions 9/157 dead transitions. [2024-06-20 19:39:33,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 157 transitions, 1483 flow [2024-06-20 19:39:33,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:39:33,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:39:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-20 19:39:33,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41761363636363635 [2024-06-20 19:39:33,226 INFO L175 Difference]: Start difference. First operand has 192 places, 140 transitions, 1097 flow. Second operand 11 states and 147 transitions. [2024-06-20 19:39:33,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 157 transitions, 1483 flow [2024-06-20 19:39:33,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 157 transitions, 1365 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-20 19:39:33,275 INFO L231 Difference]: Finished difference. Result has 185 places, 139 transitions, 1068 flow [2024-06-20 19:39:33,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1068, PETRI_PLACES=185, PETRI_TRANSITIONS=139} [2024-06-20 19:39:33,276 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 154 predicate places. [2024-06-20 19:39:33,276 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 139 transitions, 1068 flow [2024-06-20 19:39:33,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:33,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:33,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:39:33,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-20 19:39:33,277 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:33,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:33,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1474781571, now seen corresponding path program 11 times [2024-06-20 19:39:33,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:33,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451620988] [2024-06-20 19:39:33,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:33,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:40,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:39:40,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:40,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451620988] [2024-06-20 19:39:40,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451620988] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:40,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:40,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:39:40,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091767968] [2024-06-20 19:39:40,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:40,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:39:40,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:40,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:39:40,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:39:40,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:39:40,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 139 transitions, 1068 flow. Second operand has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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:40,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:40,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:39:40,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:40,972 INFO L124 PetriNetUnfolderBase]: 362/751 cut-off events. [2024-06-20 19:39:40,972 INFO L125 PetriNetUnfolderBase]: For 36210/36210 co-relation queries the response was YES. [2024-06-20 19:39:40,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3573 conditions, 751 events. 362/751 cut-off events. For 36210/36210 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3974 event pairs, 65 based on Foata normal form. 6/754 useless extension candidates. Maximal degree in co-relation 3493. Up to 465 conditions per place. [2024-06-20 19:39:40,978 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 102 selfloop transitions, 47 changer transitions 6/159 dead transitions. [2024-06-20 19:39:40,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 159 transitions, 1586 flow [2024-06-20 19:39:40,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:39:40,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:39:40,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 163 transitions. [2024-06-20 19:39:40,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4244791666666667 [2024-06-20 19:39:40,979 INFO L175 Difference]: Start difference. First operand has 185 places, 139 transitions, 1068 flow. Second operand 12 states and 163 transitions. [2024-06-20 19:39:40,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 159 transitions, 1586 flow [2024-06-20 19:39:41,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 159 transitions, 1494 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-20 19:39:41,049 INFO L231 Difference]: Finished difference. Result has 185 places, 137 transitions, 1062 flow [2024-06-20 19:39:41,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1062, PETRI_PLACES=185, PETRI_TRANSITIONS=137} [2024-06-20 19:39:41,049 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 154 predicate places. [2024-06-20 19:39:41,049 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 137 transitions, 1062 flow [2024-06-20 19:39:41,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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:41,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:41,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:39:41,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-20 19:39:41,050 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:41,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:41,050 INFO L85 PathProgramCache]: Analyzing trace with hash 667813235, now seen corresponding path program 12 times [2024-06-20 19:39:41,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:41,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198229559] [2024-06-20 19:39:41,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:41,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:48,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:39:48,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:48,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198229559] [2024-06-20 19:39:48,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198229559] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:48,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:48,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:39:48,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032345490] [2024-06-20 19:39:48,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:48,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:39:48,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:48,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:39:48,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:39:48,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:39:48,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 137 transitions, 1062 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:48,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:48,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:39:48,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:48,694 INFO L124 PetriNetUnfolderBase]: 363/747 cut-off events. [2024-06-20 19:39:48,694 INFO L125 PetriNetUnfolderBase]: For 40627/40627 co-relation queries the response was YES. [2024-06-20 19:39:48,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3599 conditions, 747 events. 363/747 cut-off events. For 40627/40627 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3974 event pairs, 71 based on Foata normal form. 8/751 useless extension candidates. Maximal degree in co-relation 3520. Up to 523 conditions per place. [2024-06-20 19:39:48,700 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 99 selfloop transitions, 42 changer transitions 9/154 dead transitions. [2024-06-20 19:39:48,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 154 transitions, 1436 flow [2024-06-20 19:39:48,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:39:48,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:39:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-20 19:39:48,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42329545454545453 [2024-06-20 19:39:48,702 INFO L175 Difference]: Start difference. First operand has 185 places, 137 transitions, 1062 flow. Second operand 11 states and 149 transitions. [2024-06-20 19:39:48,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 154 transitions, 1436 flow [2024-06-20 19:39:48,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 154 transitions, 1342 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-20 19:39:48,767 INFO L231 Difference]: Finished difference. Result has 184 places, 136 transitions, 1051 flow [2024-06-20 19:39:48,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=968, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1051, PETRI_PLACES=184, PETRI_TRANSITIONS=136} [2024-06-20 19:39:48,768 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 153 predicate places. [2024-06-20 19:39:48,768 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 136 transitions, 1051 flow [2024-06-20 19:39:48,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:48,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:48,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:39:48,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-20 19:39:48,769 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:48,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:48,769 INFO L85 PathProgramCache]: Analyzing trace with hash -794624607, now seen corresponding path program 13 times [2024-06-20 19:39:48,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:48,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969905818] [2024-06-20 19:39:48,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:48,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:56,205 INFO L134 CoverageAnalysis]: 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:56,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:56,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969905818] [2024-06-20 19:39:56,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969905818] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:56,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:56,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:39:56,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403987662] [2024-06-20 19:39:56,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:56,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:39:56,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:56,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:39:56,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:39:56,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:39:56,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 136 transitions, 1051 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:56,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:56,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:39:56,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:56,824 INFO L124 PetriNetUnfolderBase]: 358/744 cut-off events. [2024-06-20 19:39:56,824 INFO L125 PetriNetUnfolderBase]: For 39235/39235 co-relation queries the response was YES. [2024-06-20 19:39:56,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3556 conditions, 744 events. 358/744 cut-off events. For 39235/39235 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3957 event pairs, 73 based on Foata normal form. 8/748 useless extension candidates. Maximal degree in co-relation 3477. Up to 516 conditions per place. [2024-06-20 19:39:56,830 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 96 selfloop transitions, 42 changer transitions 9/151 dead transitions. [2024-06-20 19:39:56,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 151 transitions, 1409 flow [2024-06-20 19:39:56,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:39:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:39:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2024-06-20 19:39:56,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2024-06-20 19:39:56,841 INFO L175 Difference]: Start difference. First operand has 184 places, 136 transitions, 1051 flow. Second operand 11 states and 148 transitions. [2024-06-20 19:39:56,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 151 transitions, 1409 flow [2024-06-20 19:39:56,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 151 transitions, 1319 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-20 19:39:56,906 INFO L231 Difference]: Finished difference. Result has 183 places, 133 transitions, 1030 flow [2024-06-20 19:39:56,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1030, PETRI_PLACES=183, PETRI_TRANSITIONS=133} [2024-06-20 19:39:56,907 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 152 predicate places. [2024-06-20 19:39:56,907 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 133 transitions, 1030 flow [2024-06-20 19:39:56,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:56,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:56,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:39:56,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-20 19:39:56,908 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:56,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:56,908 INFO L85 PathProgramCache]: Analyzing trace with hash -785101407, now seen corresponding path program 14 times [2024-06-20 19:39:56,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:56,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157067413] [2024-06-20 19:39:56,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:56,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:03,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:40:03,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:03,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157067413] [2024-06-20 19:40:03,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157067413] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:03,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:03,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:40:03,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376434489] [2024-06-20 19:40:03,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:03,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:40:03,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:03,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:40:03,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:40:03,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-20 19:40:03,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 133 transitions, 1030 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:40:03,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:03,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-20 19:40:03,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:04,337 INFO L124 PetriNetUnfolderBase]: 364/762 cut-off events. [2024-06-20 19:40:04,337 INFO L125 PetriNetUnfolderBase]: For 44857/44857 co-relation queries the response was YES. [2024-06-20 19:40:04,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3927 conditions, 762 events. 364/762 cut-off events. For 44857/44857 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4080 event pairs, 78 based on Foata normal form. 6/764 useless extension candidates. Maximal degree in co-relation 3849. Up to 483 conditions per place. [2024-06-20 19:40:04,342 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 99 selfloop transitions, 43 changer transitions 6/152 dead transitions. [2024-06-20 19:40:04,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 152 transitions, 1530 flow [2024-06-20 19:40:04,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:40:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:40:04,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-06-20 19:40:04,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4005681818181818 [2024-06-20 19:40:04,344 INFO L175 Difference]: Start difference. First operand has 183 places, 133 transitions, 1030 flow. Second operand 11 states and 141 transitions. [2024-06-20 19:40:04,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 152 transitions, 1530 flow [2024-06-20 19:40:04,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 152 transitions, 1439 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-20 19:40:04,412 INFO L231 Difference]: Finished difference. Result has 182 places, 131 transitions, 1018 flow [2024-06-20 19:40:04,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1018, PETRI_PLACES=182, PETRI_TRANSITIONS=131} [2024-06-20 19:40:04,412 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 151 predicate places. [2024-06-20 19:40:04,413 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 131 transitions, 1018 flow [2024-06-20 19:40:04,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:40:04,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:04,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:04,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-20 19:40:04,413 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:40:04,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:04,414 INFO L85 PathProgramCache]: Analyzing trace with hash -573272219, now seen corresponding path program 15 times [2024-06-20 19:40:04,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:04,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062451034] [2024-06-20 19:40:04,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:04,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:11,397 INFO L134 CoverageAnalysis]: 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:11,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:11,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062451034] [2024-06-20 19:40:11,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062451034] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:11,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:11,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:40:11,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071197208] [2024-06-20 19:40:11,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:11,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:40:11,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:11,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:40:11,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:40:11,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:40:11,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 131 transitions, 1018 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:11,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:11,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:40:11,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:11,893 INFO L124 PetriNetUnfolderBase]: 344/721 cut-off events. [2024-06-20 19:40:11,894 INFO L125 PetriNetUnfolderBase]: For 36130/36130 co-relation queries the response was YES. [2024-06-20 19:40:11,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3542 conditions, 721 events. 344/721 cut-off events. For 36130/36130 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3763 event pairs, 68 based on Foata normal form. 4/722 useless extension candidates. Maximal degree in co-relation 3464. Up to 532 conditions per place. [2024-06-20 19:40:11,899 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 99 selfloop transitions, 43 changer transitions 0/146 dead transitions. [2024-06-20 19:40:11,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 146 transitions, 1366 flow [2024-06-20 19:40:11,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:40:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:40:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-20 19:40:11,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4147727272727273 [2024-06-20 19:40:11,900 INFO L175 Difference]: Start difference. First operand has 182 places, 131 transitions, 1018 flow. Second operand 11 states and 146 transitions. [2024-06-20 19:40:11,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 146 transitions, 1366 flow [2024-06-20 19:40:11,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 146 transitions, 1278 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-20 19:40:11,969 INFO L231 Difference]: Finished difference. Result has 181 places, 133 transitions, 1060 flow [2024-06-20 19:40:11,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1060, PETRI_PLACES=181, PETRI_TRANSITIONS=133} [2024-06-20 19:40:11,969 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 150 predicate places. [2024-06-20 19:40:11,970 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 133 transitions, 1060 flow [2024-06-20 19:40:11,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:11,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:11,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:11,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-20 19:40:11,972 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:40:11,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:11,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1677413989, now seen corresponding path program 16 times [2024-06-20 19:40:11,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:11,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079138942] [2024-06-20 19:40:11,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:11,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:40:18,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:18,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079138942] [2024-06-20 19:40:18,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079138942] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:18,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:18,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:40:18,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961252552] [2024-06-20 19:40:18,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:18,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:40:18,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:18,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:40:18,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:40:19,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:40:19,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 133 transitions, 1060 flow. Second operand has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:19,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:40:19,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:19,506 INFO L124 PetriNetUnfolderBase]: 359/751 cut-off events. [2024-06-20 19:40:19,506 INFO L125 PetriNetUnfolderBase]: For 40101/40101 co-relation queries the response was YES. [2024-06-20 19:40:19,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3699 conditions, 751 events. 359/751 cut-off events. For 40101/40101 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3989 event pairs, 78 based on Foata normal form. 8/755 useless extension candidates. Maximal degree in co-relation 3622. Up to 527 conditions per place. [2024-06-20 19:40:19,512 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 92 selfloop transitions, 46 changer transitions 9/151 dead transitions. [2024-06-20 19:40:19,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 151 transitions, 1436 flow [2024-06-20 19:40:19,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:40:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:40:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 160 transitions. [2024-06-20 19:40:19,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-20 19:40:19,513 INFO L175 Difference]: Start difference. First operand has 181 places, 133 transitions, 1060 flow. Second operand 12 states and 160 transitions. [2024-06-20 19:40:19,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 151 transitions, 1436 flow [2024-06-20 19:40:19,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 151 transitions, 1324 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-20 19:40:19,583 INFO L231 Difference]: Finished difference. Result has 185 places, 132 transitions, 1039 flow [2024-06-20 19:40:19,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1039, PETRI_PLACES=185, PETRI_TRANSITIONS=132} [2024-06-20 19:40:19,583 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 154 predicate places. [2024-06-20 19:40:19,583 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 132 transitions, 1039 flow [2024-06-20 19:40:19,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:19,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:19,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-20 19:40:19,584 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:40:19,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:19,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1420913479, now seen corresponding path program 17 times [2024-06-20 19:40:19,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:19,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082364] [2024-06-20 19:40:19,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:19,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:26,824 INFO L134 CoverageAnalysis]: 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,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:26,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082364] [2024-06-20 19:40:26,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082364] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:26,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:26,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:40:26,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52572092] [2024-06-20 19:40:26,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:26,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:40:26,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:26,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:40:26,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:40:26,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:40:26,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 132 transitions, 1039 flow. Second operand has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:26,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:40:26,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:27,483 INFO L124 PetriNetUnfolderBase]: 340/718 cut-off events. [2024-06-20 19:40:27,483 INFO L125 PetriNetUnfolderBase]: For 35934/35934 co-relation queries the response was YES. [2024-06-20 19:40:27,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3258 conditions, 718 events. 340/718 cut-off events. For 35934/35934 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3812 event pairs, 76 based on Foata normal form. 8/722 useless extension candidates. Maximal degree in co-relation 3179. Up to 494 conditions per place. [2024-06-20 19:40:27,488 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 89 selfloop transitions, 45 changer transitions 9/147 dead transitions. [2024-06-20 19:40:27,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 147 transitions, 1373 flow [2024-06-20 19:40:27,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:40:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:40:27,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 159 transitions. [2024-06-20 19:40:27,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4140625 [2024-06-20 19:40:27,491 INFO L175 Difference]: Start difference. First operand has 185 places, 132 transitions, 1039 flow. Second operand 12 states and 159 transitions. [2024-06-20 19:40:27,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 147 transitions, 1373 flow [2024-06-20 19:40:27,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 147 transitions, 1271 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-20 19:40:27,595 INFO L231 Difference]: Finished difference. Result has 184 places, 128 transitions, 992 flow [2024-06-20 19:40:27,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=992, PETRI_PLACES=184, PETRI_TRANSITIONS=128} [2024-06-20 19:40:27,605 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 153 predicate places. [2024-06-20 19:40:27,605 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 128 transitions, 992 flow [2024-06-20 19:40:27,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:27,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:27,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-20 19:40:27,609 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:40:27,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:27,610 INFO L85 PathProgramCache]: Analyzing trace with hash -914966755, now seen corresponding path program 1 times [2024-06-20 19:40:27,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:27,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048070450] [2024-06-20 19:40:27,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:27,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:34,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:40:34,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:34,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048070450] [2024-06-20 19:40:34,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048070450] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:34,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:34,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:40:34,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212114832] [2024-06-20 19:40:34,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:34,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:40:34,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:34,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:40:34,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:40:34,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:40:34,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 128 transitions, 992 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:34,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:40:34,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:35,278 INFO L124 PetriNetUnfolderBase]: 331/703 cut-off events. [2024-06-20 19:40:35,279 INFO L125 PetriNetUnfolderBase]: For 32044/32044 co-relation queries the response was YES. [2024-06-20 19:40:35,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3163 conditions, 703 events. 331/703 cut-off events. For 32044/32044 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3696 event pairs, 64 based on Foata normal form. 6/705 useless extension candidates. Maximal degree in co-relation 3085. Up to 560 conditions per place. [2024-06-20 19:40:35,284 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 113 selfloop transitions, 6 changer transitions 23/146 dead transitions. [2024-06-20 19:40:35,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 146 transitions, 1330 flow [2024-06-20 19:40:35,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:40:35,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:40:35,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-20 19:40:35,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-20 19:40:35,285 INFO L175 Difference]: Start difference. First operand has 184 places, 128 transitions, 992 flow. Second operand 10 states and 126 transitions. [2024-06-20 19:40:35,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 146 transitions, 1330 flow [2024-06-20 19:40:35,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 146 transitions, 1192 flow, removed 1 selfloop flow, removed 13 redundant places. [2024-06-20 19:40:35,353 INFO L231 Difference]: Finished difference. Result has 179 places, 122 transitions, 838 flow [2024-06-20 19:40:35,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=838, PETRI_PLACES=179, PETRI_TRANSITIONS=122} [2024-06-20 19:40:35,354 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 148 predicate places. [2024-06-20 19:40:35,354 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 122 transitions, 838 flow [2024-06-20 19:40:35,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:35,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:35,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:35,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-20 19:40:35,354 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:40:35,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:35,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1509480247, now seen corresponding path program 2 times [2024-06-20 19:40:35,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:35,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983082484] [2024-06-20 19:40:35,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:35,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:42,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:40:42,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:42,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983082484] [2024-06-20 19:40:42,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983082484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:42,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:42,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:40:42,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732754537] [2024-06-20 19:40:42,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:42,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:40:42,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:42,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:40:42,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:40:42,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:40:42,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 122 transitions, 838 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:42,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:40:42,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:43,103 INFO L124 PetriNetUnfolderBase]: 307/657 cut-off events. [2024-06-20 19:40:43,103 INFO L125 PetriNetUnfolderBase]: For 31828/31828 co-relation queries the response was YES. [2024-06-20 19:40:43,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2857 conditions, 657 events. 307/657 cut-off events. For 31828/31828 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3429 event pairs, 64 based on Foata normal form. 6/660 useless extension candidates. Maximal degree in co-relation 2781. Up to 492 conditions per place. [2024-06-20 19:40:43,107 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 92 selfloop transitions, 27 changer transitions 12/135 dead transitions. [2024-06-20 19:40:43,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 135 transitions, 1141 flow [2024-06-20 19:40:43,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:40:43,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:40:43,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-20 19:40:43,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-20 19:40:43,109 INFO L175 Difference]: Start difference. First operand has 179 places, 122 transitions, 838 flow. Second operand 10 states and 130 transitions. [2024-06-20 19:40:43,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 135 transitions, 1141 flow [2024-06-20 19:40:43,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 135 transitions, 1117 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-20 19:40:43,151 INFO L231 Difference]: Finished difference. Result has 170 places, 119 transitions, 851 flow [2024-06-20 19:40:43,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=851, PETRI_PLACES=170, PETRI_TRANSITIONS=119} [2024-06-20 19:40:43,152 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 139 predicate places. [2024-06-20 19:40:43,152 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 119 transitions, 851 flow [2024-06-20 19:40:43,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:40:43,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:43,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:43,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-20 19:40:43,153 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:43,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:43,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1579443503, now seen corresponding path program 3 times [2024-06-20 19:40:43,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:43,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066804705] [2024-06-20 19:40:43,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:43,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:50,862 INFO L134 CoverageAnalysis]: 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:50,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:50,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066804705] [2024-06-20 19:40:50,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066804705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:50,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:50,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:40:50,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986174634] [2024-06-20 19:40:50,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:50,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:40:50,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:50,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:40:50,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:40:51,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:40:51,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 119 transitions, 851 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:51,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:51,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:40:51,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:51,466 INFO L124 PetriNetUnfolderBase]: 300/644 cut-off events. [2024-06-20 19:40:51,466 INFO L125 PetriNetUnfolderBase]: For 26519/26519 co-relation queries the response was YES. [2024-06-20 19:40:51,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2793 conditions, 644 events. 300/644 cut-off events. For 26519/26519 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3336 event pairs, 62 based on Foata normal form. 6/647 useless extension candidates. Maximal degree in co-relation 2721. Up to 474 conditions per place. [2024-06-20 19:40:51,471 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 90 selfloop transitions, 24 changer transitions 15/133 dead transitions. [2024-06-20 19:40:51,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 133 transitions, 1152 flow [2024-06-20 19:40:51,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:40:51,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:40:51,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-20 19:40:51,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-20 19:40:51,472 INFO L175 Difference]: Start difference. First operand has 170 places, 119 transitions, 851 flow. Second operand 10 states and 129 transitions. [2024-06-20 19:40:51,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 133 transitions, 1152 flow [2024-06-20 19:40:51,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 133 transitions, 1064 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-20 19:40:51,525 INFO L231 Difference]: Finished difference. Result has 167 places, 115 transitions, 790 flow [2024-06-20 19:40:51,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=790, PETRI_PLACES=167, PETRI_TRANSITIONS=115} [2024-06-20 19:40:51,525 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 136 predicate places. [2024-06-20 19:40:51,526 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 115 transitions, 790 flow [2024-06-20 19:40:51,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:51,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:51,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:51,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-20 19:40:51,526 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:51,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:51,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1465979499, now seen corresponding path program 4 times [2024-06-20 19:40:51,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:51,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794315108] [2024-06-20 19:40:51,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:51,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:59,205 INFO L134 CoverageAnalysis]: 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:59,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:59,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794315108] [2024-06-20 19:40:59,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794315108] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:59,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:59,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:40:59,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438444016] [2024-06-20 19:40:59,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:59,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:40:59,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:59,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:40:59,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:40:59,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:40:59,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 115 transitions, 790 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:59,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:59,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:40:59,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:59,696 INFO L124 PetriNetUnfolderBase]: 293/631 cut-off events. [2024-06-20 19:40:59,696 INFO L125 PetriNetUnfolderBase]: For 26491/26491 co-relation queries the response was YES. [2024-06-20 19:40:59,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2686 conditions, 631 events. 293/631 cut-off events. For 26491/26491 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3264 event pairs, 60 based on Foata normal form. 6/634 useless extension candidates. Maximal degree in co-relation 2615. Up to 456 conditions per place. [2024-06-20 19:40:59,700 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 91 selfloop transitions, 16 changer transitions 20/131 dead transitions. [2024-06-20 19:40:59,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 131 transitions, 1093 flow [2024-06-20 19:40:59,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:40:59,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:40:59,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-20 19:40:59,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-20 19:40:59,702 INFO L175 Difference]: Start difference. First operand has 167 places, 115 transitions, 790 flow. Second operand 10 states and 126 transitions. [2024-06-20 19:40:59,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 131 transitions, 1093 flow [2024-06-20 19:40:59,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 131 transitions, 1010 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-20 19:40:59,738 INFO L231 Difference]: Finished difference. Result has 162 places, 109 transitions, 709 flow [2024-06-20 19:40:59,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=709, PETRI_PLACES=162, PETRI_TRANSITIONS=109} [2024-06-20 19:40:59,738 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 131 predicate places. [2024-06-20 19:40:59,738 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 109 transitions, 709 flow [2024-06-20 19:40:59,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:59,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:59,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:59,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-20 19:40:59,739 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:59,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:59,739 INFO L85 PathProgramCache]: Analyzing trace with hash 228765459, now seen corresponding path program 5 times [2024-06-20 19:40:59,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:59,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670093109] [2024-06-20 19:40:59,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:59,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:05,747 INFO L134 CoverageAnalysis]: 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:05,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:05,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670093109] [2024-06-20 19:41:05,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670093109] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:05,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:05,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:41:05,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373692439] [2024-06-20 19:41:05,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:05,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:41:05,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:05,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:41:05,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:41:05,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:41:05,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 109 transitions, 709 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:05,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:05,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:41:05,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:06,112 INFO L124 PetriNetUnfolderBase]: 267/580 cut-off events. [2024-06-20 19:41:06,112 INFO L125 PetriNetUnfolderBase]: For 25400/25400 co-relation queries the response was YES. [2024-06-20 19:41:06,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 580 events. 267/580 cut-off events. For 25400/25400 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2931 event pairs, 56 based on Foata normal form. 6/585 useless extension candidates. Maximal degree in co-relation 2385. Up to 384 conditions per place. [2024-06-20 19:41:06,115 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 70 selfloop transitions, 36 changer transitions 11/121 dead transitions. [2024-06-20 19:41:06,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 121 transitions, 981 flow [2024-06-20 19:41:06,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:41:06,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:41:06,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-20 19:41:06,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39488636363636365 [2024-06-20 19:41:06,117 INFO L175 Difference]: Start difference. First operand has 162 places, 109 transitions, 709 flow. Second operand 11 states and 139 transitions. [2024-06-20 19:41:06,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 121 transitions, 981 flow [2024-06-20 19:41:06,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 121 transitions, 935 flow, removed 7 selfloop flow, removed 11 redundant places. [2024-06-20 19:41:06,158 INFO L231 Difference]: Finished difference. Result has 153 places, 105 transitions, 711 flow [2024-06-20 19:41:06,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=711, PETRI_PLACES=153, PETRI_TRANSITIONS=105} [2024-06-20 19:41:06,159 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 122 predicate places. [2024-06-20 19:41:06,159 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 105 transitions, 711 flow [2024-06-20 19:41:06,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:06,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:06,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:06,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-20 19:41:06,160 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:41:06,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:06,160 INFO L85 PathProgramCache]: Analyzing trace with hash 867184241, now seen corresponding path program 6 times [2024-06-20 19:41:06,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:06,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20047389] [2024-06-20 19:41:06,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:06,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:41:12,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:12,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20047389] [2024-06-20 19:41:12,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20047389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:12,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:12,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:41:12,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073809754] [2024-06-20 19:41:12,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:12,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:41:12,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:12,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:41:12,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:41:12,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:41:12,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 105 transitions, 711 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:12,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:41:12,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:12,634 INFO L124 PetriNetUnfolderBase]: 266/575 cut-off events. [2024-06-20 19:41:12,634 INFO L125 PetriNetUnfolderBase]: For 21692/21698 co-relation queries the response was YES. [2024-06-20 19:41:12,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2419 conditions, 575 events. 266/575 cut-off events. For 21692/21698 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2884 event pairs, 56 based on Foata normal form. 10/584 useless extension candidates. Maximal degree in co-relation 2355. Up to 386 conditions per place. [2024-06-20 19:41:12,638 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 71 selfloop transitions, 36 changer transitions 10/121 dead transitions. [2024-06-20 19:41:12,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 121 transitions, 1013 flow [2024-06-20 19:41:12,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:41:12,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:41:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-20 19:41:12,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39488636363636365 [2024-06-20 19:41:12,639 INFO L175 Difference]: Start difference. First operand has 153 places, 105 transitions, 711 flow. Second operand 11 states and 139 transitions. [2024-06-20 19:41:12,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 121 transitions, 1013 flow [2024-06-20 19:41:12,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 121 transitions, 923 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-20 19:41:12,674 INFO L231 Difference]: Finished difference. Result has 150 places, 106 transitions, 719 flow [2024-06-20 19:41:12,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=719, PETRI_PLACES=150, PETRI_TRANSITIONS=106} [2024-06-20 19:41:12,674 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 119 predicate places. [2024-06-20 19:41:12,675 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 106 transitions, 719 flow [2024-06-20 19:41:12,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:12,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:12,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-20 19:41:12,675 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:41:12,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:12,676 INFO L85 PathProgramCache]: Analyzing trace with hash 860755151, now seen corresponding path program 7 times [2024-06-20 19:41:12,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:12,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414460046] [2024-06-20 19:41:12,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:12,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:19,533 INFO L134 CoverageAnalysis]: 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:19,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:19,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414460046] [2024-06-20 19:41:19,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414460046] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:19,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:19,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:41:19,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222208277] [2024-06-20 19:41:19,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:19,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:41:19,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:19,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:41:19,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:41:19,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:41:19,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 106 transitions, 719 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:19,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:41:19,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:20,095 INFO L124 PetriNetUnfolderBase]: 267/578 cut-off events. [2024-06-20 19:41:20,096 INFO L125 PetriNetUnfolderBase]: For 20881/20881 co-relation queries the response was YES. [2024-06-20 19:41:20,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2393 conditions, 578 events. 267/578 cut-off events. For 20881/20881 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2920 event pairs, 56 based on Foata normal form. 6/583 useless extension candidates. Maximal degree in co-relation 2329. Up to 384 conditions per place. [2024-06-20 19:41:20,098 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 70 selfloop transitions, 34 changer transitions 13/121 dead transitions. [2024-06-20 19:41:20,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 121 transitions, 999 flow [2024-06-20 19:41:20,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:41:20,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:41:20,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-20 19:41:20,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39488636363636365 [2024-06-20 19:41:20,100 INFO L175 Difference]: Start difference. First operand has 150 places, 106 transitions, 719 flow. Second operand 11 states and 139 transitions. [2024-06-20 19:41:20,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 121 transitions, 999 flow [2024-06-20 19:41:20,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 121 transitions, 932 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-20 19:41:20,141 INFO L231 Difference]: Finished difference. Result has 153 places, 104 transitions, 709 flow [2024-06-20 19:41:20,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=709, PETRI_PLACES=153, PETRI_TRANSITIONS=104} [2024-06-20 19:41:20,142 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 122 predicate places. [2024-06-20 19:41:20,142 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 104 transitions, 709 flow [2024-06-20 19:41:20,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:20,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:20,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:20,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-20 19:41:20,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:41:20,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:20,143 INFO L85 PathProgramCache]: Analyzing trace with hash -863740721, now seen corresponding path program 8 times [2024-06-20 19:41:20,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:20,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879447333] [2024-06-20 19:41:20,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:20,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:26,900 INFO L134 CoverageAnalysis]: 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,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:26,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879447333] [2024-06-20 19:41:26,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879447333] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:26,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:26,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:41:26,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233004385] [2024-06-20 19:41:26,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:26,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:41:26,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:26,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:41:26,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:41:27,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-20 19:41:27,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 104 transitions, 709 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call 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,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:27,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-20 19:41:27,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:27,550 INFO L124 PetriNetUnfolderBase]: 265/574 cut-off events. [2024-06-20 19:41:27,551 INFO L125 PetriNetUnfolderBase]: For 20877/20877 co-relation queries the response was YES. [2024-06-20 19:41:27,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2396 conditions, 574 events. 265/574 cut-off events. For 20877/20877 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2894 event pairs, 56 based on Foata normal form. 6/579 useless extension candidates. Maximal degree in co-relation 2331. Up to 378 conditions per place. [2024-06-20 19:41:27,554 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 73 selfloop transitions, 35 changer transitions 9/121 dead transitions. [2024-06-20 19:41:27,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 121 transitions, 1007 flow [2024-06-20 19:41:27,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:41:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:41:27,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-20 19:41:27,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42329545454545453 [2024-06-20 19:41:27,555 INFO L175 Difference]: Start difference. First operand has 153 places, 104 transitions, 709 flow. Second operand 11 states and 149 transitions. [2024-06-20 19:41:27,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 121 transitions, 1007 flow [2024-06-20 19:41:27,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 121 transitions, 917 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-20 19:41:27,592 INFO L231 Difference]: Finished difference. Result has 151 places, 105 transitions, 714 flow [2024-06-20 19:41:27,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=714, PETRI_PLACES=151, PETRI_TRANSITIONS=105} [2024-06-20 19:41:27,593 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 120 predicate places. [2024-06-20 19:41:27,593 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 105 transitions, 714 flow [2024-06-20 19:41:27,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call 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,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:27,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:27,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-20 19:41:27,593 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:41:27,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:27,594 INFO L85 PathProgramCache]: Analyzing trace with hash 891082097, now seen corresponding path program 9 times [2024-06-20 19:41:27,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:27,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817850460] [2024-06-20 19:41:27,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:27,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:41:34,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:34,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817850460] [2024-06-20 19:41:34,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817850460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:34,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:34,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:41:34,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021786184] [2024-06-20 19:41:34,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:34,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:41:34,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:34,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:41:34,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:41:34,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-20 19:41:34,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 105 transitions, 714 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call 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,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:34,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-20 19:41:34,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:34,578 INFO L124 PetriNetUnfolderBase]: 255/556 cut-off events. [2024-06-20 19:41:34,578 INFO L125 PetriNetUnfolderBase]: For 20933/20933 co-relation queries the response was YES. [2024-06-20 19:41:34,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2344 conditions, 556 events. 255/556 cut-off events. For 20933/20933 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2777 event pairs, 52 based on Foata normal form. 6/561 useless extension candidates. Maximal degree in co-relation 2279. Up to 360 conditions per place. [2024-06-20 19:41:34,581 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 71 selfloop transitions, 34 changer transitions 9/118 dead transitions. [2024-06-20 19:41:34,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 118 transitions, 980 flow [2024-06-20 19:41:34,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:41:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:41:34,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2024-06-20 19:41:34,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4289772727272727 [2024-06-20 19:41:34,583 INFO L175 Difference]: Start difference. First operand has 151 places, 105 transitions, 714 flow. Second operand 11 states and 151 transitions. [2024-06-20 19:41:34,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 118 transitions, 980 flow [2024-06-20 19:41:34,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 118 transitions, 939 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-20 19:41:34,621 INFO L231 Difference]: Finished difference. Result has 154 places, 102 transitions, 726 flow [2024-06-20 19:41:34,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=726, PETRI_PLACES=154, PETRI_TRANSITIONS=102} [2024-06-20 19:41:34,621 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 123 predicate places. [2024-06-20 19:41:34,621 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 102 transitions, 726 flow [2024-06-20 19:41:34,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call 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,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:34,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:34,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-20 19:41:34,637 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:41:34,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:34,637 INFO L85 PathProgramCache]: Analyzing trace with hash 649245777, now seen corresponding path program 10 times [2024-06-20 19:41:34,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:34,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601475581] [2024-06-20 19:41:34,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:34,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:41:41,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:41,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601475581] [2024-06-20 19:41:41,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601475581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:41,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:41,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:41:41,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962178505] [2024-06-20 19:41:41,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:41,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:41:41,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:41,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:41:41,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:41:41,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-20 19:41:41,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 102 transitions, 726 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call 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,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:41,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-20 19:41:41,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:41,701 INFO L124 PetriNetUnfolderBase]: 245/538 cut-off events. [2024-06-20 19:41:41,701 INFO L125 PetriNetUnfolderBase]: For 21037/21043 co-relation queries the response was YES. [2024-06-20 19:41:41,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2311 conditions, 538 events. 245/538 cut-off events. For 21037/21043 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2667 event pairs, 54 based on Foata normal form. 10/547 useless extension candidates. Maximal degree in co-relation 2247. Up to 356 conditions per place. [2024-06-20 19:41:41,705 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 67 selfloop transitions, 31 changer transitions 12/114 dead transitions. [2024-06-20 19:41:41,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 114 transitions, 982 flow [2024-06-20 19:41:41,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:41:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:41:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2024-06-20 19:41:41,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2024-06-20 19:41:41,706 INFO L175 Difference]: Start difference. First operand has 154 places, 102 transitions, 726 flow. Second operand 11 states and 148 transitions. [2024-06-20 19:41:41,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 114 transitions, 982 flow [2024-06-20 19:41:41,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 114 transitions, 849 flow, removed 5 selfloop flow, removed 15 redundant places. [2024-06-20 19:41:41,737 INFO L231 Difference]: Finished difference. Result has 146 places, 98 transitions, 636 flow [2024-06-20 19:41:41,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=636, PETRI_PLACES=146, PETRI_TRANSITIONS=98} [2024-06-20 19:41:41,738 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 115 predicate places. [2024-06-20 19:41:41,738 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 98 transitions, 636 flow [2024-06-20 19:41:41,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call 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,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:41,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:41,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-20 19:41:41,739 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:41,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:41,739 INFO L85 PathProgramCache]: Analyzing trace with hash 720379667, now seen corresponding path program 11 times [2024-06-20 19:41:41,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:41,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183960190] [2024-06-20 19:41:41,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:41,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:48,651 INFO L134 CoverageAnalysis]: 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,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:48,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183960190] [2024-06-20 19:41:48,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183960190] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:48,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:48,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:41:48,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73292427] [2024-06-20 19:41:48,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:48,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:41:48,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:48,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:41:48,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:41:48,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-20 19:41:48,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 98 transitions, 636 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call 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,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:48,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-20 19:41:48,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:49,075 INFO L124 PetriNetUnfolderBase]: 241/530 cut-off events. [2024-06-20 19:41:49,076 INFO L125 PetriNetUnfolderBase]: For 19017/19023 co-relation queries the response was YES. [2024-06-20 19:41:49,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2187 conditions, 530 events. 241/530 cut-off events. For 19017/19023 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2622 event pairs, 52 based on Foata normal form. 10/539 useless extension candidates. Maximal degree in co-relation 2127. Up to 338 conditions per place. [2024-06-20 19:41:49,079 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 64 selfloop transitions, 26 changer transitions 19/113 dead transitions. [2024-06-20 19:41:49,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 113 transitions, 897 flow [2024-06-20 19:41:49,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:41:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:41:49,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-20 19:41:49,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42329545454545453 [2024-06-20 19:41:49,100 INFO L175 Difference]: Start difference. First operand has 146 places, 98 transitions, 636 flow. Second operand 11 states and 149 transitions. [2024-06-20 19:41:49,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 113 transitions, 897 flow [2024-06-20 19:41:49,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 113 transitions, 829 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-20 19:41:49,135 INFO L231 Difference]: Finished difference. Result has 143 places, 91 transitions, 583 flow [2024-06-20 19:41:49,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=583, PETRI_PLACES=143, PETRI_TRANSITIONS=91} [2024-06-20 19:41:49,135 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 112 predicate places. [2024-06-20 19:41:49,136 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 91 transitions, 583 flow [2024-06-20 19:41:49,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call 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,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:49,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:49,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-20 19:41:49,136 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:49,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:49,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1768898987, now seen corresponding path program 12 times [2024-06-20 19:41:49,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:49,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571677506] [2024-06-20 19:41:49,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:49,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:56,036 INFO L134 CoverageAnalysis]: 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:56,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:56,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571677506] [2024-06-20 19:41:56,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571677506] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:56,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:56,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:41:56,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036435612] [2024-06-20 19:41:56,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:56,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:41:56,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:56,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:41:56,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:41:56,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-20 19:41:56,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 91 transitions, 583 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call 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,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:56,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-20 19:41:56,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:56,550 INFO L124 PetriNetUnfolderBase]: 220/489 cut-off events. [2024-06-20 19:41:56,550 INFO L125 PetriNetUnfolderBase]: For 18973/18979 co-relation queries the response was YES. [2024-06-20 19:41:56,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2060 conditions, 489 events. 220/489 cut-off events. For 18973/18979 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2370 event pairs, 52 based on Foata normal form. 10/498 useless extension candidates. Maximal degree in co-relation 1999. Up to 328 conditions per place. [2024-06-20 19:41:56,554 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 59 selfloop transitions, 28 changer transitions 12/103 dead transitions. [2024-06-20 19:41:56,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 103 transitions, 817 flow [2024-06-20 19:41:56,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:41:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:41:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-20 19:41:56,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4147727272727273 [2024-06-20 19:41:56,555 INFO L175 Difference]: Start difference. First operand has 143 places, 91 transitions, 583 flow. Second operand 11 states and 146 transitions. [2024-06-20 19:41:56,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 103 transitions, 817 flow [2024-06-20 19:41:56,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 103 transitions, 759 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-20 19:41:56,580 INFO L231 Difference]: Finished difference. Result has 138 places, 87 transitions, 564 flow [2024-06-20 19:41:56,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=564, PETRI_PLACES=138, PETRI_TRANSITIONS=87} [2024-06-20 19:41:56,580 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 107 predicate places. [2024-06-20 19:41:56,580 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 87 transitions, 564 flow [2024-06-20 19:41:56,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call 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,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:56,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:56,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-20 19:41:56,581 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:56,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:56,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1598023577, now seen corresponding path program 13 times [2024-06-20 19:41:56,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:56,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764744888] [2024-06-20 19:41:56,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:56,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:03,741 INFO L134 CoverageAnalysis]: 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:03,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:03,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764744888] [2024-06-20 19:42:03,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764744888] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:03,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:03,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:42:03,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539070636] [2024-06-20 19:42:03,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:03,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:42:03,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:03,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:42:03,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:42:03,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-20 19:42:03,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 87 transitions, 564 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call 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,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:03,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-20 19:42:03,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:04,276 INFO L124 PetriNetUnfolderBase]: 212/473 cut-off events. [2024-06-20 19:42:04,276 INFO L125 PetriNetUnfolderBase]: For 18116/18122 co-relation queries the response was YES. [2024-06-20 19:42:04,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2004 conditions, 473 events. 212/473 cut-off events. For 18116/18122 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2256 event pairs, 48 based on Foata normal form. 10/482 useless extension candidates. Maximal degree in co-relation 1945. Up to 302 conditions per place. [2024-06-20 19:42:04,278 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 55 selfloop transitions, 24 changer transitions 18/101 dead transitions. [2024-06-20 19:42:04,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 101 transitions, 798 flow [2024-06-20 19:42:04,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:42:04,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:42:04,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-20 19:42:04,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41761363636363635 [2024-06-20 19:42:04,279 INFO L175 Difference]: Start difference. First operand has 138 places, 87 transitions, 564 flow. Second operand 11 states and 147 transitions. [2024-06-20 19:42:04,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 101 transitions, 798 flow [2024-06-20 19:42:04,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 101 transitions, 730 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-20 19:42:04,298 INFO L231 Difference]: Finished difference. Result has 132 places, 80 transitions, 506 flow [2024-06-20 19:42:04,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=506, PETRI_PLACES=132, PETRI_TRANSITIONS=80} [2024-06-20 19:42:04,298 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 101 predicate places. [2024-06-20 19:42:04,298 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 80 transitions, 506 flow [2024-06-20 19:42:04,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call 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,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:04,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:04,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-20 19:42:04,299 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:42:04,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:04,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1487795703, now seen corresponding path program 14 times [2024-06-20 19:42:04,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:04,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854963285] [2024-06-20 19:42:04,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:04,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:42:10,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:10,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854963285] [2024-06-20 19:42:10,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854963285] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:10,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:10,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:42:10,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307952713] [2024-06-20 19:42:10,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:10,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:42:10,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:10,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:42:10,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:42:11,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-20 19:42:11,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 80 transitions, 506 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:42:11,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:11,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-20 19:42:11,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:11,366 INFO L124 PetriNetUnfolderBase]: 193/440 cut-off events. [2024-06-20 19:42:11,367 INFO L125 PetriNetUnfolderBase]: For 16436/16436 co-relation queries the response was YES. [2024-06-20 19:42:11,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1860 conditions, 440 events. 193/440 cut-off events. For 16436/16436 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2056 event pairs, 33 based on Foata normal form. 6/445 useless extension candidates. Maximal degree in co-relation 1803. Up to 162 conditions per place. [2024-06-20 19:42:11,369 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 40 selfloop transitions, 28 changer transitions 23/95 dead transitions. [2024-06-20 19:42:11,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 95 transitions, 730 flow [2024-06-20 19:42:11,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:42:11,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:42:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-20 19:42:11,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4147727272727273 [2024-06-20 19:42:11,370 INFO L175 Difference]: Start difference. First operand has 132 places, 80 transitions, 506 flow. Second operand 11 states and 146 transitions. [2024-06-20 19:42:11,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 95 transitions, 730 flow [2024-06-20 19:42:11,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 95 transitions, 674 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-20 19:42:11,388 INFO L231 Difference]: Finished difference. Result has 125 places, 67 transitions, 431 flow [2024-06-20 19:42:11,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=431, PETRI_PLACES=125, PETRI_TRANSITIONS=67} [2024-06-20 19:42:11,389 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 94 predicate places. [2024-06-20 19:42:11,389 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 67 transitions, 431 flow [2024-06-20 19:42:11,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:42:11,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:11,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:11,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-20 19:42:11,390 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:42:11,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:11,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1442813167, now seen corresponding path program 15 times [2024-06-20 19:42:11,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:11,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307454037] [2024-06-20 19:42:11,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:11,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:17,689 INFO L134 CoverageAnalysis]: 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,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:17,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307454037] [2024-06-20 19:42:17,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307454037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:17,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:17,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:42:17,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885185697] [2024-06-20 19:42:17,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:17,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:42:17,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:17,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:42:17,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:42:17,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:42:17,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 67 transitions, 431 flow. Second operand has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:17,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:42:17,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:18,330 INFO L124 PetriNetUnfolderBase]: 158/353 cut-off events. [2024-06-20 19:42:18,331 INFO L125 PetriNetUnfolderBase]: For 14004/14004 co-relation queries the response was YES. [2024-06-20 19:42:18,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1591 conditions, 353 events. 158/353 cut-off events. For 14004/14004 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1584 event pairs, 39 based on Foata normal form. 6/359 useless extension candidates. Maximal degree in co-relation 1548. Up to 246 conditions per place. [2024-06-20 19:42:18,333 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 47 selfloop transitions, 19 changer transitions 10/80 dead transitions. [2024-06-20 19:42:18,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 80 transitions, 621 flow [2024-06-20 19:42:18,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:42:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:42:18,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2024-06-20 19:42:18,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-20 19:42:18,334 INFO L175 Difference]: Start difference. First operand has 125 places, 67 transitions, 431 flow. Second operand 12 states and 144 transitions. [2024-06-20 19:42:18,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 80 transitions, 621 flow [2024-06-20 19:42:18,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 80 transitions, 540 flow, removed 8 selfloop flow, removed 17 redundant places. [2024-06-20 19:42:18,347 INFO L231 Difference]: Finished difference. Result has 107 places, 64 transitions, 377 flow [2024-06-20 19:42:18,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=377, PETRI_PLACES=107, PETRI_TRANSITIONS=64} [2024-06-20 19:42:18,348 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 76 predicate places. [2024-06-20 19:42:18,348 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 64 transitions, 377 flow [2024-06-20 19:42:18,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:18,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:18,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-20 19:42:18,349 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:42:18,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:18,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1098399799, now seen corresponding path program 16 times [2024-06-20 19:42:18,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:18,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897067243] [2024-06-20 19:42:18,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:18,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:25,264 INFO L134 CoverageAnalysis]: 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:25,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:25,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897067243] [2024-06-20 19:42:25,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897067243] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:25,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:25,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:42:25,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327048786] [2024-06-20 19:42:25,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:25,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:42:25,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:25,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:42:25,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:42:25,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:42:25,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 64 transitions, 377 flow. Second operand has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:25,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:42:25,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:25,820 INFO L124 PetriNetUnfolderBase]: 151/338 cut-off events. [2024-06-20 19:42:25,820 INFO L125 PetriNetUnfolderBase]: For 9880/9884 co-relation queries the response was YES. [2024-06-20 19:42:25,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1420 conditions, 338 events. 151/338 cut-off events. For 9880/9884 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1483 event pairs, 39 based on Foata normal form. 6/344 useless extension candidates. Maximal degree in co-relation 1384. Up to 236 conditions per place. [2024-06-20 19:42:25,822 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 46 selfloop transitions, 17 changer transitions 10/77 dead transitions. [2024-06-20 19:42:25,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 77 transitions, 561 flow [2024-06-20 19:42:25,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:42:25,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:42:25,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2024-06-20 19:42:25,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3723958333333333 [2024-06-20 19:42:25,823 INFO L175 Difference]: Start difference. First operand has 107 places, 64 transitions, 377 flow. Second operand 12 states and 143 transitions. [2024-06-20 19:42:25,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 77 transitions, 561 flow [2024-06-20 19:42:25,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 77 transitions, 519 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-20 19:42:25,833 INFO L231 Difference]: Finished difference. Result has 104 places, 61 transitions, 358 flow [2024-06-20 19:42:25,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=358, PETRI_PLACES=104, PETRI_TRANSITIONS=61} [2024-06-20 19:42:25,840 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 73 predicate places. [2024-06-20 19:42:25,840 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 61 transitions, 358 flow [2024-06-20 19:42:25,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:25,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:25,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-20 19:42:25,841 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:42:25,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:25,841 INFO L85 PathProgramCache]: Analyzing trace with hash -551226245, now seen corresponding path program 17 times [2024-06-20 19:42:25,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:25,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96036643] [2024-06-20 19:42:25,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:25,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:32,722 INFO L134 CoverageAnalysis]: 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,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:32,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96036643] [2024-06-20 19:42:32,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96036643] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:32,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:32,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:42:32,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393128255] [2024-06-20 19:42:32,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:32,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:42:32,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:32,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:42:32,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:42:32,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:42:32,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 61 transitions, 358 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:32,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:42:32,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:33,015 INFO L124 PetriNetUnfolderBase]: 144/325 cut-off events. [2024-06-20 19:42:33,015 INFO L125 PetriNetUnfolderBase]: For 9273/9277 co-relation queries the response was YES. [2024-06-20 19:42:33,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 325 events. 144/325 cut-off events. For 9273/9277 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1419 event pairs, 39 based on Foata normal form. 10/335 useless extension candidates. Maximal degree in co-relation 1330. Up to 226 conditions per place. [2024-06-20 19:42:33,017 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 41 selfloop transitions, 18 changer transitions 10/73 dead transitions. [2024-06-20 19:42:33,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 73 transitions, 532 flow [2024-06-20 19:42:33,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:42:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:42:33,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-20 19:42:33,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-20 19:42:33,018 INFO L175 Difference]: Start difference. First operand has 104 places, 61 transitions, 358 flow. Second operand 11 states and 134 transitions. [2024-06-20 19:42:33,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 73 transitions, 532 flow [2024-06-20 19:42:33,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 73 transitions, 494 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-20 19:42:33,027 INFO L231 Difference]: Finished difference. Result has 100 places, 58 transitions, 345 flow [2024-06-20 19:42:33,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=345, PETRI_PLACES=100, PETRI_TRANSITIONS=58} [2024-06-20 19:42:33,028 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 69 predicate places. [2024-06-20 19:42:33,028 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 58 transitions, 345 flow [2024-06-20 19:42:33,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:33,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:33,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-20 19:42:33,029 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:42:33,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:33,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1189886153, now seen corresponding path program 18 times [2024-06-20 19:42:33,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:33,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131269818] [2024-06-20 19:42:33,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:33,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:42:40,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:40,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131269818] [2024-06-20 19:42:40,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131269818] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:40,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:40,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:42:40,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692851657] [2024-06-20 19:42:40,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:40,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:42:40,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:40,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:42:40,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:42:40,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:42:40,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 58 transitions, 345 flow. Second operand has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:40,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:42:40,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:41,119 INFO L124 PetriNetUnfolderBase]: 137/310 cut-off events. [2024-06-20 19:42:41,119 INFO L125 PetriNetUnfolderBase]: For 8658/8658 co-relation queries the response was YES. [2024-06-20 19:42:41,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 310 events. 137/310 cut-off events. For 8658/8658 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1314 event pairs, 37 based on Foata normal form. 6/316 useless extension candidates. Maximal degree in co-relation 1280. Up to 208 conditions per place. [2024-06-20 19:42:41,121 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 41 selfloop transitions, 14 changer transitions 13/72 dead transitions. [2024-06-20 19:42:41,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 72 transitions, 521 flow [2024-06-20 19:42:41,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:42:41,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:42:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2024-06-20 19:42:41,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3723958333333333 [2024-06-20 19:42:41,122 INFO L175 Difference]: Start difference. First operand has 100 places, 58 transitions, 345 flow. Second operand 12 states and 143 transitions. [2024-06-20 19:42:41,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 72 transitions, 521 flow [2024-06-20 19:42:41,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 72 transitions, 481 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-20 19:42:41,131 INFO L231 Difference]: Finished difference. Result has 98 places, 54 transitions, 318 flow [2024-06-20 19:42:41,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=318, PETRI_PLACES=98, PETRI_TRANSITIONS=54} [2024-06-20 19:42:41,132 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 67 predicate places. [2024-06-20 19:42:41,132 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 54 transitions, 318 flow [2024-06-20 19:42:41,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call 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,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:41,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:41,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-20 19:42:41,132 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:41,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:41,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1774614651, now seen corresponding path program 19 times [2024-06-20 19:42:41,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:41,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965131398] [2024-06-20 19:42:41,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:41,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:47,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:42:47,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:47,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965131398] [2024-06-20 19:42:47,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965131398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:47,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:47,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:42:47,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692253206] [2024-06-20 19:42:47,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:47,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:42:47,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:47,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:42:47,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:42:47,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:42:47,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 54 transitions, 318 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:47,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:47,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:42:47,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:48,187 INFO L124 PetriNetUnfolderBase]: 126/287 cut-off events. [2024-06-20 19:42:48,188 INFO L125 PetriNetUnfolderBase]: For 8083/8087 co-relation queries the response was YES. [2024-06-20 19:42:48,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 287 events. 126/287 cut-off events. For 8083/8087 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1193 event pairs, 37 based on Foata normal form. 10/297 useless extension candidates. Maximal degree in co-relation 1200. Up to 198 conditions per place. [2024-06-20 19:42:48,189 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 38 selfloop transitions, 14 changer transitions 10/66 dead transitions. [2024-06-20 19:42:48,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 66 transitions, 478 flow [2024-06-20 19:42:48,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:42:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:42:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-20 19:42:48,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-20 19:42:48,190 INFO L175 Difference]: Start difference. First operand has 98 places, 54 transitions, 318 flow. Second operand 11 states and 134 transitions. [2024-06-20 19:42:48,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 66 transitions, 478 flow [2024-06-20 19:42:48,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 66 transitions, 444 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-20 19:42:48,198 INFO L231 Difference]: Finished difference. Result has 92 places, 51 transitions, 301 flow [2024-06-20 19:42:48,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=301, PETRI_PLACES=92, PETRI_TRANSITIONS=51} [2024-06-20 19:42:48,198 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 61 predicate places. [2024-06-20 19:42:48,198 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 51 transitions, 301 flow [2024-06-20 19:42:48,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:48,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:48,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-20 19:42:48,199 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:48,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:48,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1768185561, now seen corresponding path program 20 times [2024-06-20 19:42:48,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:48,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036635631] [2024-06-20 19:42:48,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:48,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:42:54,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:54,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036635631] [2024-06-20 19:42:54,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036635631] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:54,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:54,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:42:54,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561172066] [2024-06-20 19:42:54,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:54,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:42:54,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:54,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:42:54,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:42:54,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:42:54,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 51 transitions, 301 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:42:54,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:54,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:42:54,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:54,948 INFO L124 PetriNetUnfolderBase]: 119/274 cut-off events. [2024-06-20 19:42:54,949 INFO L125 PetriNetUnfolderBase]: For 7007/7011 co-relation queries the response was YES. [2024-06-20 19:42:54,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 274 events. 119/274 cut-off events. For 7007/7011 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1128 event pairs, 35 based on Foata normal form. 10/284 useless extension candidates. Maximal degree in co-relation 1136. Up to 180 conditions per place. [2024-06-20 19:42:54,950 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 35 selfloop transitions, 12 changer transitions 13/64 dead transitions. [2024-06-20 19:42:54,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 64 transitions, 459 flow [2024-06-20 19:42:54,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:42:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:42:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-20 19:42:54,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-20 19:42:54,951 INFO L175 Difference]: Start difference. First operand has 92 places, 51 transitions, 301 flow. Second operand 11 states and 134 transitions. [2024-06-20 19:42:54,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 64 transitions, 459 flow [2024-06-20 19:42:54,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 64 transitions, 427 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-20 19:42:54,957 INFO L231 Difference]: Finished difference. Result has 89 places, 47 transitions, 276 flow [2024-06-20 19:42:54,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=276, PETRI_PLACES=89, PETRI_TRANSITIONS=47} [2024-06-20 19:42:54,958 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 58 predicate places. [2024-06-20 19:42:54,958 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 47 transitions, 276 flow [2024-06-20 19:42:54,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:42:54,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:54,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:54,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-20 19:42:54,959 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:54,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:54,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1804941597, now seen corresponding path program 21 times [2024-06-20 19:42:54,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:54,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765865774] [2024-06-20 19:42:54,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:54,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:02,406 INFO L134 CoverageAnalysis]: 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:02,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:02,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765865774] [2024-06-20 19:43:02,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765865774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:02,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:02,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:43:02,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132967809] [2024-06-20 19:43:02,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:02,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:43:02,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:02,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:43:02,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:43:02,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:43:02,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 47 transitions, 276 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:02,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:02,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:43:02,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:02,756 INFO L124 PetriNetUnfolderBase]: 108/251 cut-off events. [2024-06-20 19:43:02,756 INFO L125 PetriNetUnfolderBase]: For 6472/6472 co-relation queries the response was YES. [2024-06-20 19:43:02,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 251 events. 108/251 cut-off events. For 6472/6472 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 988 event pairs, 35 based on Foata normal form. 6/257 useless extension candidates. Maximal degree in co-relation 1058. Up to 170 conditions per place. [2024-06-20 19:43:02,757 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 34 selfloop transitions, 11 changer transitions 10/59 dead transitions. [2024-06-20 19:43:02,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 59 transitions, 422 flow [2024-06-20 19:43:02,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:43:02,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:43:02,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-20 19:43:02,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-20 19:43:02,758 INFO L175 Difference]: Start difference. First operand has 89 places, 47 transitions, 276 flow. Second operand 11 states and 131 transitions. [2024-06-20 19:43:02,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 59 transitions, 422 flow [2024-06-20 19:43:02,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 59 transitions, 390 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-20 19:43:02,763 INFO L231 Difference]: Finished difference. Result has 83 places, 44 transitions, 255 flow [2024-06-20 19:43:02,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=255, PETRI_PLACES=83, PETRI_TRANSITIONS=44} [2024-06-20 19:43:02,764 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 52 predicate places. [2024-06-20 19:43:02,764 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 44 transitions, 255 flow [2024-06-20 19:43:02,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:02,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:02,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:02,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-20 19:43:02,764 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:43:02,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:02,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1632278727, now seen corresponding path program 22 times [2024-06-20 19:43:02,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:02,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216169366] [2024-06-20 19:43:02,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:02,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:09,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:43:09,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:09,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216169366] [2024-06-20 19:43:09,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216169366] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:09,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:09,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:43:09,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824124304] [2024-06-20 19:43:09,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:09,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:43:09,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:09,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:43:09,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:43:09,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:43:09,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 44 transitions, 255 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:09,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:09,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:43:09,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:09,662 INFO L124 PetriNetUnfolderBase]: 101/238 cut-off events. [2024-06-20 19:43:09,663 INFO L125 PetriNetUnfolderBase]: For 5061/5061 co-relation queries the response was YES. [2024-06-20 19:43:09,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 238 events. 101/238 cut-off events. For 5061/5061 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 915 event pairs, 33 based on Foata normal form. 6/244 useless extension candidates. Maximal degree in co-relation 978. Up to 152 conditions per place. [2024-06-20 19:43:09,664 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 31 selfloop transitions, 9 changer transitions 13/57 dead transitions. [2024-06-20 19:43:09,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 57 transitions, 399 flow [2024-06-20 19:43:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:43:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:43:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-20 19:43:09,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-20 19:43:09,665 INFO L175 Difference]: Start difference. First operand has 83 places, 44 transitions, 255 flow. Second operand 11 states and 131 transitions. [2024-06-20 19:43:09,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 57 transitions, 399 flow [2024-06-20 19:43:09,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 57 transitions, 373 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-20 19:43:09,669 INFO L231 Difference]: Finished difference. Result has 80 places, 40 transitions, 232 flow [2024-06-20 19:43:09,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=232, PETRI_PLACES=80, PETRI_TRANSITIONS=40} [2024-06-20 19:43:09,670 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 49 predicate places. [2024-06-20 19:43:09,670 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 40 transitions, 232 flow [2024-06-20 19:43:09,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:09,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:09,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:09,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-20 19:43:09,671 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:43:09,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:09,671 INFO L85 PathProgramCache]: Analyzing trace with hash -385300357, now seen corresponding path program 23 times [2024-06-20 19:43:09,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:09,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745898904] [2024-06-20 19:43:09,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:09,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:18,530 INFO L134 CoverageAnalysis]: 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,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:18,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745898904] [2024-06-20 19:43:18,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745898904] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:18,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:18,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:43:18,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073023998] [2024-06-20 19:43:18,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:18,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:43:18,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:18,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:43:18,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:43:18,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:43:18,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 40 transitions, 232 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:18,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:43:18,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:18,852 INFO L124 PetriNetUnfolderBase]: 75/184 cut-off events. [2024-06-20 19:43:18,852 INFO L125 PetriNetUnfolderBase]: For 3328/3328 co-relation queries the response was YES. [2024-06-20 19:43:18,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 184 events. 75/184 cut-off events. For 3328/3328 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 625 event pairs, 16 based on Foata normal form. 6/190 useless extension candidates. Maximal degree in co-relation 670. Up to 93 conditions per place. [2024-06-20 19:43:18,853 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 26 selfloop transitions, 7 changer transitions 16/53 dead transitions. [2024-06-20 19:43:18,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 53 transitions, 356 flow [2024-06-20 19:43:18,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:43:18,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:43:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-20 19:43:18,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-20 19:43:18,854 INFO L175 Difference]: Start difference. First operand has 80 places, 40 transitions, 232 flow. Second operand 11 states and 128 transitions. [2024-06-20 19:43:18,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 53 transitions, 356 flow [2024-06-20 19:43:18,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 53 transitions, 330 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-20 19:43:18,858 INFO L231 Difference]: Finished difference. Result has 74 places, 34 transitions, 187 flow [2024-06-20 19:43:18,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=187, PETRI_PLACES=74, PETRI_TRANSITIONS=34} [2024-06-20 19:43:18,864 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 43 predicate places. [2024-06-20 19:43:18,864 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 34 transitions, 187 flow [2024-06-20 19:43:18,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:18,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:18,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-20 19:43:18,865 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:43:18,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:18,865 INFO L85 PathProgramCache]: Analyzing trace with hash 963417478, now seen corresponding path program 1 times [2024-06-20 19:43:18,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:18,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898002456] [2024-06-20 19:43:18,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:18,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:43:27,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:27,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898002456] [2024-06-20 19:43:27,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898002456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:27,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:27,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:43:27,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355536866] [2024-06-20 19:43:27,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:27,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:43:27,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:27,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:43:27,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:43:28,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:43:28,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 34 transitions, 187 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:28,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:28,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:43:28,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:28,295 INFO L124 PetriNetUnfolderBase]: 48/125 cut-off events. [2024-06-20 19:43:28,295 INFO L125 PetriNetUnfolderBase]: For 1513/1513 co-relation queries the response was YES. [2024-06-20 19:43:28,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 125 events. 48/125 cut-off events. For 1513/1513 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 347 event pairs, 8 based on Foata normal form. 4/129 useless extension candidates. Maximal degree in co-relation 408. Up to 47 conditions per place. [2024-06-20 19:43:28,296 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 19 selfloop transitions, 5 changer transitions 19/47 dead transitions. [2024-06-20 19:43:28,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 47 transitions, 299 flow [2024-06-20 19:43:28,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:43:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:43:28,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2024-06-20 19:43:28,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3567708333333333 [2024-06-20 19:43:28,297 INFO L175 Difference]: Start difference. First operand has 74 places, 34 transitions, 187 flow. Second operand 12 states and 137 transitions. [2024-06-20 19:43:28,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 47 transitions, 299 flow [2024-06-20 19:43:28,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 47 transitions, 277 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-20 19:43:28,299 INFO L231 Difference]: Finished difference. Result has 68 places, 25 transitions, 130 flow [2024-06-20 19:43:28,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=130, PETRI_PLACES=68, PETRI_TRANSITIONS=25} [2024-06-20 19:43:28,299 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 37 predicate places. [2024-06-20 19:43:28,299 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 25 transitions, 130 flow [2024-06-20 19:43:28,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:28,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:28,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:28,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-20 19:43:28,300 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:43:28,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:28,300 INFO L85 PathProgramCache]: Analyzing trace with hash -824619086, now seen corresponding path program 2 times [2024-06-20 19:43:28,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:28,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686915051] [2024-06-20 19:43:28,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:28,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:36,751 INFO L134 CoverageAnalysis]: 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:36,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:36,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686915051] [2024-06-20 19:43:36,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686915051] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:36,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:36,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-06-20 19:43:36,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813018453] [2024-06-20 19:43:36,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:36,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-20 19:43:36,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:36,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-20 19:43:36,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-06-20 19:43:36,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-20 19:43:36,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 25 transitions, 130 flow. Second operand has 14 states, 14 states have (on average 9.214285714285714) internal successors, (129), 14 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call 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:36,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:36,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-20 19:43:36,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:37,158 INFO L124 PetriNetUnfolderBase]: 23/66 cut-off events. [2024-06-20 19:43:37,158 INFO L125 PetriNetUnfolderBase]: For 540/540 co-relation queries the response was YES. [2024-06-20 19:43:37,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 66 events. 23/66 cut-off events. For 540/540 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 108 event pairs, 0 based on Foata normal form. 4/70 useless extension candidates. Maximal degree in co-relation 178. Up to 20 conditions per place. [2024-06-20 19:43:37,158 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 0 selfloop transitions, 0 changer transitions 35/35 dead transitions. [2024-06-20 19:43:37,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 35 transitions, 180 flow [2024-06-20 19:43:37,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-20 19:43:37,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-20 19:43:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 136 transitions. [2024-06-20 19:43:37,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3269230769230769 [2024-06-20 19:43:37,159 INFO L175 Difference]: Start difference. First operand has 68 places, 25 transitions, 130 flow. Second operand 13 states and 136 transitions. [2024-06-20 19:43:37,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 35 transitions, 180 flow [2024-06-20 19:43:37,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 35 transitions, 149 flow, removed 0 selfloop flow, removed 14 redundant places. [2024-06-20 19:43:37,160 INFO L231 Difference]: Finished difference. Result has 52 places, 0 transitions, 0 flow [2024-06-20 19:43:37,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=52, PETRI_TRANSITIONS=0} [2024-06-20 19:43:37,160 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2024-06-20 19:43:37,161 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 0 transitions, 0 flow [2024-06-20 19:43:37,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.214285714285714) internal successors, (129), 14 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call 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:37,165 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-20 19:43:37,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-20 19:43:37,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-20 19:43:37,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-20 19:43:37,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-20 19:43:37,167 INFO L445 BasicCegarLoop]: Path program histogram: [23, 17, 14, 10, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:37,169 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-20 19:43:37,169 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-20 19:43:37,172 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-20 19:43:37,172 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-20 19:43:37,173 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.06 07:43:37 BasicIcfg [2024-06-20 19:43:37,173 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-20 19:43:37,173 INFO L158 Benchmark]: Toolchain (without parser) took 761073.62ms. Allocated memory was 157.3MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 111.9MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 310.1MB. Max. memory is 16.1GB. [2024-06-20 19:43:37,173 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory was 81.7MB in the beginning and 81.6MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-20 19:43:37,174 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 157.3MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-20 19:43:37,174 INFO L158 Benchmark]: CACSL2BoogieTranslator took 708.90ms. Allocated memory is still 157.3MB. Free memory was 111.9MB in the beginning and 59.4MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-06-20 19:43:37,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.49ms. Allocated memory is still 157.3MB. Free memory was 59.4MB in the beginning and 42.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-06-20 19:43:37,174 INFO L158 Benchmark]: Boogie Preprocessor took 139.99ms. Allocated memory is still 157.3MB. Free memory was 42.7MB in the beginning and 108.9MB in the end (delta: -66.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-06-20 19:43:37,175 INFO L158 Benchmark]: RCFGBuilder took 998.11ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 108.9MB in the beginning and 167.0MB in the end (delta: -58.1MB). Peak memory consumption was 94.6MB. Max. memory is 16.1GB. [2024-06-20 19:43:37,175 INFO L158 Benchmark]: TraceAbstraction took 759127.12ms. Allocated memory was 226.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 166.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 294.0MB. Max. memory is 16.1GB. [2024-06-20 19:43:37,175 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory was 81.7MB in the beginning and 81.6MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 157.3MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 708.90ms. Allocated memory is still 157.3MB. Free memory was 111.9MB in the beginning and 59.4MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.49ms. Allocated memory is still 157.3MB. Free memory was 59.4MB in the beginning and 42.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 139.99ms. Allocated memory is still 157.3MB. Free memory was 42.7MB in the beginning and 108.9MB in the end (delta: -66.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * RCFGBuilder took 998.11ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 108.9MB in the beginning and 167.0MB in the end (delta: -58.1MB). Peak memory consumption was 94.6MB. Max. memory is 16.1GB. * TraceAbstraction took 759127.12ms. Allocated memory was 226.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 166.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 294.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 816]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 817]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 52 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 759.0s, OverallIterations: 111, TraceHistogramMax: 1, PathProgramHistogramMax: 23, EmptinessCheckTime: 0.0s, AutomataDifference: 55.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7344 SdHoareTripleChecker+Valid, 34.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6210 mSDsluCounter, 5559 SdHoareTripleChecker+Invalid, 30.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5042 mSDsCounter, 1113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40267 IncrementalHoareTripleChecker+Invalid, 41380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1113 mSolverCounterUnsat, 517 mSDtfsCounter, 40267 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1189 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2479 ImplicationChecksByTransitivity, 35.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1346occurred in iteration=71, InterpolantAutomatonStates: 1064, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.9s SatisfiabilityAnalysisTime, 697.8s InterpolantComputationTime, 1936 NumberOfCodeBlocks, 1936 NumberOfCodeBlocksAsserted, 111 NumberOfCheckSat, 1825 ConstructedInterpolants, 0 QuantifiedInterpolants, 100108 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 111 InterpolantComputations, 111 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-20 19:43:37,388 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-06-20 19:43:37,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE