./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix022_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 --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix022_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 7724a2de 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/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix022_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 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:13:52,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:13:52,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:13:52,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:13:52,399 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:13:52,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:13:52,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:13:52,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:13:52,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:13:52,416 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:13:52,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:13:52,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:13:52,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:13:52,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:13:52,417 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:13:52,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:13:52,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:13:52,423 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:13:52,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:13:52,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:13:52,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:13:52,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:13:52,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:13:52,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:13:52,425 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:13:52,425 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:13:52,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:13:52,426 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:13:52,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:13:52,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:13:52,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:13:52,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:13:52,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:13:52,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:13:52,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:13:52,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:13:52,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:13:52,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:13:52,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:13:52,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:13:52,433 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:13:52,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:13:52,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:13:52,434 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 [2024-06-27 22:13:52,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:13:52,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:13:52,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:13:52,694 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:13:52,694 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:13:52,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-27 22:13:52,813 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:13:52,813 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:13:52,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-27 22:13:53,887 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:13:54,118 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:13:54,119 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-27 22:13:54,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4f11abf/bd875e7a0e144f6b8a25c583e4485936/FLAG1d5ba7f62 [2024-06-27 22:13:54,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4f11abf/bd875e7a0e144f6b8a25c583e4485936 [2024-06-27 22:13:54,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:13:54,150 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:13:54,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:13:54,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:13:54,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:13:54,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:13:52" (1/2) ... [2024-06-27 22:13:54,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@664053e1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:13:54, skipping insertion in model container [2024-06-27 22:13:54,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:13:52" (1/2) ... [2024-06-27 22:13:54,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1ee3c616 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:13:54, skipping insertion in model container [2024-06-27 22:13:54,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:13:54" (2/2) ... [2024-06-27 22:13:54,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@664053e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:13:54, skipping insertion in model container [2024-06-27 22:13:54,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:13:54" (2/2) ... [2024-06-27 22:13:54,163 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:13:54,181 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:13:54,182 INFO L97 edCorrectnessWitness]: Location invariant before [L813-L813] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0_used >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0_used >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff0_used >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff0_used >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0_used >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0_used >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0_used + (long long )y$w_buff1_used >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0_used >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0_used >= 0LL) && (1LL + (long long )y$w_buff0_used) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$mem_tmp >= 0LL) && (long long )y - (long long )y$mem_tmp >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 22:13:54,182 INFO L97 edCorrectnessWitness]: Location invariant before [L814-L814] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$flush_delayed) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0_used >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0_used >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0_used >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0_used >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff0_used >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff0_used >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0_used >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0_used >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0_used + (long long )y$w_buff1_used >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0_used >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0_used >= 0LL) && (1LL + (long long )y$w_buff0_used) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$mem_tmp >= 0LL) && (long long )y - (long long )y$mem_tmp >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 22:13:54,183 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:13:54,183 INFO L106 edCorrectnessWitness]: ghost_update [L811-L811] multithreaded = 1; [2024-06-27 22:13:54,219 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:13:54,389 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] [2024-06-27 22:13:54,544 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:13:54,561 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:13:54,591 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[995,1008] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:13:54,731 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:13:54,768 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:13:54,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:13:54 WrapperNode [2024-06-27 22:13:54,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:13:54,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:13:54,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:13:54,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:13:54,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:13:54" (1/1) ... [2024-06-27 22:13:54,793 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:13:54" (1/1) ... [2024-06-27 22:13:54,833 INFO L138 Inliner]: procedures = 174, calls = 35, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 109 [2024-06-27 22:13:54,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:13:54,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:13:54,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:13:54,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:13:54,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:13:54" (1/1) ... [2024-06-27 22:13:54,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:13:54" (1/1) ... [2024-06-27 22:13:54,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:13:54" (1/1) ... [2024-06-27 22:13:54,863 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-27 22:13:54,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:13:54" (1/1) ... [2024-06-27 22:13:54,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:13:54" (1/1) ... [2024-06-27 22:13:54,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:13:54" (1/1) ... [2024-06-27 22:13:54,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:13:54" (1/1) ... [2024-06-27 22:13:54,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:13:54" (1/1) ... [2024-06-27 22:13:54,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:13:54" (1/1) ... [2024-06-27 22:13:54,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:13:54,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:13:54,884 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:13:54,885 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:13:54,885 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:13:54" (1/1) ... [2024-06-27 22:13:54,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:13:54,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:13:54,917 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-27 22:13:54,984 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-27 22:13:54,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:13:54,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:13:54,998 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:13:54,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:13:54,998 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:13:54,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:13:54,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:13:54,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:13:54,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:13:54,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:13:55,000 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 22:13:55,133 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:13:55,134 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:13:55,464 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:13:55,464 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:13:55,600 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:13:55,600 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:13:55,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:13:55 BoogieIcfgContainer [2024-06-27 22:13:55,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:13:55,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:13:55,603 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:13:55,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:13:55,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:13:52" (1/4) ... [2024-06-27 22:13:55,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdbe8a9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:13:55, skipping insertion in model container [2024-06-27 22:13:55,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:13:54" (2/4) ... [2024-06-27 22:13:55,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdbe8a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:13:55, skipping insertion in model container [2024-06-27 22:13:55,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:13:54" (3/4) ... [2024-06-27 22:13:55,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdbe8a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:13:55, skipping insertion in model container [2024-06-27 22:13:55,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:13:55" (4/4) ... [2024-06-27 22:13:55,608 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-27 22:13:55,622 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:13:55,622 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 22:13:55,622 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:13:55,664 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:13:55,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 80 flow [2024-06-27 22:13:55,722 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2024-06-27 22:13:55,722 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:13:55,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 34 events. 1/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-06-27 22:13:55,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 80 flow [2024-06-27 22:13:55,728 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 34 transitions, 74 flow [2024-06-27 22:13:55,739 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:13:55,748 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;@4ada6ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:13:55,748 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 22:13:55,752 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:13:55,753 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:13:55,753 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:13:55,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:55,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:13:55,754 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:13:55,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:55,758 INFO L85 PathProgramCache]: Analyzing trace with hash 308678707, now seen corresponding path program 1 times [2024-06-27 22:13:55,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:55,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904873269] [2024-06-27 22:13:55,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:55,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:57,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:57,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904873269] [2024-06-27 22:13:57,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904873269] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:57,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:57,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:13:57,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752145099] [2024-06-27 22:13:57,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:57,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:13:57,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:57,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:13:57,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:13:57,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:13:57,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 74 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-27 22:13:57,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:57,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:13:57,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:57,312 INFO L124 PetriNetUnfolderBase]: 460/809 cut-off events. [2024-06-27 22:13:57,312 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-27 22:13:57,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 809 events. 460/809 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4054 event pairs, 210 based on Foata normal form. 42/802 useless extension candidates. Maximal degree in co-relation 1586. Up to 761 conditions per place. [2024-06-27 22:13:57,321 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 30 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2024-06-27 22:13:57,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 161 flow [2024-06-27 22:13:57,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:13:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:13:57,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-06-27 22:13:57,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2024-06-27 22:13:57,332 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 74 flow. Second operand 3 states and 74 transitions. [2024-06-27 22:13:57,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 161 flow [2024-06-27 22:13:57,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:13:57,336 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 93 flow [2024-06-27 22:13:57,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2024-06-27 22:13:57,341 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-06-27 22:13:57,341 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 93 flow [2024-06-27 22:13:57,341 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-27 22:13:57,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:57,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:13:57,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:13:57,342 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:13:57,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:57,342 INFO L85 PathProgramCache]: Analyzing trace with hash 287676551, now seen corresponding path program 1 times [2024-06-27 22:13:57,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:57,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113362116] [2024-06-27 22:13:57,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:57,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:58,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:58,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:58,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113362116] [2024-06-27 22:13:58,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113362116] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:58,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:58,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:13:58,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261704675] [2024-06-27 22:13:58,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:58,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:13:58,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:58,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:13:58,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:13:58,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-27 22:13:58,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:58,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:58,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-27 22:13:58,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:58,218 INFO L124 PetriNetUnfolderBase]: 462/913 cut-off events. [2024-06-27 22:13:58,218 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2024-06-27 22:13:58,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 913 events. 462/913 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4997 event pairs, 255 based on Foata normal form. 2/838 useless extension candidates. Maximal degree in co-relation 1873. Up to 753 conditions per place. [2024-06-27 22:13:58,222 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 36 selfloop transitions, 6 changer transitions 1/53 dead transitions. [2024-06-27 22:13:58,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 227 flow [2024-06-27 22:13:58,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:13:58,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:13:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2024-06-27 22:13:58,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6319444444444444 [2024-06-27 22:13:58,224 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 93 flow. Second operand 4 states and 91 transitions. [2024-06-27 22:13:58,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 53 transitions, 227 flow [2024-06-27 22:13:58,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:13:58,226 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 139 flow [2024-06-27 22:13:58,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2024-06-27 22:13:58,227 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2024-06-27 22:13:58,227 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 139 flow [2024-06-27 22:13:58,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:58,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:58,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:13:58,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:13:58,228 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:13:58,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:58,228 INFO L85 PathProgramCache]: Analyzing trace with hash 328039780, now seen corresponding path program 1 times [2024-06-27 22:13:58,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:58,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590420165] [2024-06-27 22:13:58,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:58,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:13:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:13:58,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:13:58,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590420165] [2024-06-27 22:13:58,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590420165] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:13:58,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:13:58,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:13:58,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490136501] [2024-06-27 22:13:58,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:13:58,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:13:58,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:13:58,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:13:58,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:13:58,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:13:58,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:58,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:13:58,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:13:58,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:13:59,089 INFO L124 PetriNetUnfolderBase]: 570/1096 cut-off events. [2024-06-27 22:13:59,090 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2024-06-27 22:13:59,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2481 conditions, 1096 events. 570/1096 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6104 event pairs, 211 based on Foata normal form. 3/1007 useless extension candidates. Maximal degree in co-relation 2466. Up to 861 conditions per place. [2024-06-27 22:13:59,096 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 48 selfloop transitions, 14 changer transitions 2/73 dead transitions. [2024-06-27 22:13:59,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 363 flow [2024-06-27 22:13:59,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:13:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:13:59,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-06-27 22:13:59,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2024-06-27 22:13:59,101 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 139 flow. Second operand 5 states and 116 transitions. [2024-06-27 22:13:59,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 363 flow [2024-06-27 22:13:59,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 73 transitions, 356 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 22:13:59,105 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 229 flow [2024-06-27 22:13:59,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2024-06-27 22:13:59,106 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2024-06-27 22:13:59,106 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 229 flow [2024-06-27 22:13:59,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:13:59,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:13:59,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:13:59,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:13:59,107 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:13:59,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:13:59,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1440771760, now seen corresponding path program 1 times [2024-06-27 22:13:59,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:13:59,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787767420] [2024-06-27 22:13:59,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:13:59,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:13:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:00,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:00,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:00,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787767420] [2024-06-27 22:14:00,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787767420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:00,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:00,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:14:00,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792934948] [2024-06-27 22:14:00,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:00,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:14:00,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:00,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:14:00,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:14:00,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:14:00,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 229 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:00,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:00,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:14:00,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:00,506 INFO L124 PetriNetUnfolderBase]: 576/1096 cut-off events. [2024-06-27 22:14:00,506 INFO L125 PetriNetUnfolderBase]: For 967/967 co-relation queries the response was YES. [2024-06-27 22:14:00,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2948 conditions, 1096 events. 576/1096 cut-off events. For 967/967 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6072 event pairs, 198 based on Foata normal form. 7/1019 useless extension candidates. Maximal degree in co-relation 2928. Up to 842 conditions per place. [2024-06-27 22:14:00,511 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 55 selfloop transitions, 17 changer transitions 3/83 dead transitions. [2024-06-27 22:14:00,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 83 transitions, 480 flow [2024-06-27 22:14:00,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:14:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:14:00,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-06-27 22:14:00,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5674603174603174 [2024-06-27 22:14:00,513 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 229 flow. Second operand 7 states and 143 transitions. [2024-06-27 22:14:00,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 83 transitions, 480 flow [2024-06-27 22:14:00,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 476 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-27 22:14:00,516 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 280 flow [2024-06-27 22:14:00,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=280, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2024-06-27 22:14:00,517 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2024-06-27 22:14:00,517 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 280 flow [2024-06-27 22:14:00,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:00,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:00,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:00,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:14:00,518 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:00,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:00,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1713658307, now seen corresponding path program 1 times [2024-06-27 22:14:00,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:00,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119022648] [2024-06-27 22:14:00,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:00,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:01,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:01,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119022648] [2024-06-27 22:14:01,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119022648] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:01,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:01,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:14:01,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355705420] [2024-06-27 22:14:01,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:01,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:14:01,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:01,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:14:01,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:14:01,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 22:14:01,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 280 flow. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 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-27 22:14:01,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:01,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 22:14:01,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:01,789 INFO L124 PetriNetUnfolderBase]: 594/1052 cut-off events. [2024-06-27 22:14:01,789 INFO L125 PetriNetUnfolderBase]: For 1360/1360 co-relation queries the response was YES. [2024-06-27 22:14:01,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3226 conditions, 1052 events. 594/1052 cut-off events. For 1360/1360 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5631 event pairs, 88 based on Foata normal form. 6/1007 useless extension candidates. Maximal degree in co-relation 3203. Up to 762 conditions per place. [2024-06-27 22:14:01,795 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 62 selfloop transitions, 28 changer transitions 4/103 dead transitions. [2024-06-27 22:14:01,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 103 transitions, 660 flow [2024-06-27 22:14:01,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:14:01,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:14:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2024-06-27 22:14:01,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.623015873015873 [2024-06-27 22:14:01,796 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 280 flow. Second operand 7 states and 157 transitions. [2024-06-27 22:14:01,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 103 transitions, 660 flow [2024-06-27 22:14:01,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 103 transitions, 622 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-27 22:14:01,801 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 420 flow [2024-06-27 22:14:01,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=420, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2024-06-27 22:14:01,802 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2024-06-27 22:14:01,802 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 420 flow [2024-06-27 22:14:01,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 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-27 22:14:01,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:01,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:01,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:14:01,803 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:01,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:01,804 INFO L85 PathProgramCache]: Analyzing trace with hash 896135998, now seen corresponding path program 1 times [2024-06-27 22:14:01,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:01,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660763200] [2024-06-27 22:14:01,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:01,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:02,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:02,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:02,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660763200] [2024-06-27 22:14:02,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660763200] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:02,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:02,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:14:02,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112610735] [2024-06-27 22:14:02,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:02,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:14:02,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:02,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:14:02,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:14:02,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:02,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 420 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:02,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:02,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:02,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:03,109 INFO L124 PetriNetUnfolderBase]: 679/1314 cut-off events. [2024-06-27 22:14:03,110 INFO L125 PetriNetUnfolderBase]: For 2636/2636 co-relation queries the response was YES. [2024-06-27 22:14:03,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4228 conditions, 1314 events. 679/1314 cut-off events. For 2636/2636 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7475 event pairs, 381 based on Foata normal form. 1/1221 useless extension candidates. Maximal degree in co-relation 4201. Up to 1097 conditions per place. [2024-06-27 22:14:03,116 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 59 selfloop transitions, 12 changer transitions 0/78 dead transitions. [2024-06-27 22:14:03,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 78 transitions, 606 flow [2024-06-27 22:14:03,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:14:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:14:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2024-06-27 22:14:03,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5055555555555555 [2024-06-27 22:14:03,118 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 420 flow. Second operand 5 states and 91 transitions. [2024-06-27 22:14:03,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 78 transitions, 606 flow [2024-06-27 22:14:03,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 570 flow, removed 18 selfloop flow, removed 0 redundant places. [2024-06-27 22:14:03,125 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 441 flow [2024-06-27 22:14:03,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2024-06-27 22:14:03,127 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2024-06-27 22:14:03,127 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 441 flow [2024-06-27 22:14:03,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:03,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:03,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:03,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:14:03,128 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:03,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:03,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2010428302, now seen corresponding path program 1 times [2024-06-27 22:14:03,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:03,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564649315] [2024-06-27 22:14:03,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:03,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:03,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-27 22:14:03,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:03,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564649315] [2024-06-27 22:14:03,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564649315] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:03,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:03,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:14:03,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672103604] [2024-06-27 22:14:03,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:03,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:14:03,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:03,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:14:03,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:14:03,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 36 [2024-06-27 22:14:03,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:03,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:03,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 36 [2024-06-27 22:14:03,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:03,310 INFO L124 PetriNetUnfolderBase]: 313/766 cut-off events. [2024-06-27 22:14:03,310 INFO L125 PetriNetUnfolderBase]: For 1236/1356 co-relation queries the response was YES. [2024-06-27 22:14:03,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2115 conditions, 766 events. 313/766 cut-off events. For 1236/1356 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4916 event pairs, 154 based on Foata normal form. 34/733 useless extension candidates. Maximal degree in co-relation 2083. Up to 424 conditions per place. [2024-06-27 22:14:03,316 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 31 selfloop transitions, 7 changer transitions 0/75 dead transitions. [2024-06-27 22:14:03,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 75 transitions, 535 flow [2024-06-27 22:14:03,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:14:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:14:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-06-27 22:14:03,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7592592592592593 [2024-06-27 22:14:03,317 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 441 flow. Second operand 3 states and 82 transitions. [2024-06-27 22:14:03,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 75 transitions, 535 flow [2024-06-27 22:14:03,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 75 transitions, 513 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:14:03,321 INFO L231 Difference]: Finished difference. Result has 66 places, 65 transitions, 425 flow [2024-06-27 22:14:03,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=425, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2024-06-27 22:14:03,323 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 26 predicate places. [2024-06-27 22:14:03,323 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 425 flow [2024-06-27 22:14:03,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:03,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:03,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:03,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:14:03,324 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:03,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:03,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1791974106, now seen corresponding path program 1 times [2024-06-27 22:14:03,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:03,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864705087] [2024-06-27 22:14:03,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:03,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:04,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:04,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:04,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864705087] [2024-06-27 22:14:04,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864705087] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:04,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:04,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:14:04,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646409175] [2024-06-27 22:14:04,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:04,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:14:04,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:04,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:14:04,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:14:04,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:04,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 425 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:04,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:04,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:04,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:04,543 INFO L124 PetriNetUnfolderBase]: 620/1200 cut-off events. [2024-06-27 22:14:04,543 INFO L125 PetriNetUnfolderBase]: For 2410/2410 co-relation queries the response was YES. [2024-06-27 22:14:04,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3810 conditions, 1200 events. 620/1200 cut-off events. For 2410/2410 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6529 event pairs, 339 based on Foata normal form. 1/1154 useless extension candidates. Maximal degree in co-relation 3778. Up to 1004 conditions per place. [2024-06-27 22:14:04,551 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 58 selfloop transitions, 13 changer transitions 1/79 dead transitions. [2024-06-27 22:14:04,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 79 transitions, 618 flow [2024-06-27 22:14:04,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:14:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:14:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-27 22:14:04,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675925925925926 [2024-06-27 22:14:04,552 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 425 flow. Second operand 6 states and 101 transitions. [2024-06-27 22:14:04,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 79 transitions, 618 flow [2024-06-27 22:14:04,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 79 transitions, 604 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:14:04,557 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 472 flow [2024-06-27 22:14:04,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=472, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2024-06-27 22:14:04,558 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2024-06-27 22:14:04,558 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 472 flow [2024-06-27 22:14:04,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:04,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:04,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:04,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:14:04,559 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:04,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:04,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1997468519, now seen corresponding path program 1 times [2024-06-27 22:14:04,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:04,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37646472] [2024-06-27 22:14:04,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:04,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:05,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:05,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37646472] [2024-06-27 22:14:05,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37646472] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:05,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:05,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:14:05,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543981208] [2024-06-27 22:14:05,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:05,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:14:05,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:05,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:14:05,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:14:05,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:05,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 472 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:05,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:05,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:05,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:06,276 INFO L124 PetriNetUnfolderBase]: 522/1029 cut-off events. [2024-06-27 22:14:06,276 INFO L125 PetriNetUnfolderBase]: For 2415/2415 co-relation queries the response was YES. [2024-06-27 22:14:06,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3375 conditions, 1029 events. 522/1029 cut-off events. For 2415/2415 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5602 event pairs, 274 based on Foata normal form. 3/995 useless extension candidates. Maximal degree in co-relation 3341. Up to 818 conditions per place. [2024-06-27 22:14:06,282 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 65 selfloop transitions, 14 changer transitions 0/86 dead transitions. [2024-06-27 22:14:06,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 86 transitions, 682 flow [2024-06-27 22:14:06,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:14:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:14:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-06-27 22:14:06,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-06-27 22:14:06,286 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 472 flow. Second operand 6 states and 105 transitions. [2024-06-27 22:14:06,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 86 transitions, 682 flow [2024-06-27 22:14:06,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 86 transitions, 655 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 22:14:06,292 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 495 flow [2024-06-27 22:14:06,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=495, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2024-06-27 22:14:06,293 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 32 predicate places. [2024-06-27 22:14:06,293 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 495 flow [2024-06-27 22:14:06,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:06,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:06,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:06,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:14:06,294 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:06,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:06,294 INFO L85 PathProgramCache]: Analyzing trace with hash 947289962, now seen corresponding path program 2 times [2024-06-27 22:14:06,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:06,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003589725] [2024-06-27 22:14:06,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:06,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:07,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:07,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003589725] [2024-06-27 22:14:07,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003589725] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:07,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:07,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:14:07,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665643077] [2024-06-27 22:14:07,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:07,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:14:07,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:07,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:14:07,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:14:07,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:07,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 495 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:07,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:07,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:07,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:07,748 INFO L124 PetriNetUnfolderBase]: 576/1150 cut-off events. [2024-06-27 22:14:07,748 INFO L125 PetriNetUnfolderBase]: For 2908/2908 co-relation queries the response was YES. [2024-06-27 22:14:07,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3959 conditions, 1150 events. 576/1150 cut-off events. For 2908/2908 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6297 event pairs, 147 based on Foata normal form. 2/1105 useless extension candidates. Maximal degree in co-relation 3923. Up to 837 conditions per place. [2024-06-27 22:14:07,755 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 76 selfloop transitions, 30 changer transitions 0/113 dead transitions. [2024-06-27 22:14:07,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 113 transitions, 993 flow [2024-06-27 22:14:07,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:14:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:14:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-27 22:14:07,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49603174603174605 [2024-06-27 22:14:07,757 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 495 flow. Second operand 7 states and 125 transitions. [2024-06-27 22:14:07,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 113 transitions, 993 flow [2024-06-27 22:14:07,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 113 transitions, 967 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-27 22:14:07,767 INFO L231 Difference]: Finished difference. Result has 77 places, 89 transitions, 739 flow [2024-06-27 22:14:07,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=739, PETRI_PLACES=77, PETRI_TRANSITIONS=89} [2024-06-27 22:14:07,769 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 37 predicate places. [2024-06-27 22:14:07,769 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 89 transitions, 739 flow [2024-06-27 22:14:07,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:07,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:07,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:07,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:14:07,771 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:07,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:07,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1981060974, now seen corresponding path program 3 times [2024-06-27 22:14:07,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:07,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202924801] [2024-06-27 22:14:07,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:07,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:08,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:08,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202924801] [2024-06-27 22:14:08,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202924801] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:08,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:08,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:14:08,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171420442] [2024-06-27 22:14:08,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:08,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:14:08,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:08,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:14:08,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:14:08,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:08,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 89 transitions, 739 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:08,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:08,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:08,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:08,975 INFO L124 PetriNetUnfolderBase]: 589/1174 cut-off events. [2024-06-27 22:14:08,975 INFO L125 PetriNetUnfolderBase]: For 3855/3855 co-relation queries the response was YES. [2024-06-27 22:14:08,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4406 conditions, 1174 events. 589/1174 cut-off events. For 3855/3855 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6446 event pairs, 267 based on Foata normal form. 2/1129 useless extension candidates. Maximal degree in co-relation 4367. Up to 886 conditions per place. [2024-06-27 22:14:08,983 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 75 selfloop transitions, 34 changer transitions 0/116 dead transitions. [2024-06-27 22:14:08,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 116 transitions, 1174 flow [2024-06-27 22:14:08,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:14:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:14:08,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-06-27 22:14:08,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-06-27 22:14:08,986 INFO L175 Difference]: Start difference. First operand has 77 places, 89 transitions, 739 flow. Second operand 6 states and 105 transitions. [2024-06-27 22:14:08,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 116 transitions, 1174 flow [2024-06-27 22:14:08,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 116 transitions, 1111 flow, removed 27 selfloop flow, removed 2 redundant places. [2024-06-27 22:14:08,996 INFO L231 Difference]: Finished difference. Result has 82 places, 104 transitions, 979 flow [2024-06-27 22:14:08,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=979, PETRI_PLACES=82, PETRI_TRANSITIONS=104} [2024-06-27 22:14:08,997 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 42 predicate places. [2024-06-27 22:14:08,997 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 104 transitions, 979 flow [2024-06-27 22:14:08,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:08,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:08,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:08,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:14:08,997 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:08,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:08,998 INFO L85 PathProgramCache]: Analyzing trace with hash -698781223, now seen corresponding path program 1 times [2024-06-27 22:14:08,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:08,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541066623] [2024-06-27 22:14:08,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:08,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:10,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:10,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:10,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541066623] [2024-06-27 22:14:10,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541066623] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:10,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:10,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:14:10,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104320881] [2024-06-27 22:14:10,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:10,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:14:10,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:10,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:14:10,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:14:10,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:10,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 104 transitions, 979 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:10,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:10,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:10,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:10,823 INFO L124 PetriNetUnfolderBase]: 619/1216 cut-off events. [2024-06-27 22:14:10,823 INFO L125 PetriNetUnfolderBase]: For 4434/4434 co-relation queries the response was YES. [2024-06-27 22:14:10,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4736 conditions, 1216 events. 619/1216 cut-off events. For 4434/4434 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6676 event pairs, 146 based on Foata normal form. 2/1171 useless extension candidates. Maximal degree in co-relation 4694. Up to 808 conditions per place. [2024-06-27 22:14:10,832 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 90 selfloop transitions, 48 changer transitions 0/145 dead transitions. [2024-06-27 22:14:10,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 145 transitions, 1495 flow [2024-06-27 22:14:10,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:14:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:14:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-27 22:14:10,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2024-06-27 22:14:10,834 INFO L175 Difference]: Start difference. First operand has 82 places, 104 transitions, 979 flow. Second operand 8 states and 145 transitions. [2024-06-27 22:14:10,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 145 transitions, 1495 flow [2024-06-27 22:14:10,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 145 transitions, 1468 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-27 22:14:10,845 INFO L231 Difference]: Finished difference. Result has 90 places, 118 transitions, 1177 flow [2024-06-27 22:14:10,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1177, PETRI_PLACES=90, PETRI_TRANSITIONS=118} [2024-06-27 22:14:10,847 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 50 predicate places. [2024-06-27 22:14:10,847 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 118 transitions, 1177 flow [2024-06-27 22:14:10,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:10,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:10,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:10,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:14:10,848 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:10,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:10,849 INFO L85 PathProgramCache]: Analyzing trace with hash -489107415, now seen corresponding path program 2 times [2024-06-27 22:14:10,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:10,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742293555] [2024-06-27 22:14:10,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:10,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:11,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-27 22:14:11,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:11,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742293555] [2024-06-27 22:14:11,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742293555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:11,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:11,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:14:11,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010133289] [2024-06-27 22:14:11,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:11,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:14:11,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:11,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:14:11,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:14:11,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:11,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 118 transitions, 1177 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:11,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:11,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:11,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:12,210 INFO L124 PetriNetUnfolderBase]: 655/1276 cut-off events. [2024-06-27 22:14:12,210 INFO L125 PetriNetUnfolderBase]: For 5695/5695 co-relation queries the response was YES. [2024-06-27 22:14:12,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5428 conditions, 1276 events. 655/1276 cut-off events. For 5695/5695 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7032 event pairs, 266 based on Foata normal form. 2/1231 useless extension candidates. Maximal degree in co-relation 5382. Up to 911 conditions per place. [2024-06-27 22:14:12,227 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 93 selfloop transitions, 49 changer transitions 0/149 dead transitions. [2024-06-27 22:14:12,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 149 transitions, 1663 flow [2024-06-27 22:14:12,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:14:12,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:14:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-27 22:14:12,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2024-06-27 22:14:12,229 INFO L175 Difference]: Start difference. First operand has 90 places, 118 transitions, 1177 flow. Second operand 7 states and 124 transitions. [2024-06-27 22:14:12,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 149 transitions, 1663 flow [2024-06-27 22:14:12,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 149 transitions, 1599 flow, removed 25 selfloop flow, removed 2 redundant places. [2024-06-27 22:14:12,246 INFO L231 Difference]: Finished difference. Result has 95 places, 132 transitions, 1354 flow [2024-06-27 22:14:12,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1354, PETRI_PLACES=95, PETRI_TRANSITIONS=132} [2024-06-27 22:14:12,247 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 55 predicate places. [2024-06-27 22:14:12,247 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 132 transitions, 1354 flow [2024-06-27 22:14:12,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:12,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:12,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:12,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:14:12,248 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:12,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:12,248 INFO L85 PathProgramCache]: Analyzing trace with hash -728184573, now seen corresponding path program 3 times [2024-06-27 22:14:12,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:12,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618733738] [2024-06-27 22:14:12,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:12,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:13,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:13,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:13,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618733738] [2024-06-27 22:14:13,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618733738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:13,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:13,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:14:13,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870805315] [2024-06-27 22:14:13,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:13,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:14:13,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:13,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:14:13,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:14:13,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:13,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 132 transitions, 1354 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:13,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:13,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:13,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:13,523 INFO L124 PetriNetUnfolderBase]: 692/1341 cut-off events. [2024-06-27 22:14:13,524 INFO L125 PetriNetUnfolderBase]: For 6576/6576 co-relation queries the response was YES. [2024-06-27 22:14:13,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5910 conditions, 1341 events. 692/1341 cut-off events. For 6576/6576 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7438 event pairs, 271 based on Foata normal form. 3/1294 useless extension candidates. Maximal degree in co-relation 5861. Up to 1070 conditions per place. [2024-06-27 22:14:13,532 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 135 selfloop transitions, 15 changer transitions 0/157 dead transitions. [2024-06-27 22:14:13,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 157 transitions, 1775 flow [2024-06-27 22:14:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:14:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:14:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-27 22:14:13,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2024-06-27 22:14:13,534 INFO L175 Difference]: Start difference. First operand has 95 places, 132 transitions, 1354 flow. Second operand 7 states and 118 transitions. [2024-06-27 22:14:13,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 157 transitions, 1775 flow [2024-06-27 22:14:13,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 157 transitions, 1741 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-27 22:14:13,552 INFO L231 Difference]: Finished difference. Result has 100 places, 134 transitions, 1373 flow [2024-06-27 22:14:13,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1320, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1373, PETRI_PLACES=100, PETRI_TRANSITIONS=134} [2024-06-27 22:14:13,553 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 60 predicate places. [2024-06-27 22:14:13,553 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 134 transitions, 1373 flow [2024-06-27 22:14:13,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:13,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:13,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:13,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:14:13,554 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:13,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:13,555 INFO L85 PathProgramCache]: Analyzing trace with hash -283376535, now seen corresponding path program 4 times [2024-06-27 22:14:13,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:13,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907865560] [2024-06-27 22:14:13,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:13,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:14,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:14,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907865560] [2024-06-27 22:14:14,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907865560] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:14,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:14,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:14:14,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376421730] [2024-06-27 22:14:14,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:14,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:14:14,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:14,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:14:14,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:14:14,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:14,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 134 transitions, 1373 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:14,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:14,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:14,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:14,822 INFO L124 PetriNetUnfolderBase]: 718/1399 cut-off events. [2024-06-27 22:14:14,822 INFO L125 PetriNetUnfolderBase]: For 7442/7442 co-relation queries the response was YES. [2024-06-27 22:14:14,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6265 conditions, 1399 events. 718/1399 cut-off events. For 7442/7442 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7884 event pairs, 272 based on Foata normal form. 3/1348 useless extension candidates. Maximal degree in co-relation 6213. Up to 1061 conditions per place. [2024-06-27 22:14:14,830 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 143 selfloop transitions, 21 changer transitions 0/171 dead transitions. [2024-06-27 22:14:14,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 171 transitions, 1925 flow [2024-06-27 22:14:14,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:14:14,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:14:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-27 22:14:14,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2024-06-27 22:14:14,832 INFO L175 Difference]: Start difference. First operand has 100 places, 134 transitions, 1373 flow. Second operand 7 states and 123 transitions. [2024-06-27 22:14:14,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 171 transitions, 1925 flow [2024-06-27 22:14:14,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 171 transitions, 1879 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-27 22:14:14,846 INFO L231 Difference]: Finished difference. Result has 103 places, 138 transitions, 1440 flow [2024-06-27 22:14:14,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1327, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1440, PETRI_PLACES=103, PETRI_TRANSITIONS=138} [2024-06-27 22:14:14,847 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 63 predicate places. [2024-06-27 22:14:14,847 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 138 transitions, 1440 flow [2024-06-27 22:14:14,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:14,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:14,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:14,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:14:14,848 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:14,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:14,848 INFO L85 PathProgramCache]: Analyzing trace with hash -422143663, now seen corresponding path program 1 times [2024-06-27 22:14:14,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:14,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10745176] [2024-06-27 22:14:14,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:14,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:16,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:16,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10745176] [2024-06-27 22:14:16,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10745176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:16,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:16,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:14:16,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509663787] [2024-06-27 22:14:16,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:16,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:14:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:16,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:14:16,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:14:16,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:14:16,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 138 transitions, 1440 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:16,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:16,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:14:16,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:16,347 INFO L124 PetriNetUnfolderBase]: 695/1284 cut-off events. [2024-06-27 22:14:16,348 INFO L125 PetriNetUnfolderBase]: For 7296/7299 co-relation queries the response was YES. [2024-06-27 22:14:16,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6031 conditions, 1284 events. 695/1284 cut-off events. For 7296/7299 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7110 event pairs, 105 based on Foata normal form. 1/1247 useless extension candidates. Maximal degree in co-relation 5979. Up to 879 conditions per place. [2024-06-27 22:14:16,356 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 109 selfloop transitions, 45 changer transitions 0/164 dead transitions. [2024-06-27 22:14:16,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 164 transitions, 1874 flow [2024-06-27 22:14:16,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:14:16,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:14:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-27 22:14:16,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5198412698412699 [2024-06-27 22:14:16,358 INFO L175 Difference]: Start difference. First operand has 103 places, 138 transitions, 1440 flow. Second operand 7 states and 131 transitions. [2024-06-27 22:14:16,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 164 transitions, 1874 flow [2024-06-27 22:14:16,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 164 transitions, 1819 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-27 22:14:16,374 INFO L231 Difference]: Finished difference. Result has 106 places, 142 transitions, 1509 flow [2024-06-27 22:14:16,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1385, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1509, PETRI_PLACES=106, PETRI_TRANSITIONS=142} [2024-06-27 22:14:16,374 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 66 predicate places. [2024-06-27 22:14:16,374 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 142 transitions, 1509 flow [2024-06-27 22:14:16,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:16,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:16,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:16,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:14:16,375 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:16,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:16,376 INFO L85 PathProgramCache]: Analyzing trace with hash -418939813, now seen corresponding path program 2 times [2024-06-27 22:14:16,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:16,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405466263] [2024-06-27 22:14:16,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:16,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:17,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:17,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405466263] [2024-06-27 22:14:17,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405466263] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:17,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:17,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:14:17,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225071388] [2024-06-27 22:14:17,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:17,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:14:17,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:17,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:14:17,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:14:17,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:14:17,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 142 transitions, 1509 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:17,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:17,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:14:17,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:17,772 INFO L124 PetriNetUnfolderBase]: 697/1373 cut-off events. [2024-06-27 22:14:17,772 INFO L125 PetriNetUnfolderBase]: For 7783/7786 co-relation queries the response was YES. [2024-06-27 22:14:17,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6196 conditions, 1373 events. 697/1373 cut-off events. For 7783/7786 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7879 event pairs, 142 based on Foata normal form. 1/1314 useless extension candidates. Maximal degree in co-relation 6144. Up to 938 conditions per place. [2024-06-27 22:14:17,780 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 98 selfloop transitions, 53 changer transitions 0/161 dead transitions. [2024-06-27 22:14:17,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 161 transitions, 1877 flow [2024-06-27 22:14:17,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:14:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:14:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-27 22:14:17,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503968253968254 [2024-06-27 22:14:17,782 INFO L175 Difference]: Start difference. First operand has 106 places, 142 transitions, 1509 flow. Second operand 7 states and 127 transitions. [2024-06-27 22:14:17,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 161 transitions, 1877 flow [2024-06-27 22:14:17,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 161 transitions, 1825 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 22:14:17,797 INFO L231 Difference]: Finished difference. Result has 111 places, 144 transitions, 1620 flow [2024-06-27 22:14:17,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1620, PETRI_PLACES=111, PETRI_TRANSITIONS=144} [2024-06-27 22:14:17,798 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 71 predicate places. [2024-06-27 22:14:17,798 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 144 transitions, 1620 flow [2024-06-27 22:14:17,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:14:17,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:17,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:17,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:14:17,799 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:17,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:17,799 INFO L85 PathProgramCache]: Analyzing trace with hash -588665362, now seen corresponding path program 1 times [2024-06-27 22:14:17,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:17,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790043243] [2024-06-27 22:14:17,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:17,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:19,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:19,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:19,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790043243] [2024-06-27 22:14:19,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790043243] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:19,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:19,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:14:19,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255827460] [2024-06-27 22:14:19,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:19,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:14:19,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:19,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:14:19,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:14:19,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:19,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 144 transitions, 1620 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:14:19,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:19,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:19,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:19,833 INFO L124 PetriNetUnfolderBase]: 742/1437 cut-off events. [2024-06-27 22:14:19,833 INFO L125 PetriNetUnfolderBase]: For 8915/8915 co-relation queries the response was YES. [2024-06-27 22:14:19,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6834 conditions, 1437 events. 742/1437 cut-off events. For 8915/8915 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8118 event pairs, 153 based on Foata normal form. 1/1383 useless extension candidates. Maximal degree in co-relation 6779. Up to 966 conditions per place. [2024-06-27 22:14:19,842 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 109 selfloop transitions, 67 changer transitions 0/183 dead transitions. [2024-06-27 22:14:19,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 183 transitions, 2239 flow [2024-06-27 22:14:19,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:14:19,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:14:19,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-27 22:14:19,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49382716049382713 [2024-06-27 22:14:19,844 INFO L175 Difference]: Start difference. First operand has 111 places, 144 transitions, 1620 flow. Second operand 9 states and 160 transitions. [2024-06-27 22:14:19,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 183 transitions, 2239 flow [2024-06-27 22:14:19,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 183 transitions, 2139 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 22:14:19,862 INFO L231 Difference]: Finished difference. Result has 114 places, 150 transitions, 1715 flow [2024-06-27 22:14:19,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1715, PETRI_PLACES=114, PETRI_TRANSITIONS=150} [2024-06-27 22:14:19,863 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 74 predicate places. [2024-06-27 22:14:19,863 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 150 transitions, 1715 flow [2024-06-27 22:14:19,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:14:19,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:19,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:19,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:14:19,863 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:19,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:19,864 INFO L85 PathProgramCache]: Analyzing trace with hash -588665145, now seen corresponding path program 1 times [2024-06-27 22:14:19,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:19,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444099254] [2024-06-27 22:14:19,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:19,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:21,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:21,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444099254] [2024-06-27 22:14:21,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444099254] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:21,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:21,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:14:21,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516524277] [2024-06-27 22:14:21,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:21,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:14:21,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:21,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:14:21,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:14:21,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:21,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 150 transitions, 1715 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:14:21,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:21,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:21,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:21,957 INFO L124 PetriNetUnfolderBase]: 838/1584 cut-off events. [2024-06-27 22:14:21,958 INFO L125 PetriNetUnfolderBase]: For 11048/11048 co-relation queries the response was YES. [2024-06-27 22:14:21,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7512 conditions, 1584 events. 838/1584 cut-off events. For 11048/11048 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9018 event pairs, 157 based on Foata normal form. 4/1533 useless extension candidates. Maximal degree in co-relation 7458. Up to 908 conditions per place. [2024-06-27 22:14:22,000 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 122 selfloop transitions, 77 changer transitions 0/206 dead transitions. [2024-06-27 22:14:22,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 206 transitions, 2509 flow [2024-06-27 22:14:22,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:14:22,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:14:22,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-27 22:14:22,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2024-06-27 22:14:22,002 INFO L175 Difference]: Start difference. First operand has 114 places, 150 transitions, 1715 flow. Second operand 9 states and 167 transitions. [2024-06-27 22:14:22,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 206 transitions, 2509 flow [2024-06-27 22:14:22,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 206 transitions, 2359 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-27 22:14:22,039 INFO L231 Difference]: Finished difference. Result has 117 places, 168 transitions, 1922 flow [2024-06-27 22:14:22,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1565, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1922, PETRI_PLACES=117, PETRI_TRANSITIONS=168} [2024-06-27 22:14:22,040 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 77 predicate places. [2024-06-27 22:14:22,040 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 168 transitions, 1922 flow [2024-06-27 22:14:22,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:14:22,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:22,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:22,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:14:22,041 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:22,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:22,041 INFO L85 PathProgramCache]: Analyzing trace with hash -187097872, now seen corresponding path program 2 times [2024-06-27 22:14:22,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:22,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37063314] [2024-06-27 22:14:22,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:22,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:23,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:23,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37063314] [2024-06-27 22:14:23,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37063314] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:23,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:23,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:14:23,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346067426] [2024-06-27 22:14:23,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:23,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:14:23,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:23,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:14:23,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:14:23,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:23,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 168 transitions, 1922 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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-27 22:14:23,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:23,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:23,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:23,815 INFO L124 PetriNetUnfolderBase]: 861/1619 cut-off events. [2024-06-27 22:14:23,815 INFO L125 PetriNetUnfolderBase]: For 12776/12776 co-relation queries the response was YES. [2024-06-27 22:14:23,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8275 conditions, 1619 events. 861/1619 cut-off events. For 12776/12776 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9190 event pairs, 158 based on Foata normal form. 1/1565 useless extension candidates. Maximal degree in co-relation 8218. Up to 1130 conditions per place. [2024-06-27 22:14:23,825 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 123 selfloop transitions, 81 changer transitions 0/211 dead transitions. [2024-06-27 22:14:23,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 211 transitions, 2704 flow [2024-06-27 22:14:23,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:14:23,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:14:23,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-27 22:14:23,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2024-06-27 22:14:23,828 INFO L175 Difference]: Start difference. First operand has 117 places, 168 transitions, 1922 flow. Second operand 8 states and 145 transitions. [2024-06-27 22:14:23,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 211 transitions, 2704 flow [2024-06-27 22:14:23,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 211 transitions, 2624 flow, removed 27 selfloop flow, removed 3 redundant places. [2024-06-27 22:14:23,852 INFO L231 Difference]: Finished difference. Result has 124 places, 187 transitions, 2349 flow [2024-06-27 22:14:23,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1852, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2349, PETRI_PLACES=124, PETRI_TRANSITIONS=187} [2024-06-27 22:14:23,853 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 84 predicate places. [2024-06-27 22:14:23,853 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 187 transitions, 2349 flow [2024-06-27 22:14:23,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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-27 22:14:23,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:23,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:23,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:14:23,854 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:23,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:23,854 INFO L85 PathProgramCache]: Analyzing trace with hash -421750152, now seen corresponding path program 3 times [2024-06-27 22:14:23,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:23,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478946767] [2024-06-27 22:14:23,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:23,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:24,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:24,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478946767] [2024-06-27 22:14:24,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478946767] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:24,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:24,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:14:24,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105967974] [2024-06-27 22:14:24,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:24,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:14:24,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:24,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:14:24,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:14:24,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:24,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 187 transitions, 2349 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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-27 22:14:24,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:24,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:24,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:25,246 INFO L124 PetriNetUnfolderBase]: 873/1642 cut-off events. [2024-06-27 22:14:25,246 INFO L125 PetriNetUnfolderBase]: For 14076/14076 co-relation queries the response was YES. [2024-06-27 22:14:25,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8689 conditions, 1642 events. 873/1642 cut-off events. For 14076/14076 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9343 event pairs, 279 based on Foata normal form. 1/1588 useless extension candidates. Maximal degree in co-relation 8627. Up to 1222 conditions per place. [2024-06-27 22:14:25,258 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 132 selfloop transitions, 81 changer transitions 0/220 dead transitions. [2024-06-27 22:14:25,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 220 transitions, 3097 flow [2024-06-27 22:14:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:14:25,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:14:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-27 22:14:25,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49603174603174605 [2024-06-27 22:14:25,260 INFO L175 Difference]: Start difference. First operand has 124 places, 187 transitions, 2349 flow. Second operand 7 states and 125 transitions. [2024-06-27 22:14:25,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 220 transitions, 3097 flow [2024-06-27 22:14:25,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 220 transitions, 2969 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-27 22:14:25,288 INFO L231 Difference]: Finished difference. Result has 128 places, 203 transitions, 2656 flow [2024-06-27 22:14:25,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2242, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2656, PETRI_PLACES=128, PETRI_TRANSITIONS=203} [2024-06-27 22:14:25,289 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 88 predicate places. [2024-06-27 22:14:25,289 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 203 transitions, 2656 flow [2024-06-27 22:14:25,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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-27 22:14:25,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:25,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:25,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:14:25,290 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:25,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:25,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2017540377, now seen corresponding path program 2 times [2024-06-27 22:14:25,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:25,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007361884] [2024-06-27 22:14:25,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:25,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:26,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:26,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007361884] [2024-06-27 22:14:26,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007361884] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:26,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:26,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:14:26,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898700452] [2024-06-27 22:14:26,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:26,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:14:26,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:26,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:14:26,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:14:26,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:26,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 203 transitions, 2656 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:14:26,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:26,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:26,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:27,099 INFO L124 PetriNetUnfolderBase]: 993/1902 cut-off events. [2024-06-27 22:14:27,099 INFO L125 PetriNetUnfolderBase]: For 17127/17127 co-relation queries the response was YES. [2024-06-27 22:14:27,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9913 conditions, 1902 events. 993/1902 cut-off events. For 17127/17127 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11450 event pairs, 301 based on Foata normal form. 4/1835 useless extension candidates. Maximal degree in co-relation 9849. Up to 1054 conditions per place. [2024-06-27 22:14:27,132 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 174 selfloop transitions, 77 changer transitions 0/258 dead transitions. [2024-06-27 22:14:27,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 258 transitions, 3602 flow [2024-06-27 22:14:27,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:14:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:14:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-27 22:14:27,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2024-06-27 22:14:27,145 INFO L175 Difference]: Start difference. First operand has 128 places, 203 transitions, 2656 flow. Second operand 8 states and 148 transitions. [2024-06-27 22:14:27,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 258 transitions, 3602 flow [2024-06-27 22:14:27,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 258 transitions, 3521 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-27 22:14:27,207 INFO L231 Difference]: Finished difference. Result has 136 places, 226 transitions, 3089 flow [2024-06-27 22:14:27,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2575, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3089, PETRI_PLACES=136, PETRI_TRANSITIONS=226} [2024-06-27 22:14:27,208 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 96 predicate places. [2024-06-27 22:14:27,208 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 226 transitions, 3089 flow [2024-06-27 22:14:27,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:14:27,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:27,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:27,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:14:27,209 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:27,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:27,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1189509412, now seen corresponding path program 4 times [2024-06-27 22:14:27,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:27,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975914174] [2024-06-27 22:14:27,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:27,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:28,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:28,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:28,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975914174] [2024-06-27 22:14:28,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975914174] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:28,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:28,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:14:28,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204391481] [2024-06-27 22:14:28,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:28,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:14:28,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:28,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:14:28,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:14:28,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:28,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 226 transitions, 3089 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:14:28,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:28,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:28,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:28,757 INFO L124 PetriNetUnfolderBase]: 1076/2054 cut-off events. [2024-06-27 22:14:28,757 INFO L125 PetriNetUnfolderBase]: For 21088/21088 co-relation queries the response was YES. [2024-06-27 22:14:28,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11374 conditions, 2054 events. 1076/2054 cut-off events. For 21088/21088 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12537 event pairs, 320 based on Foata normal form. 3/1981 useless extension candidates. Maximal degree in co-relation 11306. Up to 1194 conditions per place. [2024-06-27 22:14:28,770 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 199 selfloop transitions, 80 changer transitions 0/286 dead transitions. [2024-06-27 22:14:28,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 286 transitions, 4183 flow [2024-06-27 22:14:28,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:14:28,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:14:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-27 22:14:28,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173611111111112 [2024-06-27 22:14:28,771 INFO L175 Difference]: Start difference. First operand has 136 places, 226 transitions, 3089 flow. Second operand 8 states and 149 transitions. [2024-06-27 22:14:28,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 286 transitions, 4183 flow [2024-06-27 22:14:28,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 286 transitions, 4132 flow, removed 24 selfloop flow, removed 1 redundant places. [2024-06-27 22:14:28,809 INFO L231 Difference]: Finished difference. Result has 143 places, 241 transitions, 3424 flow [2024-06-27 22:14:28,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3038, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3424, PETRI_PLACES=143, PETRI_TRANSITIONS=241} [2024-06-27 22:14:28,810 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 103 predicate places. [2024-06-27 22:14:28,810 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 241 transitions, 3424 flow [2024-06-27 22:14:28,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:14:28,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:28,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:28,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:14:28,810 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:28,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:28,811 INFO L85 PathProgramCache]: Analyzing trace with hash -913190412, now seen corresponding path program 5 times [2024-06-27 22:14:28,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:28,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047657621] [2024-06-27 22:14:28,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:28,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:29,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:29,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:29,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047657621] [2024-06-27 22:14:29,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047657621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:29,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:29,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:14:29,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149505758] [2024-06-27 22:14:29,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:29,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:14:29,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:29,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:14:29,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:14:29,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:29,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 241 transitions, 3424 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:14:29,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:29,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:29,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:30,417 INFO L124 PetriNetUnfolderBase]: 1125/2118 cut-off events. [2024-06-27 22:14:30,417 INFO L125 PetriNetUnfolderBase]: For 22529/22529 co-relation queries the response was YES. [2024-06-27 22:14:30,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12060 conditions, 2118 events. 1125/2118 cut-off events. For 22529/22529 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12865 event pairs, 342 based on Foata normal form. 3/2046 useless extension candidates. Maximal degree in co-relation 11989. Up to 1608 conditions per place. [2024-06-27 22:14:30,432 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 250 selfloop transitions, 39 changer transitions 0/296 dead transitions. [2024-06-27 22:14:30,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 296 transitions, 4476 flow [2024-06-27 22:14:30,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:14:30,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:14:30,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-27 22:14:30,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2024-06-27 22:14:30,434 INFO L175 Difference]: Start difference. First operand has 143 places, 241 transitions, 3424 flow. Second operand 8 states and 141 transitions. [2024-06-27 22:14:30,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 296 transitions, 4476 flow [2024-06-27 22:14:30,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 296 transitions, 4392 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-27 22:14:30,477 INFO L231 Difference]: Finished difference. Result has 147 places, 250 transitions, 3590 flow [2024-06-27 22:14:30,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3340, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3590, PETRI_PLACES=147, PETRI_TRANSITIONS=250} [2024-06-27 22:14:30,477 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 107 predicate places. [2024-06-27 22:14:30,478 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 250 transitions, 3590 flow [2024-06-27 22:14:30,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:14:30,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:30,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:30,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:14:30,478 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:30,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:30,479 INFO L85 PathProgramCache]: Analyzing trace with hash -186491772, now seen corresponding path program 6 times [2024-06-27 22:14:30,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:30,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212207516] [2024-06-27 22:14:30,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:30,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:31,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:31,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:31,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212207516] [2024-06-27 22:14:31,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212207516] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:31,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:31,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:14:31,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658395346] [2024-06-27 22:14:31,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:31,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:14:31,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:31,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:14:31,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:14:31,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:31,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 250 transitions, 3590 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:14:31,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:31,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:31,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:31,959 INFO L124 PetriNetUnfolderBase]: 1156/2175 cut-off events. [2024-06-27 22:14:31,959 INFO L125 PetriNetUnfolderBase]: For 23790/23790 co-relation queries the response was YES. [2024-06-27 22:14:31,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12529 conditions, 2175 events. 1156/2175 cut-off events. For 23790/23790 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 13302 event pairs, 342 based on Foata normal form. 3/2100 useless extension candidates. Maximal degree in co-relation 12456. Up to 1712 conditions per place. [2024-06-27 22:14:31,973 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 260 selfloop transitions, 28 changer transitions 0/295 dead transitions. [2024-06-27 22:14:31,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 295 transitions, 4536 flow [2024-06-27 22:14:31,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:14:31,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:14:31,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-27 22:14:31,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-27 22:14:31,977 INFO L175 Difference]: Start difference. First operand has 147 places, 250 transitions, 3590 flow. Second operand 8 states and 136 transitions. [2024-06-27 22:14:31,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 295 transitions, 4536 flow [2024-06-27 22:14:32,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 295 transitions, 4428 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-27 22:14:32,028 INFO L231 Difference]: Finished difference. Result has 149 places, 256 transitions, 3666 flow [2024-06-27 22:14:32,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3486, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3666, PETRI_PLACES=149, PETRI_TRANSITIONS=256} [2024-06-27 22:14:32,029 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 109 predicate places. [2024-06-27 22:14:32,029 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 256 transitions, 3666 flow [2024-06-27 22:14:32,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:14:32,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:32,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:32,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:14:32,029 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:32,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:32,030 INFO L85 PathProgramCache]: Analyzing trace with hash -186195815, now seen corresponding path program 3 times [2024-06-27 22:14:32,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:32,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528040668] [2024-06-27 22:14:32,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:32,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:32,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:32,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528040668] [2024-06-27 22:14:32,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528040668] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:32,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:32,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:14:32,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945049793] [2024-06-27 22:14:32,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:32,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:14:32,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:32,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:14:32,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:14:33,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:33,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 256 transitions, 3666 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:14:33,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:33,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:33,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:33,534 INFO L124 PetriNetUnfolderBase]: 1153/2149 cut-off events. [2024-06-27 22:14:33,535 INFO L125 PetriNetUnfolderBase]: For 23928/23928 co-relation queries the response was YES. [2024-06-27 22:14:33,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12431 conditions, 2149 events. 1153/2149 cut-off events. For 23928/23928 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 13163 event pairs, 333 based on Foata normal form. 3/2079 useless extension candidates. Maximal degree in co-relation 12357. Up to 1765 conditions per place. [2024-06-27 22:14:33,550 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 257 selfloop transitions, 23 changer transitions 0/287 dead transitions. [2024-06-27 22:14:33,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 287 transitions, 4440 flow [2024-06-27 22:14:33,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:14:33,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:14:33,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-27 22:14:33,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4382716049382716 [2024-06-27 22:14:33,552 INFO L175 Difference]: Start difference. First operand has 149 places, 256 transitions, 3666 flow. Second operand 9 states and 142 transitions. [2024-06-27 22:14:33,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 287 transitions, 4440 flow [2024-06-27 22:14:33,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 287 transitions, 4354 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-27 22:14:33,602 INFO L231 Difference]: Finished difference. Result has 154 places, 264 transitions, 3765 flow [2024-06-27 22:14:33,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3580, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3765, PETRI_PLACES=154, PETRI_TRANSITIONS=264} [2024-06-27 22:14:33,602 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 114 predicate places. [2024-06-27 22:14:33,602 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 264 transitions, 3765 flow [2024-06-27 22:14:33,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:14:33,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:33,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:33,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:14:33,603 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:33,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:33,603 INFO L85 PathProgramCache]: Analyzing trace with hash -186184934, now seen corresponding path program 1 times [2024-06-27 22:14:33,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:33,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339115756] [2024-06-27 22:14:33,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:33,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:35,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:35,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339115756] [2024-06-27 22:14:35,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339115756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:35,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:35,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:14:35,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196370080] [2024-06-27 22:14:35,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:35,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:14:35,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:35,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:14:35,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:14:35,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:35,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 264 transitions, 3765 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 22:14:35,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:35,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:35,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:36,059 INFO L124 PetriNetUnfolderBase]: 1150/2141 cut-off events. [2024-06-27 22:14:36,060 INFO L125 PetriNetUnfolderBase]: For 23772/23772 co-relation queries the response was YES. [2024-06-27 22:14:36,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12471 conditions, 2141 events. 1150/2141 cut-off events. For 23772/23772 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 13110 event pairs, 342 based on Foata normal form. 2/2071 useless extension candidates. Maximal degree in co-relation 12394. Up to 1755 conditions per place. [2024-06-27 22:14:36,076 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 262 selfloop transitions, 22 changer transitions 0/291 dead transitions. [2024-06-27 22:14:36,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 291 transitions, 4441 flow [2024-06-27 22:14:36,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:14:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:14:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-06-27 22:14:36,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-27 22:14:36,093 INFO L175 Difference]: Start difference. First operand has 154 places, 264 transitions, 3765 flow. Second operand 9 states and 144 transitions. [2024-06-27 22:14:36,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 291 transitions, 4441 flow [2024-06-27 22:14:36,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 291 transitions, 4301 flow, removed 44 selfloop flow, removed 8 redundant places. [2024-06-27 22:14:36,182 INFO L231 Difference]: Finished difference. Result has 156 places, 266 transitions, 3702 flow [2024-06-27 22:14:36,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3625, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3702, PETRI_PLACES=156, PETRI_TRANSITIONS=266} [2024-06-27 22:14:36,182 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 116 predicate places. [2024-06-27 22:14:36,182 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 266 transitions, 3702 flow [2024-06-27 22:14:36,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 22:14:36,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:36,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:36,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:14:36,183 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:36,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:36,183 INFO L85 PathProgramCache]: Analyzing trace with hash -190886452, now seen corresponding path program 1 times [2024-06-27 22:14:36,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:36,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867329969] [2024-06-27 22:14:36,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:36,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:37,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:37,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867329969] [2024-06-27 22:14:37,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867329969] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:37,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:37,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:14:37,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143644467] [2024-06-27 22:14:37,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:37,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:14:37,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:37,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:14:37,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:14:37,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:37,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 266 transitions, 3702 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-27 22:14:37,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:37,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:37,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:38,179 INFO L124 PetriNetUnfolderBase]: 1184/2156 cut-off events. [2024-06-27 22:14:38,179 INFO L125 PetriNetUnfolderBase]: For 24032/24032 co-relation queries the response was YES. [2024-06-27 22:14:38,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12411 conditions, 2156 events. 1184/2156 cut-off events. For 24032/24032 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 13091 event pairs, 137 based on Foata normal form. 2/2096 useless extension candidates. Maximal degree in co-relation 12335. Up to 1502 conditions per place. [2024-06-27 22:14:38,197 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 254 selfloop transitions, 45 changer transitions 0/306 dead transitions. [2024-06-27 22:14:38,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 306 transitions, 4534 flow [2024-06-27 22:14:38,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:14:38,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:14:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-27 22:14:38,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2024-06-27 22:14:38,198 INFO L175 Difference]: Start difference. First operand has 156 places, 266 transitions, 3702 flow. Second operand 7 states and 136 transitions. [2024-06-27 22:14:38,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 306 transitions, 4534 flow [2024-06-27 22:14:38,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 306 transitions, 4465 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-27 22:14:38,254 INFO L231 Difference]: Finished difference. Result has 158 places, 274 transitions, 3813 flow [2024-06-27 22:14:38,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3633, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3813, PETRI_PLACES=158, PETRI_TRANSITIONS=274} [2024-06-27 22:14:38,257 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 118 predicate places. [2024-06-27 22:14:38,258 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 274 transitions, 3813 flow [2024-06-27 22:14:38,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-27 22:14:38,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:38,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:38,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:14:38,258 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:38,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:38,259 INFO L85 PathProgramCache]: Analyzing trace with hash -506312568, now seen corresponding path program 1 times [2024-06-27 22:14:38,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:38,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795545134] [2024-06-27 22:14:38,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:38,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:39,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:39,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795545134] [2024-06-27 22:14:39,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795545134] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:39,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:39,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:14:39,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241951192] [2024-06-27 22:14:39,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:39,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:14:39,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:39,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:14:39,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:14:39,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:39,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 274 transitions, 3813 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-27 22:14:39,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:39,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:39,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:40,213 INFO L124 PetriNetUnfolderBase]: 1195/2163 cut-off events. [2024-06-27 22:14:40,213 INFO L125 PetriNetUnfolderBase]: For 25368/25368 co-relation queries the response was YES. [2024-06-27 22:14:40,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12705 conditions, 2163 events. 1195/2163 cut-off events. For 25368/25368 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13065 event pairs, 171 based on Foata normal form. 1/2106 useless extension candidates. Maximal degree in co-relation 12629. Up to 1294 conditions per place. [2024-06-27 22:14:40,230 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 228 selfloop transitions, 83 changer transitions 0/318 dead transitions. [2024-06-27 22:14:40,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 318 transitions, 4767 flow [2024-06-27 22:14:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:14:40,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:14:40,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-27 22:14:40,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2024-06-27 22:14:40,232 INFO L175 Difference]: Start difference. First operand has 158 places, 274 transitions, 3813 flow. Second operand 8 states and 148 transitions. [2024-06-27 22:14:40,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 318 transitions, 4767 flow [2024-06-27 22:14:40,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 318 transitions, 4721 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 22:14:40,292 INFO L231 Difference]: Finished difference. Result has 165 places, 284 transitions, 4119 flow [2024-06-27 22:14:40,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3767, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4119, PETRI_PLACES=165, PETRI_TRANSITIONS=284} [2024-06-27 22:14:40,293 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 125 predicate places. [2024-06-27 22:14:40,293 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 284 transitions, 4119 flow [2024-06-27 22:14:40,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-27 22:14:40,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:40,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:40,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:14:40,293 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:40,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:40,294 INFO L85 PathProgramCache]: Analyzing trace with hash -506312692, now seen corresponding path program 2 times [2024-06-27 22:14:40,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:40,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833759479] [2024-06-27 22:14:40,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:40,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:41,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:41,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:41,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833759479] [2024-06-27 22:14:41,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833759479] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:41,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:41,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:14:41,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774789782] [2024-06-27 22:14:41,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:41,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:14:41,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:41,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:14:41,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:14:41,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:41,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 284 transitions, 4119 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-27 22:14:41,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:41,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:41,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:42,261 INFO L124 PetriNetUnfolderBase]: 1211/2219 cut-off events. [2024-06-27 22:14:42,261 INFO L125 PetriNetUnfolderBase]: For 27630/27630 co-relation queries the response was YES. [2024-06-27 22:14:42,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13477 conditions, 2219 events. 1211/2219 cut-off events. For 27630/27630 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13666 event pairs, 182 based on Foata normal form. 2/2153 useless extension candidates. Maximal degree in co-relation 13397. Up to 1640 conditions per place. [2024-06-27 22:14:42,278 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 265 selfloop transitions, 43 changer transitions 0/315 dead transitions. [2024-06-27 22:14:42,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 315 transitions, 4876 flow [2024-06-27 22:14:42,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:14:42,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:14:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-27 22:14:42,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5317460317460317 [2024-06-27 22:14:42,279 INFO L175 Difference]: Start difference. First operand has 165 places, 284 transitions, 4119 flow. Second operand 7 states and 134 transitions. [2024-06-27 22:14:42,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 315 transitions, 4876 flow [2024-06-27 22:14:42,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 315 transitions, 4836 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-27 22:14:42,343 INFO L231 Difference]: Finished difference. Result has 168 places, 285 transitions, 4180 flow [2024-06-27 22:14:42,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4079, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4180, PETRI_PLACES=168, PETRI_TRANSITIONS=285} [2024-06-27 22:14:42,344 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 128 predicate places. [2024-06-27 22:14:42,344 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 285 transitions, 4180 flow [2024-06-27 22:14:42,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-27 22:14:42,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:42,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:42,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:14:42,344 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:42,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:42,345 INFO L85 PathProgramCache]: Analyzing trace with hash -102226638, now seen corresponding path program 2 times [2024-06-27 22:14:42,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:42,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74948613] [2024-06-27 22:14:42,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:42,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:43,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:43,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:43,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74948613] [2024-06-27 22:14:43,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74948613] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:43,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:43,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:14:43,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249576492] [2024-06-27 22:14:43,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:43,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:14:43,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:43,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:14:43,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:14:43,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:14:43,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 285 transitions, 4180 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 22:14:43,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:43,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:14:43,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:44,171 INFO L124 PetriNetUnfolderBase]: 1173/2223 cut-off events. [2024-06-27 22:14:44,172 INFO L125 PetriNetUnfolderBase]: For 28614/28634 co-relation queries the response was YES. [2024-06-27 22:14:44,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13227 conditions, 2223 events. 1173/2223 cut-off events. For 28614/28634 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 14199 event pairs, 191 based on Foata normal form. 5/2138 useless extension candidates. Maximal degree in co-relation 13147. Up to 1456 conditions per place. [2024-06-27 22:14:44,192 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 195 selfloop transitions, 107 changer transitions 0/313 dead transitions. [2024-06-27 22:14:44,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 313 transitions, 4943 flow [2024-06-27 22:14:44,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:14:44,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:14:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-27 22:14:44,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2024-06-27 22:14:44,193 INFO L175 Difference]: Start difference. First operand has 168 places, 285 transitions, 4180 flow. Second operand 8 states and 146 transitions. [2024-06-27 22:14:44,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 313 transitions, 4943 flow [2024-06-27 22:14:44,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 313 transitions, 4857 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-27 22:14:44,259 INFO L231 Difference]: Finished difference. Result has 173 places, 290 transitions, 4407 flow [2024-06-27 22:14:44,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4094, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4407, PETRI_PLACES=173, PETRI_TRANSITIONS=290} [2024-06-27 22:14:44,260 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 133 predicate places. [2024-06-27 22:14:44,260 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 290 transitions, 4407 flow [2024-06-27 22:14:44,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 22:14:44,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:44,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:44,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:14:44,260 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:44,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:44,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1155873036, now seen corresponding path program 3 times [2024-06-27 22:14:44,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:44,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152173818] [2024-06-27 22:14:44,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:44,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:45,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:45,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152173818] [2024-06-27 22:14:45,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152173818] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:45,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:45,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:14:45,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416663362] [2024-06-27 22:14:45,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:45,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:14:45,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:45,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:14:45,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:14:45,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:14:45,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 290 transitions, 4407 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 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-27 22:14:45,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:45,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:14:45,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:45,950 INFO L124 PetriNetUnfolderBase]: 1183/2239 cut-off events. [2024-06-27 22:14:45,951 INFO L125 PetriNetUnfolderBase]: For 30544/30564 co-relation queries the response was YES. [2024-06-27 22:14:45,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13606 conditions, 2239 events. 1183/2239 cut-off events. For 30544/30564 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 14316 event pairs, 196 based on Foata normal form. 5/2154 useless extension candidates. Maximal degree in co-relation 13523. Up to 1437 conditions per place. [2024-06-27 22:14:45,970 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 199 selfloop transitions, 106 changer transitions 0/316 dead transitions. [2024-06-27 22:14:45,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 316 transitions, 5154 flow [2024-06-27 22:14:45,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:14:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:14:45,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-27 22:14:45,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2024-06-27 22:14:45,972 INFO L175 Difference]: Start difference. First operand has 173 places, 290 transitions, 4407 flow. Second operand 8 states and 147 transitions. [2024-06-27 22:14:45,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 316 transitions, 5154 flow [2024-06-27 22:14:46,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 316 transitions, 4961 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-27 22:14:46,050 INFO L231 Difference]: Finished difference. Result has 176 places, 292 transitions, 4454 flow [2024-06-27 22:14:46,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4214, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4454, PETRI_PLACES=176, PETRI_TRANSITIONS=292} [2024-06-27 22:14:46,050 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 136 predicate places. [2024-06-27 22:14:46,050 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 292 transitions, 4454 flow [2024-06-27 22:14:46,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 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-27 22:14:46,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:46,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:46,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:14:46,051 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:46,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:46,051 INFO L85 PathProgramCache]: Analyzing trace with hash -503516182, now seen corresponding path program 3 times [2024-06-27 22:14:46,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:46,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074481751] [2024-06-27 22:14:46,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:46,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:47,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:47,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074481751] [2024-06-27 22:14:47,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074481751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:47,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:47,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:14:47,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128304257] [2024-06-27 22:14:47,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:47,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:14:47,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:47,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:14:47,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:14:47,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:14:47,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 292 transitions, 4454 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 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-27 22:14:47,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:47,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:14:47,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:47,714 INFO L124 PetriNetUnfolderBase]: 1184/2236 cut-off events. [2024-06-27 22:14:47,714 INFO L125 PetriNetUnfolderBase]: For 30956/30976 co-relation queries the response was YES. [2024-06-27 22:14:47,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13650 conditions, 2236 events. 1184/2236 cut-off events. For 30956/30976 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 14249 event pairs, 189 based on Foata normal form. 6/2154 useless extension candidates. Maximal degree in co-relation 13566. Up to 1632 conditions per place. [2024-06-27 22:14:47,732 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 236 selfloop transitions, 68 changer transitions 0/315 dead transitions. [2024-06-27 22:14:47,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 315 transitions, 5148 flow [2024-06-27 22:14:47,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:14:47,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:14:47,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-27 22:14:47,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-27 22:14:47,733 INFO L175 Difference]: Start difference. First operand has 176 places, 292 transitions, 4454 flow. Second operand 7 states and 133 transitions. [2024-06-27 22:14:47,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 315 transitions, 5148 flow [2024-06-27 22:14:47,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 315 transitions, 4930 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-27 22:14:47,806 INFO L231 Difference]: Finished difference. Result has 177 places, 293 transitions, 4390 flow [2024-06-27 22:14:47,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4236, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4390, PETRI_PLACES=177, PETRI_TRANSITIONS=293} [2024-06-27 22:14:47,807 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 137 predicate places. [2024-06-27 22:14:47,807 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 293 transitions, 4390 flow [2024-06-27 22:14:47,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 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-27 22:14:47,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:47,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:47,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:14:47,808 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:47,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:47,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1505070514, now seen corresponding path program 4 times [2024-06-27 22:14:47,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:47,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882923618] [2024-06-27 22:14:47,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:47,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:49,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:49,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882923618] [2024-06-27 22:14:49,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882923618] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:49,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:49,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:14:49,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302641041] [2024-06-27 22:14:49,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:49,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:14:49,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:49,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:14:49,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:14:49,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:49,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 293 transitions, 4390 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 22:14:49,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:49,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:49,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:49,751 INFO L124 PetriNetUnfolderBase]: 1251/2224 cut-off events. [2024-06-27 22:14:49,751 INFO L125 PetriNetUnfolderBase]: For 30761/30761 co-relation queries the response was YES. [2024-06-27 22:14:49,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14153 conditions, 2224 events. 1251/2224 cut-off events. For 30761/30761 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 13293 event pairs, 168 based on Foata normal form. 1/2176 useless extension candidates. Maximal degree in co-relation 14069. Up to 1450 conditions per place. [2024-06-27 22:14:49,774 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 210 selfloop transitions, 118 changer transitions 0/335 dead transitions. [2024-06-27 22:14:49,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 335 transitions, 5365 flow [2024-06-27 22:14:49,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:14:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:14:49,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-27 22:14:49,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-06-27 22:14:49,775 INFO L175 Difference]: Start difference. First operand has 177 places, 293 transitions, 4390 flow. Second operand 8 states and 153 transitions. [2024-06-27 22:14:49,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 335 transitions, 5365 flow [2024-06-27 22:14:49,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 335 transitions, 5223 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-27 22:14:49,857 INFO L231 Difference]: Finished difference. Result has 181 places, 299 transitions, 4637 flow [2024-06-27 22:14:49,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4248, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4637, PETRI_PLACES=181, PETRI_TRANSITIONS=299} [2024-06-27 22:14:49,858 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 141 predicate places. [2024-06-27 22:14:49,858 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 299 transitions, 4637 flow [2024-06-27 22:14:49,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 22:14:49,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:49,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:49,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:14:49,859 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:49,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:49,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1740901314, now seen corresponding path program 5 times [2024-06-27 22:14:49,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:49,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424636044] [2024-06-27 22:14:49,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:49,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:51,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-27 22:14:51,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:51,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424636044] [2024-06-27 22:14:51,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424636044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:51,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:51,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:14:51,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787069911] [2024-06-27 22:14:51,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:51,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:14:51,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:51,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:14:51,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:14:51,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:14:51,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 299 transitions, 4637 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 22:14:51,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:51,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:14:51,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:51,765 INFO L124 PetriNetUnfolderBase]: 1210/2296 cut-off events. [2024-06-27 22:14:51,766 INFO L125 PetriNetUnfolderBase]: For 32863/32883 co-relation queries the response was YES. [2024-06-27 22:14:51,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14202 conditions, 2296 events. 1210/2296 cut-off events. For 32863/32883 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 14780 event pairs, 190 based on Foata normal form. 5/2207 useless extension candidates. Maximal degree in co-relation 14115. Up to 1512 conditions per place. [2024-06-27 22:14:51,783 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 209 selfloop transitions, 112 changer transitions 0/332 dead transitions. [2024-06-27 22:14:51,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 332 transitions, 5475 flow [2024-06-27 22:14:51,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:14:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:14:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-27 22:14:51,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-27 22:14:51,786 INFO L175 Difference]: Start difference. First operand has 181 places, 299 transitions, 4637 flow. Second operand 8 states and 152 transitions. [2024-06-27 22:14:51,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 332 transitions, 5475 flow [2024-06-27 22:14:51,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 332 transitions, 5325 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-27 22:14:51,864 INFO L231 Difference]: Finished difference. Result has 185 places, 306 transitions, 4819 flow [2024-06-27 22:14:51,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4498, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4819, PETRI_PLACES=185, PETRI_TRANSITIONS=306} [2024-06-27 22:14:51,865 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 145 predicate places. [2024-06-27 22:14:51,865 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 306 transitions, 4819 flow [2024-06-27 22:14:51,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-27 22:14:51,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:51,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:51,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:14:51,866 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:51,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:51,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1929407938, now seen corresponding path program 1 times [2024-06-27 22:14:51,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:51,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472306975] [2024-06-27 22:14:51,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:51,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:53,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:53,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:53,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472306975] [2024-06-27 22:14:53,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472306975] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:53,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:53,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:14:53,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618810565] [2024-06-27 22:14:53,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:53,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:14:53,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:53,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:14:53,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:14:53,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:53,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 306 transitions, 4819 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 22:14:53,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:53,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:53,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:54,364 INFO L124 PetriNetUnfolderBase]: 1317/2478 cut-off events. [2024-06-27 22:14:54,364 INFO L125 PetriNetUnfolderBase]: For 37616/37616 co-relation queries the response was YES. [2024-06-27 22:14:54,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15302 conditions, 2478 events. 1317/2478 cut-off events. For 37616/37616 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 15943 event pairs, 200 based on Foata normal form. 2/2392 useless extension candidates. Maximal degree in co-relation 15215. Up to 1468 conditions per place. [2024-06-27 22:14:54,381 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 217 selfloop transitions, 140 changer transitions 0/364 dead transitions. [2024-06-27 22:14:54,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 364 transitions, 6059 flow [2024-06-27 22:14:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:14:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:14:54,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 215 transitions. [2024-06-27 22:14:54,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4976851851851852 [2024-06-27 22:14:54,387 INFO L175 Difference]: Start difference. First operand has 185 places, 306 transitions, 4819 flow. Second operand 12 states and 215 transitions. [2024-06-27 22:14:54,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 364 transitions, 6059 flow [2024-06-27 22:14:54,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 364 transitions, 5830 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-27 22:14:54,485 INFO L231 Difference]: Finished difference. Result has 192 places, 316 transitions, 4987 flow [2024-06-27 22:14:54,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4590, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4987, PETRI_PLACES=192, PETRI_TRANSITIONS=316} [2024-06-27 22:14:54,486 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 152 predicate places. [2024-06-27 22:14:54,486 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 316 transitions, 4987 flow [2024-06-27 22:14:54,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 22:14:54,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:54,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:54,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:14:54,486 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:54,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:54,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1929414448, now seen corresponding path program 2 times [2024-06-27 22:14:54,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:54,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294742011] [2024-06-27 22:14:54,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:54,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:55,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:55,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294742011] [2024-06-27 22:14:55,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294742011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:55,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:55,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:14:55,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550646575] [2024-06-27 22:14:55,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:55,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:14:55,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:55,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:14:55,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:14:55,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:55,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 316 transitions, 4987 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 22:14:55,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:55,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:55,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:56,707 INFO L124 PetriNetUnfolderBase]: 1313/2472 cut-off events. [2024-06-27 22:14:56,707 INFO L125 PetriNetUnfolderBase]: For 37874/37874 co-relation queries the response was YES. [2024-06-27 22:14:56,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15408 conditions, 2472 events. 1313/2472 cut-off events. For 37874/37874 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 15892 event pairs, 201 based on Foata normal form. 2/2386 useless extension candidates. Maximal degree in co-relation 15319. Up to 1465 conditions per place. [2024-06-27 22:14:56,729 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 212 selfloop transitions, 138 changer transitions 0/357 dead transitions. [2024-06-27 22:14:56,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 357 transitions, 6019 flow [2024-06-27 22:14:56,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:14:56,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:14:56,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-06-27 22:14:56,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2024-06-27 22:14:56,731 INFO L175 Difference]: Start difference. First operand has 192 places, 316 transitions, 4987 flow. Second operand 10 states and 185 transitions. [2024-06-27 22:14:56,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 357 transitions, 6019 flow [2024-06-27 22:14:56,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 357 transitions, 5713 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-27 22:14:56,826 INFO L231 Difference]: Finished difference. Result has 194 places, 316 transitions, 4966 flow [2024-06-27 22:14:56,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4681, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4966, PETRI_PLACES=194, PETRI_TRANSITIONS=316} [2024-06-27 22:14:56,826 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 154 predicate places. [2024-06-27 22:14:56,826 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 316 transitions, 4966 flow [2024-06-27 22:14:56,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 22:14:56,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:56,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:56,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:14:56,827 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:56,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:56,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1505065864, now seen corresponding path program 6 times [2024-06-27 22:14:56,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:56,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325049282] [2024-06-27 22:14:56,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:56,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:57,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:57,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:57,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325049282] [2024-06-27 22:14:57,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325049282] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:57,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:57,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:14:57,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152792256] [2024-06-27 22:14:57,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:57,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:14:57,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:57,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:14:57,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:14:57,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:14:57,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 316 transitions, 4966 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 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-27 22:14:57,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:57,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:14:57,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:14:58,440 INFO L124 PetriNetUnfolderBase]: 1248/2256 cut-off events. [2024-06-27 22:14:58,440 INFO L125 PetriNetUnfolderBase]: For 36594/36614 co-relation queries the response was YES. [2024-06-27 22:14:58,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14582 conditions, 2256 events. 1248/2256 cut-off events. For 36594/36614 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 13950 event pairs, 195 based on Foata normal form. 5/2193 useless extension candidates. Maximal degree in co-relation 14492. Up to 1570 conditions per place. [2024-06-27 22:14:58,458 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 211 selfloop transitions, 122 changer transitions 0/344 dead transitions. [2024-06-27 22:14:58,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 344 transitions, 5777 flow [2024-06-27 22:14:58,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:14:58,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:14:58,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2024-06-27 22:14:58,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5515873015873016 [2024-06-27 22:14:58,460 INFO L175 Difference]: Start difference. First operand has 194 places, 316 transitions, 4966 flow. Second operand 7 states and 139 transitions. [2024-06-27 22:14:58,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 344 transitions, 5777 flow [2024-06-27 22:14:58,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 344 transitions, 5497 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:14:58,547 INFO L231 Difference]: Finished difference. Result has 192 places, 320 transitions, 4996 flow [2024-06-27 22:14:58,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4690, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4996, PETRI_PLACES=192, PETRI_TRANSITIONS=320} [2024-06-27 22:14:58,548 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 152 predicate places. [2024-06-27 22:14:58,548 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 320 transitions, 4996 flow [2024-06-27 22:14:58,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 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-27 22:14:58,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:14:58,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:14:58,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:14:58,548 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:14:58,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:14:58,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1514002978, now seen corresponding path program 3 times [2024-06-27 22:14:58,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:14:58,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316343669] [2024-06-27 22:14:58,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:14:58,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:14:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:14:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:14:59,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:14:59,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316343669] [2024-06-27 22:14:59,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316343669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:14:59,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:14:59,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:14:59,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743006940] [2024-06-27 22:14:59,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:14:59,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:14:59,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:14:59,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:14:59,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:14:59,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:14:59,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 320 transitions, 4996 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-27 22:14:59,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:14:59,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:14:59,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:00,493 INFO L124 PetriNetUnfolderBase]: 1363/2549 cut-off events. [2024-06-27 22:15:00,493 INFO L125 PetriNetUnfolderBase]: For 38151/38151 co-relation queries the response was YES. [2024-06-27 22:15:00,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15687 conditions, 2549 events. 1363/2549 cut-off events. For 38151/38151 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 16449 event pairs, 210 based on Foata normal form. 2/2462 useless extension candidates. Maximal degree in co-relation 15597. Up to 1524 conditions per place. [2024-06-27 22:15:00,516 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 205 selfloop transitions, 157 changer transitions 0/369 dead transitions. [2024-06-27 22:15:00,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 369 transitions, 6132 flow [2024-06-27 22:15:00,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:15:00,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:15:00,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-27 22:15:00,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-06-27 22:15:00,518 INFO L175 Difference]: Start difference. First operand has 192 places, 320 transitions, 4996 flow. Second operand 9 states and 168 transitions. [2024-06-27 22:15:00,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 369 transitions, 6132 flow [2024-06-27 22:15:00,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 369 transitions, 5872 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-27 22:15:00,626 INFO L231 Difference]: Finished difference. Result has 198 places, 336 transitions, 5329 flow [2024-06-27 22:15:00,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4742, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5329, PETRI_PLACES=198, PETRI_TRANSITIONS=336} [2024-06-27 22:15:00,627 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 158 predicate places. [2024-06-27 22:15:00,627 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 336 transitions, 5329 flow [2024-06-27 22:15:00,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-27 22:15:00,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:00,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:00,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 22:15:00,628 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:00,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:00,628 INFO L85 PathProgramCache]: Analyzing trace with hash 642703194, now seen corresponding path program 4 times [2024-06-27 22:15:00,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:00,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356853469] [2024-06-27 22:15:00,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:00,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:01,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:01,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356853469] [2024-06-27 22:15:01,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356853469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:01,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:01,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:15:01,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266127812] [2024-06-27 22:15:01,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:01,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:15:01,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:01,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:15:01,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:15:01,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:15:01,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 336 transitions, 5329 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-27 22:15:01,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:01,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:15:01,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:02,490 INFO L124 PetriNetUnfolderBase]: 1359/2530 cut-off events. [2024-06-27 22:15:02,490 INFO L125 PetriNetUnfolderBase]: For 38945/38945 co-relation queries the response was YES. [2024-06-27 22:15:02,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16025 conditions, 2530 events. 1359/2530 cut-off events. For 38945/38945 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 16245 event pairs, 363 based on Foata normal form. 2/2449 useless extension candidates. Maximal degree in co-relation 15932. Up to 1466 conditions per place. [2024-06-27 22:15:02,511 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 228 selfloop transitions, 144 changer transitions 0/379 dead transitions. [2024-06-27 22:15:02,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 379 transitions, 6442 flow [2024-06-27 22:15:02,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:15:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:15:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-27 22:15:02,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2024-06-27 22:15:02,512 INFO L175 Difference]: Start difference. First operand has 198 places, 336 transitions, 5329 flow. Second operand 9 states and 159 transitions. [2024-06-27 22:15:02,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 379 transitions, 6442 flow [2024-06-27 22:15:02,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 379 transitions, 6193 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-27 22:15:02,618 INFO L231 Difference]: Finished difference. Result has 205 places, 340 transitions, 5621 flow [2024-06-27 22:15:02,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5101, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5621, PETRI_PLACES=205, PETRI_TRANSITIONS=340} [2024-06-27 22:15:02,619 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 165 predicate places. [2024-06-27 22:15:02,619 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 340 transitions, 5621 flow [2024-06-27 22:15:02,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-27 22:15:02,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:02,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:02,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 22:15:02,619 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:02,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:02,620 INFO L85 PathProgramCache]: Analyzing trace with hash 38714758, now seen corresponding path program 7 times [2024-06-27 22:15:02,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:02,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966877865] [2024-06-27 22:15:02,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:02,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:03,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:03,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966877865] [2024-06-27 22:15:03,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966877865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:03,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:03,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:15:03,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643902841] [2024-06-27 22:15:03,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:03,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:15:03,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:03,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:15:03,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:15:03,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:15:03,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 340 transitions, 5621 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 22:15:03,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:03,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:15:03,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:04,611 INFO L124 PetriNetUnfolderBase]: 1376/2587 cut-off events. [2024-06-27 22:15:04,611 INFO L125 PetriNetUnfolderBase]: For 41115/41115 co-relation queries the response was YES. [2024-06-27 22:15:04,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16672 conditions, 2587 events. 1376/2587 cut-off events. For 41115/41115 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 16756 event pairs, 407 based on Foata normal form. 1/2497 useless extension candidates. Maximal degree in co-relation 16575. Up to 2097 conditions per place. [2024-06-27 22:15:04,635 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 328 selfloop transitions, 51 changer transitions 0/386 dead transitions. [2024-06-27 22:15:04,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 386 transitions, 6765 flow [2024-06-27 22:15:04,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:15:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:15:04,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-27 22:15:04,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-27 22:15:04,650 INFO L175 Difference]: Start difference. First operand has 205 places, 340 transitions, 5621 flow. Second operand 9 states and 153 transitions. [2024-06-27 22:15:04,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 386 transitions, 6765 flow [2024-06-27 22:15:04,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 386 transitions, 6596 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-27 22:15:04,771 INFO L231 Difference]: Finished difference. Result has 211 places, 358 transitions, 5872 flow [2024-06-27 22:15:04,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5452, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5872, PETRI_PLACES=211, PETRI_TRANSITIONS=358} [2024-06-27 22:15:04,772 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 171 predicate places. [2024-06-27 22:15:04,772 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 358 transitions, 5872 flow [2024-06-27 22:15:04,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 22:15:04,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:04,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:04,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 22:15:04,773 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:04,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:04,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1608017776, now seen corresponding path program 8 times [2024-06-27 22:15:04,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:04,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097951458] [2024-06-27 22:15:04,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:04,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:06,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:06,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:06,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097951458] [2024-06-27 22:15:06,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097951458] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:06,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:06,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:15:06,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448150997] [2024-06-27 22:15:06,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:06,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:15:06,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:06,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:15:06,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:15:06,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:15:06,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 358 transitions, 5872 flow. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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-27 22:15:06,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:06,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:15:06,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:06,898 INFO L124 PetriNetUnfolderBase]: 1401/2620 cut-off events. [2024-06-27 22:15:06,898 INFO L125 PetriNetUnfolderBase]: For 43090/43090 co-relation queries the response was YES. [2024-06-27 22:15:06,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16681 conditions, 2620 events. 1401/2620 cut-off events. For 43090/43090 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 16953 event pairs, 396 based on Foata normal form. 3/2533 useless extension candidates. Maximal degree in co-relation 16583. Up to 2126 conditions per place. [2024-06-27 22:15:06,924 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 350 selfloop transitions, 46 changer transitions 0/403 dead transitions. [2024-06-27 22:15:06,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 403 transitions, 7109 flow [2024-06-27 22:15:06,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:15:06,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:15:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 161 transitions. [2024-06-27 22:15:06,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44722222222222224 [2024-06-27 22:15:06,926 INFO L175 Difference]: Start difference. First operand has 211 places, 358 transitions, 5872 flow. Second operand 10 states and 161 transitions. [2024-06-27 22:15:06,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 403 transitions, 7109 flow [2024-06-27 22:15:07,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 403 transitions, 6980 flow, removed 43 selfloop flow, removed 4 redundant places. [2024-06-27 22:15:07,059 INFO L231 Difference]: Finished difference. Result has 219 places, 377 transitions, 6151 flow [2024-06-27 22:15:07,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5751, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6151, PETRI_PLACES=219, PETRI_TRANSITIONS=377} [2024-06-27 22:15:07,060 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 179 predicate places. [2024-06-27 22:15:07,061 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 377 transitions, 6151 flow [2024-06-27 22:15:07,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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-27 22:15:07,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:07,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:07,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 22:15:07,062 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:07,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:07,062 INFO L85 PathProgramCache]: Analyzing trace with hash 815008568, now seen corresponding path program 5 times [2024-06-27 22:15:07,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:07,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447521546] [2024-06-27 22:15:07,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:07,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:08,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:08,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:08,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447521546] [2024-06-27 22:15:08,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447521546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:08,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:08,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:15:08,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710930145] [2024-06-27 22:15:08,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:08,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:15:08,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:08,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:15:08,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:15:08,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:15:08,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 377 transitions, 6151 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 22:15:08,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:08,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:15:08,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:08,899 INFO L124 PetriNetUnfolderBase]: 1396/2614 cut-off events. [2024-06-27 22:15:08,899 INFO L125 PetriNetUnfolderBase]: For 42048/42048 co-relation queries the response was YES. [2024-06-27 22:15:08,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16962 conditions, 2614 events. 1396/2614 cut-off events. For 42048/42048 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 16924 event pairs, 396 based on Foata normal form. 3/2526 useless extension candidates. Maximal degree in co-relation 16861. Up to 2099 conditions per place. [2024-06-27 22:15:08,926 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 365 selfloop transitions, 40 changer transitions 0/412 dead transitions. [2024-06-27 22:15:08,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 412 transitions, 7194 flow [2024-06-27 22:15:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:15:08,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:15:08,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 159 transitions. [2024-06-27 22:15:08,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2024-06-27 22:15:08,927 INFO L175 Difference]: Start difference. First operand has 219 places, 377 transitions, 6151 flow. Second operand 10 states and 159 transitions. [2024-06-27 22:15:08,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 412 transitions, 7194 flow [2024-06-27 22:15:09,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 412 transitions, 7067 flow, removed 54 selfloop flow, removed 4 redundant places. [2024-06-27 22:15:09,054 INFO L231 Difference]: Finished difference. Result has 225 places, 379 transitions, 6156 flow [2024-06-27 22:15:09,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=6024, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6156, PETRI_PLACES=225, PETRI_TRANSITIONS=379} [2024-06-27 22:15:09,055 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 185 predicate places. [2024-06-27 22:15:09,055 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 379 transitions, 6156 flow [2024-06-27 22:15:09,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 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-27 22:15:09,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:09,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:09,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 22:15:09,056 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:09,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:09,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1900519642, now seen corresponding path program 1 times [2024-06-27 22:15:09,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:09,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976490053] [2024-06-27 22:15:09,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:09,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:09,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:09,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976490053] [2024-06-27 22:15:09,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976490053] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:09,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:09,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:15:09,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22222857] [2024-06-27 22:15:09,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:09,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:15:09,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:09,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:15:09,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:15:09,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2024-06-27 22:15:09,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 379 transitions, 6156 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:09,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:09,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2024-06-27 22:15:09,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:09,405 INFO L124 PetriNetUnfolderBase]: 732/1403 cut-off events. [2024-06-27 22:15:09,405 INFO L125 PetriNetUnfolderBase]: For 20279/20345 co-relation queries the response was YES. [2024-06-27 22:15:09,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9573 conditions, 1403 events. 732/1403 cut-off events. For 20279/20345 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8101 event pairs, 139 based on Foata normal form. 137/1417 useless extension candidates. Maximal degree in co-relation 9471. Up to 596 conditions per place. [2024-06-27 22:15:09,417 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 130 selfloop transitions, 50 changer transitions 0/253 dead transitions. [2024-06-27 22:15:09,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 253 transitions, 4608 flow [2024-06-27 22:15:09,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:15:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:15:09,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2024-06-27 22:15:09,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-06-27 22:15:09,419 INFO L175 Difference]: Start difference. First operand has 225 places, 379 transitions, 6156 flow. Second operand 4 states and 99 transitions. [2024-06-27 22:15:09,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 253 transitions, 4608 flow [2024-06-27 22:15:09,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 253 transitions, 3483 flow, removed 56 selfloop flow, removed 52 redundant places. [2024-06-27 22:15:09,478 INFO L231 Difference]: Finished difference. Result has 178 places, 240 transitions, 3249 flow [2024-06-27 22:15:09,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3015, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3249, PETRI_PLACES=178, PETRI_TRANSITIONS=240} [2024-06-27 22:15:09,478 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 138 predicate places. [2024-06-27 22:15:09,478 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 240 transitions, 3249 flow [2024-06-27 22:15:09,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:09,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:09,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:09,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 22:15:09,482 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:09,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:09,482 INFO L85 PathProgramCache]: Analyzing trace with hash -2132141313, now seen corresponding path program 1 times [2024-06-27 22:15:09,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:09,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135174957] [2024-06-27 22:15:09,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:09,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:10,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:10,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135174957] [2024-06-27 22:15:10,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135174957] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:10,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:10,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:15:10,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618942787] [2024-06-27 22:15:10,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:10,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:15:10,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:10,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:15:10,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:15:10,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:15:10,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 240 transitions, 3249 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-27 22:15:10,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:10,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:15:10,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:11,376 INFO L124 PetriNetUnfolderBase]: 796/1580 cut-off events. [2024-06-27 22:15:11,376 INFO L125 PetriNetUnfolderBase]: For 36245/36259 co-relation queries the response was YES. [2024-06-27 22:15:11,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9411 conditions, 1580 events. 796/1580 cut-off events. For 36245/36259 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9208 event pairs, 125 based on Foata normal form. 4/1463 useless extension candidates. Maximal degree in co-relation 9329. Up to 441 conditions per place. [2024-06-27 22:15:11,388 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 143 selfloop transitions, 121 changer transitions 0/276 dead transitions. [2024-06-27 22:15:11,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 276 transitions, 4133 flow [2024-06-27 22:15:11,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:15:11,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:15:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-27 22:15:11,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5123456790123457 [2024-06-27 22:15:11,390 INFO L175 Difference]: Start difference. First operand has 178 places, 240 transitions, 3249 flow. Second operand 9 states and 166 transitions. [2024-06-27 22:15:11,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 276 transitions, 4133 flow [2024-06-27 22:15:11,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 276 transitions, 4100 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 22:15:11,475 INFO L231 Difference]: Finished difference. Result has 184 places, 243 transitions, 3585 flow [2024-06-27 22:15:11,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3216, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3585, PETRI_PLACES=184, PETRI_TRANSITIONS=243} [2024-06-27 22:15:11,476 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 144 predicate places. [2024-06-27 22:15:11,476 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 243 transitions, 3585 flow [2024-06-27 22:15:11,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-27 22:15:11,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:11,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:11,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 22:15:11,476 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:11,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:11,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1484180479, now seen corresponding path program 2 times [2024-06-27 22:15:11,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:11,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168792075] [2024-06-27 22:15:11,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:11,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:12,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:12,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168792075] [2024-06-27 22:15:12,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168792075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:12,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:12,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:15:12,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444058171] [2024-06-27 22:15:12,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:12,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:15:12,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:12,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:15:12,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:15:12,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:15:12,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 243 transitions, 3585 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:12,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:12,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:15:12,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:13,351 INFO L124 PetriNetUnfolderBase]: 811/1607 cut-off events. [2024-06-27 22:15:13,351 INFO L125 PetriNetUnfolderBase]: For 39909/39923 co-relation queries the response was YES. [2024-06-27 22:15:13,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10080 conditions, 1607 events. 811/1607 cut-off events. For 39909/39923 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9477 event pairs, 220 based on Foata normal form. 4/1488 useless extension candidates. Maximal degree in co-relation 9994. Up to 1147 conditions per place. [2024-06-27 22:15:13,363 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 168 selfloop transitions, 81 changer transitions 0/261 dead transitions. [2024-06-27 22:15:13,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 261 transitions, 4147 flow [2024-06-27 22:15:13,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:15:13,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:15:13,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-27 22:15:13,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-27 22:15:13,372 INFO L175 Difference]: Start difference. First operand has 184 places, 243 transitions, 3585 flow. Second operand 9 states and 150 transitions. [2024-06-27 22:15:13,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 261 transitions, 4147 flow [2024-06-27 22:15:13,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 261 transitions, 3992 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-27 22:15:13,464 INFO L231 Difference]: Finished difference. Result has 188 places, 244 transitions, 3608 flow [2024-06-27 22:15:13,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3433, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3608, PETRI_PLACES=188, PETRI_TRANSITIONS=244} [2024-06-27 22:15:13,465 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 148 predicate places. [2024-06-27 22:15:13,465 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 244 transitions, 3608 flow [2024-06-27 22:15:13,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:13,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:13,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:13,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 22:15:13,466 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:13,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:13,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1484180634, now seen corresponding path program 1 times [2024-06-27 22:15:13,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:13,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99742596] [2024-06-27 22:15:13,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:13,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:14,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:14,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:14,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99742596] [2024-06-27 22:15:14,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99742596] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:14,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:14,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:15:14,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630424651] [2024-06-27 22:15:14,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:14,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:15:14,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:14,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:15:14,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:15:15,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:15:15,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 244 transitions, 3608 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-27 22:15:15,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:15,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:15:15,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:15,463 INFO L124 PetriNetUnfolderBase]: 825/1629 cut-off events. [2024-06-27 22:15:15,464 INFO L125 PetriNetUnfolderBase]: For 40681/40695 co-relation queries the response was YES. [2024-06-27 22:15:15,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10274 conditions, 1629 events. 825/1629 cut-off events. For 40681/40695 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9620 event pairs, 211 based on Foata normal form. 4/1505 useless extension candidates. Maximal degree in co-relation 10187. Up to 871 conditions per place. [2024-06-27 22:15:15,475 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 131 selfloop transitions, 120 changer transitions 0/263 dead transitions. [2024-06-27 22:15:15,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 263 transitions, 4296 flow [2024-06-27 22:15:15,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:15:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:15:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-27 22:15:15,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783950617283951 [2024-06-27 22:15:15,476 INFO L175 Difference]: Start difference. First operand has 188 places, 244 transitions, 3608 flow. Second operand 9 states and 155 transitions. [2024-06-27 22:15:15,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 263 transitions, 4296 flow [2024-06-27 22:15:15,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 263 transitions, 4120 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-27 22:15:15,571 INFO L231 Difference]: Finished difference. Result has 189 places, 246 transitions, 3713 flow [2024-06-27 22:15:15,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3432, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3713, PETRI_PLACES=189, PETRI_TRANSITIONS=246} [2024-06-27 22:15:15,573 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 149 predicate places. [2024-06-27 22:15:15,573 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 246 transitions, 3713 flow [2024-06-27 22:15:15,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-27 22:15:15,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:15,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:15,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 22:15:15,573 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:15,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:15,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1484176759, now seen corresponding path program 3 times [2024-06-27 22:15:15,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:15,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947780808] [2024-06-27 22:15:15,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:15,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:16,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:16,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947780808] [2024-06-27 22:15:16,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947780808] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:16,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:16,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:15:16,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158511101] [2024-06-27 22:15:16,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:16,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:15:16,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:16,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:15:16,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:15:16,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:15:16,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 246 transitions, 3713 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-27 22:15:16,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:16,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:15:16,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:17,315 INFO L124 PetriNetUnfolderBase]: 841/1668 cut-off events. [2024-06-27 22:15:17,315 INFO L125 PetriNetUnfolderBase]: For 43054/43068 co-relation queries the response was YES. [2024-06-27 22:15:17,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10562 conditions, 1668 events. 841/1668 cut-off events. For 43054/43068 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9976 event pairs, 212 based on Foata normal form. 4/1542 useless extension candidates. Maximal degree in co-relation 10475. Up to 1146 conditions per place. [2024-06-27 22:15:17,328 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 174 selfloop transitions, 82 changer transitions 0/268 dead transitions. [2024-06-27 22:15:17,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 268 transitions, 4306 flow [2024-06-27 22:15:17,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:15:17,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:15:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-27 22:15:17,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783950617283951 [2024-06-27 22:15:17,329 INFO L175 Difference]: Start difference. First operand has 189 places, 246 transitions, 3713 flow. Second operand 9 states and 155 transitions. [2024-06-27 22:15:17,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 268 transitions, 4306 flow [2024-06-27 22:15:17,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 268 transitions, 4063 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-27 22:15:17,430 INFO L231 Difference]: Finished difference. Result has 191 places, 247 transitions, 3649 flow [2024-06-27 22:15:17,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3470, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3649, PETRI_PLACES=191, PETRI_TRANSITIONS=247} [2024-06-27 22:15:17,431 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 151 predicate places. [2024-06-27 22:15:17,431 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 247 transitions, 3649 flow [2024-06-27 22:15:17,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-27 22:15:17,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:17,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:17,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 22:15:17,432 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:17,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:17,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1125948156, now seen corresponding path program 2 times [2024-06-27 22:15:17,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:17,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52179681] [2024-06-27 22:15:17,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:17,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:18,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:18,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52179681] [2024-06-27 22:15:18,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52179681] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:18,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:18,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:15:18,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995647835] [2024-06-27 22:15:18,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:18,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:15:18,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:18,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:15:18,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:15:18,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:15:18,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 247 transitions, 3649 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:18,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:18,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:15:18,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:19,331 INFO L124 PetriNetUnfolderBase]: 855/1692 cut-off events. [2024-06-27 22:15:19,332 INFO L125 PetriNetUnfolderBase]: For 43117/43140 co-relation queries the response was YES. [2024-06-27 22:15:19,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10719 conditions, 1692 events. 855/1692 cut-off events. For 43117/43140 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10146 event pairs, 198 based on Foata normal form. 10/1567 useless extension candidates. Maximal degree in co-relation 10632. Up to 1127 conditions per place. [2024-06-27 22:15:19,344 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 126 selfloop transitions, 124 changer transitions 0/262 dead transitions. [2024-06-27 22:15:19,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 262 transitions, 4233 flow [2024-06-27 22:15:19,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:15:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:15:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-27 22:15:19,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-27 22:15:19,346 INFO L175 Difference]: Start difference. First operand has 191 places, 247 transitions, 3649 flow. Second operand 9 states and 150 transitions. [2024-06-27 22:15:19,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 262 transitions, 4233 flow [2024-06-27 22:15:19,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 262 transitions, 4067 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-27 22:15:19,461 INFO L231 Difference]: Finished difference. Result has 193 places, 249 transitions, 3779 flow [2024-06-27 22:15:19,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3483, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3779, PETRI_PLACES=193, PETRI_TRANSITIONS=249} [2024-06-27 22:15:19,461 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 153 predicate places. [2024-06-27 22:15:19,462 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 249 transitions, 3779 flow [2024-06-27 22:15:19,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:19,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:19,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:19,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 22:15:19,462 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:19,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:19,463 INFO L85 PathProgramCache]: Analyzing trace with hash 710357971, now seen corresponding path program 4 times [2024-06-27 22:15:19,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:19,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236050629] [2024-06-27 22:15:19,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:19,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:20,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:20,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:20,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236050629] [2024-06-27 22:15:20,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236050629] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:20,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:20,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:15:20,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053995825] [2024-06-27 22:15:20,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:20,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:15:20,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:20,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:15:20,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:15:20,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:15:20,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 249 transitions, 3779 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:20,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:20,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:15:20,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:21,464 INFO L124 PetriNetUnfolderBase]: 935/1908 cut-off events. [2024-06-27 22:15:21,464 INFO L125 PetriNetUnfolderBase]: For 56199/56225 co-relation queries the response was YES. [2024-06-27 22:15:21,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11566 conditions, 1908 events. 935/1908 cut-off events. For 56199/56225 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11996 event pairs, 239 based on Foata normal form. 20/1776 useless extension candidates. Maximal degree in co-relation 11478. Up to 1113 conditions per place. [2024-06-27 22:15:21,478 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 136 selfloop transitions, 123 changer transitions 0/271 dead transitions. [2024-06-27 22:15:21,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 271 transitions, 4412 flow [2024-06-27 22:15:21,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:15:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:15:21,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-27 22:15:21,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4876543209876543 [2024-06-27 22:15:21,480 INFO L175 Difference]: Start difference. First operand has 193 places, 249 transitions, 3779 flow. Second operand 9 states and 158 transitions. [2024-06-27 22:15:21,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 271 transitions, 4412 flow [2024-06-27 22:15:21,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 271 transitions, 4152 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-27 22:15:21,594 INFO L231 Difference]: Finished difference. Result has 195 places, 250 transitions, 3784 flow [2024-06-27 22:15:21,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3519, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3784, PETRI_PLACES=195, PETRI_TRANSITIONS=250} [2024-06-27 22:15:21,595 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 155 predicate places. [2024-06-27 22:15:21,595 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 250 transitions, 3784 flow [2024-06-27 22:15:21,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:21,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:21,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:21,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 22:15:21,596 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:21,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:21,596 INFO L85 PathProgramCache]: Analyzing trace with hash 710358126, now seen corresponding path program 3 times [2024-06-27 22:15:21,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:21,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026411627] [2024-06-27 22:15:21,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:21,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:23,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:23,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:23,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026411627] [2024-06-27 22:15:23,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026411627] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:23,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:23,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:15:23,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061734341] [2024-06-27 22:15:23,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:23,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:15:23,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:23,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:15:23,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:15:23,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:15:23,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 250 transitions, 3784 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-27 22:15:23,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:23,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:15:23,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:23,825 INFO L124 PetriNetUnfolderBase]: 949/1910 cut-off events. [2024-06-27 22:15:23,826 INFO L125 PetriNetUnfolderBase]: For 48087/48113 co-relation queries the response was YES. [2024-06-27 22:15:23,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11722 conditions, 1910 events. 949/1910 cut-off events. For 48087/48113 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11974 event pairs, 240 based on Foata normal form. 10/1763 useless extension candidates. Maximal degree in co-relation 11633. Up to 1282 conditions per place. [2024-06-27 22:15:23,845 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 126 selfloop transitions, 128 changer transitions 0/266 dead transitions. [2024-06-27 22:15:23,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 266 transitions, 4382 flow [2024-06-27 22:15:23,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:15:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:15:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-27 22:15:23,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-27 22:15:23,846 INFO L175 Difference]: Start difference. First operand has 195 places, 250 transitions, 3784 flow. Second operand 9 states and 153 transitions. [2024-06-27 22:15:23,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 266 transitions, 4382 flow [2024-06-27 22:15:23,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 266 transitions, 4136 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-27 22:15:23,979 INFO L231 Difference]: Finished difference. Result has 197 places, 252 transitions, 3837 flow [2024-06-27 22:15:23,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3538, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3837, PETRI_PLACES=197, PETRI_TRANSITIONS=252} [2024-06-27 22:15:23,980 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 157 predicate places. [2024-06-27 22:15:23,980 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 252 transitions, 3837 flow [2024-06-27 22:15:23,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-27 22:15:23,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:23,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:23,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 22:15:23,980 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:23,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:23,981 INFO L85 PathProgramCache]: Analyzing trace with hash 710213976, now seen corresponding path program 4 times [2024-06-27 22:15:23,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:23,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220369905] [2024-06-27 22:15:23,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:23,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:25,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:25,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:25,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220369905] [2024-06-27 22:15:25,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220369905] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:25,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:25,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:15:25,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221890762] [2024-06-27 22:15:25,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:25,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:15:25,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:25,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:15:25,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:15:25,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:15:25,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 252 transitions, 3837 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-27 22:15:25,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:25,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:15:25,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:25,941 INFO L124 PetriNetUnfolderBase]: 963/1930 cut-off events. [2024-06-27 22:15:25,941 INFO L125 PetriNetUnfolderBase]: For 50187/50213 co-relation queries the response was YES. [2024-06-27 22:15:25,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11959 conditions, 1930 events. 963/1930 cut-off events. For 50187/50213 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12070 event pairs, 240 based on Foata normal form. 10/1777 useless extension candidates. Maximal degree in co-relation 11869. Up to 1282 conditions per place. [2024-06-27 22:15:25,960 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 127 selfloop transitions, 129 changer transitions 0/268 dead transitions. [2024-06-27 22:15:25,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 268 transitions, 4443 flow [2024-06-27 22:15:25,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:15:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:15:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-27 22:15:25,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2024-06-27 22:15:25,980 INFO L175 Difference]: Start difference. First operand has 197 places, 252 transitions, 3837 flow. Second operand 9 states and 154 transitions. [2024-06-27 22:15:25,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 268 transitions, 4443 flow [2024-06-27 22:15:26,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 268 transitions, 4168 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-27 22:15:26,121 INFO L231 Difference]: Finished difference. Result has 199 places, 254 transitions, 3867 flow [2024-06-27 22:15:26,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3562, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3867, PETRI_PLACES=199, PETRI_TRANSITIONS=254} [2024-06-27 22:15:26,122 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 159 predicate places. [2024-06-27 22:15:26,122 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 254 transitions, 3867 flow [2024-06-27 22:15:26,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-27 22:15:26,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:26,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:26,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 22:15:26,123 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:26,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:26,123 INFO L85 PathProgramCache]: Analyzing trace with hash 710213821, now seen corresponding path program 5 times [2024-06-27 22:15:26,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:26,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785404292] [2024-06-27 22:15:26,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:26,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:27,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-27 22:15:27,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:27,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785404292] [2024-06-27 22:15:27,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785404292] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:27,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:27,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:15:27,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781364316] [2024-06-27 22:15:27,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:27,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:15:27,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:27,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:15:27,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:15:27,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:15:27,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 254 transitions, 3867 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:27,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:27,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:15:27,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:28,113 INFO L124 PetriNetUnfolderBase]: 978/1967 cut-off events. [2024-06-27 22:15:28,113 INFO L125 PetriNetUnfolderBase]: For 51902/51928 co-relation queries the response was YES. [2024-06-27 22:15:28,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12111 conditions, 1967 events. 978/1967 cut-off events. For 51902/51928 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12414 event pairs, 252 based on Foata normal form. 10/1811 useless extension candidates. Maximal degree in co-relation 12020. Up to 1316 conditions per place. [2024-06-27 22:15:28,130 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 137 selfloop transitions, 123 changer transitions 0/272 dead transitions. [2024-06-27 22:15:28,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 272 transitions, 4466 flow [2024-06-27 22:15:28,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:15:28,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:15:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-27 22:15:28,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783950617283951 [2024-06-27 22:15:28,131 INFO L175 Difference]: Start difference. First operand has 199 places, 254 transitions, 3867 flow. Second operand 9 states and 155 transitions. [2024-06-27 22:15:28,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 272 transitions, 4466 flow [2024-06-27 22:15:28,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 272 transitions, 4185 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-27 22:15:28,270 INFO L231 Difference]: Finished difference. Result has 201 places, 255 transitions, 3851 flow [2024-06-27 22:15:28,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3586, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3851, PETRI_PLACES=201, PETRI_TRANSITIONS=255} [2024-06-27 22:15:28,271 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 161 predicate places. [2024-06-27 22:15:28,271 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 255 transitions, 3851 flow [2024-06-27 22:15:28,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:28,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:28,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:28,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 22:15:28,271 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:28,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:28,272 INFO L85 PathProgramCache]: Analyzing trace with hash 710210101, now seen corresponding path program 6 times [2024-06-27 22:15:28,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:28,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868386255] [2024-06-27 22:15:28,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:28,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:29,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:29,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868386255] [2024-06-27 22:15:29,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868386255] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:29,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:29,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:15:29,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29053336] [2024-06-27 22:15:29,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:29,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:15:29,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:29,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:15:29,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:15:29,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:15:29,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 255 transitions, 3851 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:29,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:29,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:15:29,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:30,203 INFO L124 PetriNetUnfolderBase]: 993/1994 cut-off events. [2024-06-27 22:15:30,203 INFO L125 PetriNetUnfolderBase]: For 53167/53193 co-relation queries the response was YES. [2024-06-27 22:15:30,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12208 conditions, 1994 events. 993/1994 cut-off events. For 53167/53193 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12617 event pairs, 289 based on Foata normal form. 10/1838 useless extension candidates. Maximal degree in co-relation 12116. Up to 1471 conditions per place. [2024-06-27 22:15:30,221 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 178 selfloop transitions, 84 changer transitions 0/274 dead transitions. [2024-06-27 22:15:30,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 274 transitions, 4450 flow [2024-06-27 22:15:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:15:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:15:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-27 22:15:30,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2024-06-27 22:15:30,223 INFO L175 Difference]: Start difference. First operand has 201 places, 255 transitions, 3851 flow. Second operand 9 states and 152 transitions. [2024-06-27 22:15:30,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 274 transitions, 4450 flow [2024-06-27 22:15:30,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 274 transitions, 4198 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-27 22:15:30,452 INFO L231 Difference]: Finished difference. Result has 203 places, 256 transitions, 3788 flow [2024-06-27 22:15:30,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3599, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3788, PETRI_PLACES=203, PETRI_TRANSITIONS=256} [2024-06-27 22:15:30,453 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 163 predicate places. [2024-06-27 22:15:30,453 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 256 transitions, 3788 flow [2024-06-27 22:15:30,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:30,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:30,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:30,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 22:15:30,453 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:30,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:30,454 INFO L85 PathProgramCache]: Analyzing trace with hash 587451505, now seen corresponding path program 7 times [2024-06-27 22:15:30,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:30,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199780107] [2024-06-27 22:15:30,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:30,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:31,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:31,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199780107] [2024-06-27 22:15:31,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199780107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:31,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:31,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:15:31,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744779197] [2024-06-27 22:15:31,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:31,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:15:31,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:31,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:15:31,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:15:31,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:15:31,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 256 transitions, 3788 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:31,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:31,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:15:31,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:32,609 INFO L124 PetriNetUnfolderBase]: 992/1979 cut-off events. [2024-06-27 22:15:32,609 INFO L125 PetriNetUnfolderBase]: For 54267/54285 co-relation queries the response was YES. [2024-06-27 22:15:32,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12098 conditions, 1979 events. 992/1979 cut-off events. For 54267/54285 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12343 event pairs, 169 based on Foata normal form. 5/1832 useless extension candidates. Maximal degree in co-relation 12005. Up to 967 conditions per place. [2024-06-27 22:15:32,625 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 129 selfloop transitions, 149 changer transitions 0/290 dead transitions. [2024-06-27 22:15:32,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 290 transitions, 4729 flow [2024-06-27 22:15:32,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:15:32,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:15:32,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-27 22:15:32,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5308641975308642 [2024-06-27 22:15:32,627 INFO L175 Difference]: Start difference. First operand has 203 places, 256 transitions, 3788 flow. Second operand 9 states and 172 transitions. [2024-06-27 22:15:32,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 290 transitions, 4729 flow [2024-06-27 22:15:32,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 290 transitions, 4557 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-27 22:15:32,770 INFO L231 Difference]: Finished difference. Result has 206 places, 257 transitions, 3935 flow [2024-06-27 22:15:32,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3616, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3935, PETRI_PLACES=206, PETRI_TRANSITIONS=257} [2024-06-27 22:15:32,770 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 166 predicate places. [2024-06-27 22:15:32,770 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 257 transitions, 3935 flow [2024-06-27 22:15:32,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:32,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:32,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:32,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 22:15:32,771 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:32,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:32,771 INFO L85 PathProgramCache]: Analyzing trace with hash 310398925, now seen corresponding path program 8 times [2024-06-27 22:15:32,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:32,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133438389] [2024-06-27 22:15:32,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:32,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:34,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:34,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133438389] [2024-06-27 22:15:34,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133438389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:34,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:34,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:15:34,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430466280] [2024-06-27 22:15:34,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:34,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:15:34,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:34,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:15:34,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:15:34,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:15:34,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 257 transitions, 3935 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:34,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:34,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:15:34,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:34,866 INFO L124 PetriNetUnfolderBase]: 1132/2218 cut-off events. [2024-06-27 22:15:34,866 INFO L125 PetriNetUnfolderBase]: For 57578/57578 co-relation queries the response was YES. [2024-06-27 22:15:34,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13465 conditions, 2218 events. 1132/2218 cut-off events. For 57578/57578 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13878 event pairs, 274 based on Foata normal form. 2/2079 useless extension candidates. Maximal degree in co-relation 13371. Up to 1382 conditions per place. [2024-06-27 22:15:34,885 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 136 selfloop transitions, 147 changer transitions 0/291 dead transitions. [2024-06-27 22:15:34,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 291 transitions, 4805 flow [2024-06-27 22:15:34,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:15:34,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:15:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-27 22:15:34,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49691358024691357 [2024-06-27 22:15:34,886 INFO L175 Difference]: Start difference. First operand has 206 places, 257 transitions, 3935 flow. Second operand 9 states and 161 transitions. [2024-06-27 22:15:34,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 291 transitions, 4805 flow [2024-06-27 22:15:35,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 291 transitions, 4462 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-27 22:15:35,055 INFO L231 Difference]: Finished difference. Result has 208 places, 258 transitions, 3911 flow [2024-06-27 22:15:35,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3594, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3911, PETRI_PLACES=208, PETRI_TRANSITIONS=258} [2024-06-27 22:15:35,055 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 168 predicate places. [2024-06-27 22:15:35,055 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 258 transitions, 3911 flow [2024-06-27 22:15:35,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:35,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:35,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:35,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 22:15:35,056 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:35,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:35,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1872139586, now seen corresponding path program 5 times [2024-06-27 22:15:35,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:35,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34884257] [2024-06-27 22:15:35,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:35,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:36,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:36,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34884257] [2024-06-27 22:15:36,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34884257] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:36,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:36,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:15:36,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120385203] [2024-06-27 22:15:36,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:36,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:15:36,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:36,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:15:36,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:15:36,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:15:36,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 258 transitions, 3911 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:36,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:36,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:15:36,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:37,225 INFO L124 PetriNetUnfolderBase]: 1029/2078 cut-off events. [2024-06-27 22:15:37,226 INFO L125 PetriNetUnfolderBase]: For 60471/60489 co-relation queries the response was YES. [2024-06-27 22:15:37,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12759 conditions, 2078 events. 1029/2078 cut-off events. For 60471/60489 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13372 event pairs, 254 based on Foata normal form. 5/1904 useless extension candidates. Maximal degree in co-relation 12664. Up to 1298 conditions per place. [2024-06-27 22:15:37,246 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 125 selfloop transitions, 146 changer transitions 0/283 dead transitions. [2024-06-27 22:15:37,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 283 transitions, 4737 flow [2024-06-27 22:15:37,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:15:37,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:15:37,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-27 22:15:37,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49691358024691357 [2024-06-27 22:15:37,248 INFO L175 Difference]: Start difference. First operand has 208 places, 258 transitions, 3911 flow. Second operand 9 states and 161 transitions. [2024-06-27 22:15:37,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 283 transitions, 4737 flow [2024-06-27 22:15:37,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 283 transitions, 4432 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-27 22:15:37,414 INFO L231 Difference]: Finished difference. Result has 210 places, 262 transitions, 3991 flow [2024-06-27 22:15:37,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3606, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3991, PETRI_PLACES=210, PETRI_TRANSITIONS=262} [2024-06-27 22:15:37,415 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 170 predicate places. [2024-06-27 22:15:37,415 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 262 transitions, 3991 flow [2024-06-27 22:15:37,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:37,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:37,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:37,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 22:15:37,415 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:37,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:37,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1866633056, now seen corresponding path program 6 times [2024-06-27 22:15:37,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:37,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4305143] [2024-06-27 22:15:37,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:37,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:38,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-27 22:15:38,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:38,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4305143] [2024-06-27 22:15:38,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4305143] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:38,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:38,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:15:38,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035682364] [2024-06-27 22:15:38,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:38,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:15:38,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:38,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:15:38,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:15:38,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:15:38,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 262 transitions, 3991 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:38,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:38,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:15:38,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:39,603 INFO L124 PetriNetUnfolderBase]: 1078/2153 cut-off events. [2024-06-27 22:15:39,603 INFO L125 PetriNetUnfolderBase]: For 66057/66077 co-relation queries the response was YES. [2024-06-27 22:15:39,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13440 conditions, 2153 events. 1078/2153 cut-off events. For 66057/66077 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 13788 event pairs, 268 based on Foata normal form. 5/1962 useless extension candidates. Maximal degree in co-relation 13344. Up to 1482 conditions per place. [2024-06-27 22:15:39,620 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 143 selfloop transitions, 128 changer transitions 0/283 dead transitions. [2024-06-27 22:15:39,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 283 transitions, 4801 flow [2024-06-27 22:15:39,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:15:39,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:15:39,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-27 22:15:39,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46944444444444444 [2024-06-27 22:15:39,621 INFO L175 Difference]: Start difference. First operand has 210 places, 262 transitions, 3991 flow. Second operand 10 states and 169 transitions. [2024-06-27 22:15:39,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 283 transitions, 4801 flow [2024-06-27 22:15:39,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 283 transitions, 4598 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-27 22:15:39,793 INFO L231 Difference]: Finished difference. Result has 216 places, 266 transitions, 4163 flow [2024-06-27 22:15:39,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3788, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4163, PETRI_PLACES=216, PETRI_TRANSITIONS=266} [2024-06-27 22:15:39,794 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 176 predicate places. [2024-06-27 22:15:39,794 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 266 transitions, 4163 flow [2024-06-27 22:15:39,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:39,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:39,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:39,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 22:15:39,795 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:39,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:39,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1228298125, now seen corresponding path program 9 times [2024-06-27 22:15:39,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:39,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573471509] [2024-06-27 22:15:39,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:39,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:41,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:41,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573471509] [2024-06-27 22:15:41,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573471509] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:41,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:41,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:15:41,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424799198] [2024-06-27 22:15:41,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:41,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:15:41,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:41,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:15:41,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:15:41,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:15:41,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 266 transitions, 4163 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:41,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:41,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:15:41,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:41,865 INFO L124 PetriNetUnfolderBase]: 1094/2193 cut-off events. [2024-06-27 22:15:41,866 INFO L125 PetriNetUnfolderBase]: For 68594/68612 co-relation queries the response was YES. [2024-06-27 22:15:41,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13902 conditions, 2193 events. 1094/2193 cut-off events. For 68594/68612 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14150 event pairs, 314 based on Foata normal form. 5/1999 useless extension candidates. Maximal degree in co-relation 13803. Up to 1714 conditions per place. [2024-06-27 22:15:41,886 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 189 selfloop transitions, 81 changer transitions 0/282 dead transitions. [2024-06-27 22:15:41,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 282 transitions, 4766 flow [2024-06-27 22:15:41,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:15:41,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:15:41,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-27 22:15:41,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-27 22:15:41,888 INFO L175 Difference]: Start difference. First operand has 216 places, 266 transitions, 4163 flow. Second operand 9 states and 150 transitions. [2024-06-27 22:15:41,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 282 transitions, 4766 flow [2024-06-27 22:15:42,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 282 transitions, 4499 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-27 22:15:42,085 INFO L231 Difference]: Finished difference. Result has 218 places, 267 transitions, 4083 flow [2024-06-27 22:15:42,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3896, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4083, PETRI_PLACES=218, PETRI_TRANSITIONS=267} [2024-06-27 22:15:42,086 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 178 predicate places. [2024-06-27 22:15:42,086 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 267 transitions, 4083 flow [2024-06-27 22:15:42,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:42,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:42,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:42,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 22:15:42,087 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:42,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:42,087 INFO L85 PathProgramCache]: Analyzing trace with hash 587605110, now seen corresponding path program 7 times [2024-06-27 22:15:42,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:42,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214134479] [2024-06-27 22:15:42,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:42,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:43,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:43,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214134479] [2024-06-27 22:15:43,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214134479] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:43,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:43,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:15:43,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999166306] [2024-06-27 22:15:43,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:43,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:15:43,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:43,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:15:43,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:15:43,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:15:43,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 267 transitions, 4083 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:43,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:43,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:15:43,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:44,374 INFO L124 PetriNetUnfolderBase]: 1090/2193 cut-off events. [2024-06-27 22:15:44,374 INFO L125 PetriNetUnfolderBase]: For 69272/69290 co-relation queries the response was YES. [2024-06-27 22:15:44,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13778 conditions, 2193 events. 1090/2193 cut-off events. For 69272/69290 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14187 event pairs, 299 based on Foata normal form. 3/2000 useless extension candidates. Maximal degree in co-relation 13679. Up to 1535 conditions per place. [2024-06-27 22:15:44,396 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 135 selfloop transitions, 139 changer transitions 0/286 dead transitions. [2024-06-27 22:15:44,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 286 transitions, 4757 flow [2024-06-27 22:15:44,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:15:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:15:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-27 22:15:44,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2024-06-27 22:15:44,398 INFO L175 Difference]: Start difference. First operand has 218 places, 267 transitions, 4083 flow. Second operand 9 states and 154 transitions. [2024-06-27 22:15:44,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 286 transitions, 4757 flow [2024-06-27 22:15:44,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 286 transitions, 4583 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-27 22:15:44,600 INFO L231 Difference]: Finished difference. Result has 220 places, 269 transitions, 4247 flow [2024-06-27 22:15:44,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3909, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4247, PETRI_PLACES=220, PETRI_TRANSITIONS=269} [2024-06-27 22:15:44,602 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 180 predicate places. [2024-06-27 22:15:44,603 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 269 transitions, 4247 flow [2024-06-27 22:15:44,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:44,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:44,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:44,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 22:15:44,603 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:44,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:44,604 INFO L85 PathProgramCache]: Analyzing trace with hash 316113000, now seen corresponding path program 8 times [2024-06-27 22:15:44,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:44,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734589793] [2024-06-27 22:15:44,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:44,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:46,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-27 22:15:46,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:46,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734589793] [2024-06-27 22:15:46,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734589793] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:46,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:46,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:15:46,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011560434] [2024-06-27 22:15:46,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:46,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:15:46,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:46,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:15:46,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:15:46,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:15:46,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 269 transitions, 4247 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:46,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:46,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:15:46,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:46,931 INFO L124 PetriNetUnfolderBase]: 1137/2263 cut-off events. [2024-06-27 22:15:46,931 INFO L125 PetriNetUnfolderBase]: For 72229/72246 co-relation queries the response was YES. [2024-06-27 22:15:46,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14511 conditions, 2263 events. 1137/2263 cut-off events. For 72229/72246 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14629 event pairs, 277 based on Foata normal form. 5/2059 useless extension candidates. Maximal degree in co-relation 14410. Up to 1601 conditions per place. [2024-06-27 22:15:46,952 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 148 selfloop transitions, 135 changer transitions 0/295 dead transitions. [2024-06-27 22:15:46,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 295 transitions, 5041 flow [2024-06-27 22:15:46,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:15:46,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:15:46,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 191 transitions. [2024-06-27 22:15:46,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44212962962962965 [2024-06-27 22:15:46,953 INFO L175 Difference]: Start difference. First operand has 220 places, 269 transitions, 4247 flow. Second operand 12 states and 191 transitions. [2024-06-27 22:15:46,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 295 transitions, 5041 flow [2024-06-27 22:15:47,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 295 transitions, 4731 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-27 22:15:47,149 INFO L231 Difference]: Finished difference. Result has 225 places, 277 transitions, 4378 flow [2024-06-27 22:15:47,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3949, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4378, PETRI_PLACES=225, PETRI_TRANSITIONS=277} [2024-06-27 22:15:47,149 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 185 predicate places. [2024-06-27 22:15:47,149 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 277 transitions, 4378 flow [2024-06-27 22:15:47,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:47,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:47,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:47,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-27 22:15:47,150 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:47,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:47,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1228303860, now seen corresponding path program 9 times [2024-06-27 22:15:47,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:47,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535976299] [2024-06-27 22:15:47,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:47,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:48,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-27 22:15:48,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:48,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535976299] [2024-06-27 22:15:48,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535976299] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:48,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:48,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:15:48,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585225531] [2024-06-27 22:15:48,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:48,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:15:48,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:48,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:15:48,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:15:48,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:15:48,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 277 transitions, 4378 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:48,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:48,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:15:48,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:49,503 INFO L124 PetriNetUnfolderBase]: 1133/2252 cut-off events. [2024-06-27 22:15:49,503 INFO L125 PetriNetUnfolderBase]: For 71444/71462 co-relation queries the response was YES. [2024-06-27 22:15:49,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14298 conditions, 2252 events. 1133/2252 cut-off events. For 71444/71462 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 14484 event pairs, 268 based on Foata normal form. 5/2046 useless extension candidates. Maximal degree in co-relation 14196. Up to 1595 conditions per place. [2024-06-27 22:15:49,528 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 150 selfloop transitions, 131 changer transitions 0/293 dead transitions. [2024-06-27 22:15:49,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 293 transitions, 5006 flow [2024-06-27 22:15:49,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:15:49,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:15:49,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-27 22:15:49,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46111111111111114 [2024-06-27 22:15:49,530 INFO L175 Difference]: Start difference. First operand has 225 places, 277 transitions, 4378 flow. Second operand 10 states and 166 transitions. [2024-06-27 22:15:49,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 293 transitions, 5006 flow [2024-06-27 22:15:49,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 293 transitions, 4786 flow, removed 27 selfloop flow, removed 7 redundant places. [2024-06-27 22:15:49,708 INFO L231 Difference]: Finished difference. Result has 228 places, 277 transitions, 4429 flow [2024-06-27 22:15:49,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4158, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4429, PETRI_PLACES=228, PETRI_TRANSITIONS=277} [2024-06-27 22:15:49,708 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 188 predicate places. [2024-06-27 22:15:49,709 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 277 transitions, 4429 flow [2024-06-27 22:15:49,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:49,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:49,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:49,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-27 22:15:49,709 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:49,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:49,709 INFO L85 PathProgramCache]: Analyzing trace with hash 587599375, now seen corresponding path program 10 times [2024-06-27 22:15:49,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:49,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109551687] [2024-06-27 22:15:49,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:49,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:50,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-27 22:15:50,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:50,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109551687] [2024-06-27 22:15:50,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109551687] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:50,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:50,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:15:50,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673856663] [2024-06-27 22:15:50,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:50,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:15:50,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:50,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:15:50,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:15:51,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:15:51,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 277 transitions, 4429 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-27 22:15:51,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:51,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:15:51,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:51,601 INFO L124 PetriNetUnfolderBase]: 1131/2271 cut-off events. [2024-06-27 22:15:51,601 INFO L125 PetriNetUnfolderBase]: For 74818/74836 co-relation queries the response was YES. [2024-06-27 22:15:51,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14312 conditions, 2271 events. 1131/2271 cut-off events. For 74818/74836 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14784 event pairs, 348 based on Foata normal form. 3/2066 useless extension candidates. Maximal degree in co-relation 14209. Up to 1770 conditions per place. [2024-06-27 22:15:51,621 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 195 selfloop transitions, 88 changer transitions 0/295 dead transitions. [2024-06-27 22:15:51,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 295 transitions, 5080 flow [2024-06-27 22:15:51,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:15:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:15:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-27 22:15:51,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-06-27 22:15:51,622 INFO L175 Difference]: Start difference. First operand has 228 places, 277 transitions, 4429 flow. Second operand 8 states and 140 transitions. [2024-06-27 22:15:51,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 295 transitions, 5080 flow [2024-06-27 22:15:51,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 295 transitions, 4798 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-27 22:15:51,801 INFO L231 Difference]: Finished difference. Result has 227 places, 278 transitions, 4350 flow [2024-06-27 22:15:51,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4147, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4350, PETRI_PLACES=227, PETRI_TRANSITIONS=278} [2024-06-27 22:15:51,801 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 187 predicate places. [2024-06-27 22:15:51,802 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 278 transitions, 4350 flow [2024-06-27 22:15:51,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-27 22:15:51,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:51,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:51,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-27 22:15:51,802 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:51,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash 316120936, now seen corresponding path program 1 times [2024-06-27 22:15:51,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:51,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021849471] [2024-06-27 22:15:51,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:51,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:54,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:54,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:54,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021849471] [2024-06-27 22:15:54,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021849471] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:54,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:54,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:15:54,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435501779] [2024-06-27 22:15:54,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:54,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:15:54,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:54,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:15:54,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:15:54,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:15:54,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 278 transitions, 4350 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:54,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:54,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:15:54,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:54,918 INFO L124 PetriNetUnfolderBase]: 1283/2474 cut-off events. [2024-06-27 22:15:54,918 INFO L125 PetriNetUnfolderBase]: For 80872/80874 co-relation queries the response was YES. [2024-06-27 22:15:54,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15324 conditions, 2474 events. 1283/2474 cut-off events. For 80872/80874 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 15662 event pairs, 293 based on Foata normal form. 6/2313 useless extension candidates. Maximal degree in co-relation 15221. Up to 1763 conditions per place. [2024-06-27 22:15:54,941 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 175 selfloop transitions, 123 changer transitions 0/306 dead transitions. [2024-06-27 22:15:54,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 306 transitions, 5090 flow [2024-06-27 22:15:54,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:15:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:15:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-27 22:15:54,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46944444444444444 [2024-06-27 22:15:54,943 INFO L175 Difference]: Start difference. First operand has 227 places, 278 transitions, 4350 flow. Second operand 10 states and 169 transitions. [2024-06-27 22:15:54,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 306 transitions, 5090 flow [2024-06-27 22:15:55,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 306 transitions, 4900 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 22:15:55,141 INFO L231 Difference]: Finished difference. Result has 231 places, 281 transitions, 4457 flow [2024-06-27 22:15:55,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4160, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4457, PETRI_PLACES=231, PETRI_TRANSITIONS=281} [2024-06-27 22:15:55,142 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 191 predicate places. [2024-06-27 22:15:55,142 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 281 transitions, 4457 flow [2024-06-27 22:15:55,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:15:55,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:55,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:55,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-27 22:15:55,143 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:55,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:55,143 INFO L85 PathProgramCache]: Analyzing trace with hash 587599530, now seen corresponding path program 10 times [2024-06-27 22:15:55,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:55,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400395233] [2024-06-27 22:15:55,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:55,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:56,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:56,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:56,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400395233] [2024-06-27 22:15:56,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400395233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:56,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:56,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:15:56,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003040352] [2024-06-27 22:15:56,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:56,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:15:56,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:56,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:15:56,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:15:56,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:15:56,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 281 transitions, 4457 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-27 22:15:56,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:56,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:15:56,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:57,196 INFO L124 PetriNetUnfolderBase]: 1164/2331 cut-off events. [2024-06-27 22:15:57,196 INFO L125 PetriNetUnfolderBase]: For 79922/79940 co-relation queries the response was YES. [2024-06-27 22:15:57,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14771 conditions, 2331 events. 1164/2331 cut-off events. For 79922/79940 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15278 event pairs, 303 based on Foata normal form. 3/2121 useless extension candidates. Maximal degree in co-relation 14666. Up to 1627 conditions per place. [2024-06-27 22:15:57,221 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 139 selfloop transitions, 150 changer transitions 0/301 dead transitions. [2024-06-27 22:15:57,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 301 transitions, 5173 flow [2024-06-27 22:15:57,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:15:57,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:15:57,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-27 22:15:57,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4876543209876543 [2024-06-27 22:15:57,222 INFO L175 Difference]: Start difference. First operand has 231 places, 281 transitions, 4457 flow. Second operand 9 states and 158 transitions. [2024-06-27 22:15:57,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 301 transitions, 5173 flow [2024-06-27 22:15:57,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 301 transitions, 4898 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-27 22:15:57,438 INFO L231 Difference]: Finished difference. Result has 232 places, 283 transitions, 4543 flow [2024-06-27 22:15:57,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4184, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4543, PETRI_PLACES=232, PETRI_TRANSITIONS=283} [2024-06-27 22:15:57,439 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 192 predicate places. [2024-06-27 22:15:57,439 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 283 transitions, 4543 flow [2024-06-27 22:15:57,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-27 22:15:57,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:15:57,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:15:57,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-27 22:15:57,439 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:15:57,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:15:57,440 INFO L85 PathProgramCache]: Analyzing trace with hash 657487612, now seen corresponding path program 2 times [2024-06-27 22:15:57,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:15:57,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299153258] [2024-06-27 22:15:57,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:15:57,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:15:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:15:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:15:58,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:15:58,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299153258] [2024-06-27 22:15:58,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299153258] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:15:58,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:15:58,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:15:58,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258247310] [2024-06-27 22:15:58,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:15:58,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:15:58,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:15:58,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:15:58,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:15:59,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:15:59,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 283 transitions, 4543 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:15:59,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:15:59,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:15:59,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:15:59,806 INFO L124 PetriNetUnfolderBase]: 1344/2617 cut-off events. [2024-06-27 22:15:59,806 INFO L125 PetriNetUnfolderBase]: For 87652/87652 co-relation queries the response was YES. [2024-06-27 22:15:59,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16199 conditions, 2617 events. 1344/2617 cut-off events. For 87652/87652 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 16903 event pairs, 564 based on Foata normal form. 4/2447 useless extension candidates. Maximal degree in co-relation 16093. Up to 1952 conditions per place. [2024-06-27 22:15:59,833 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 190 selfloop transitions, 110 changer transitions 0/308 dead transitions. [2024-06-27 22:15:59,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 308 transitions, 5300 flow [2024-06-27 22:15:59,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:15:59,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:15:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 159 transitions. [2024-06-27 22:15:59,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2024-06-27 22:15:59,835 INFO L175 Difference]: Start difference. First operand has 232 places, 283 transitions, 4543 flow. Second operand 10 states and 159 transitions. [2024-06-27 22:15:59,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 308 transitions, 5300 flow [2024-06-27 22:16:00,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 308 transitions, 4969 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-27 22:16:00,042 INFO L231 Difference]: Finished difference. Result has 235 places, 287 transitions, 4491 flow [2024-06-27 22:16:00,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4212, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4491, PETRI_PLACES=235, PETRI_TRANSITIONS=287} [2024-06-27 22:16:00,043 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 195 predicate places. [2024-06-27 22:16:00,043 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 287 transitions, 4491 flow [2024-06-27 22:16:00,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:00,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:00,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:00,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-27 22:16:00,044 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:00,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:00,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1200365946, now seen corresponding path program 11 times [2024-06-27 22:16:00,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:00,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92255408] [2024-06-27 22:16:00,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:00,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:01,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:01,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92255408] [2024-06-27 22:16:01,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92255408] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:01,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:01,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:16:01,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637088555] [2024-06-27 22:16:01,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:01,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:16:01,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:01,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:16:01,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:16:01,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:16:01,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 287 transitions, 4491 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:01,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:01,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:16:01,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:02,459 INFO L124 PetriNetUnfolderBase]: 1374/2657 cut-off events. [2024-06-27 22:16:02,460 INFO L125 PetriNetUnfolderBase]: For 86235/86235 co-relation queries the response was YES. [2024-06-27 22:16:02,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16515 conditions, 2657 events. 1374/2657 cut-off events. For 86235/86235 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 17109 event pairs, 555 based on Foata normal form. 2/2472 useless extension candidates. Maximal degree in co-relation 16408. Up to 2226 conditions per place. [2024-06-27 22:16:02,486 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 260 selfloop transitions, 54 changer transitions 0/322 dead transitions. [2024-06-27 22:16:02,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 322 transitions, 5465 flow [2024-06-27 22:16:02,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:16:02,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:16:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 190 transitions. [2024-06-27 22:16:02,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.405982905982906 [2024-06-27 22:16:02,488 INFO L175 Difference]: Start difference. First operand has 235 places, 287 transitions, 4491 flow. Second operand 13 states and 190 transitions. [2024-06-27 22:16:02,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 322 transitions, 5465 flow [2024-06-27 22:16:02,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 322 transitions, 5218 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-27 22:16:02,710 INFO L231 Difference]: Finished difference. Result has 240 places, 295 transitions, 4525 flow [2024-06-27 22:16:02,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4256, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4525, PETRI_PLACES=240, PETRI_TRANSITIONS=295} [2024-06-27 22:16:02,711 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 200 predicate places. [2024-06-27 22:16:02,711 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 295 transitions, 4525 flow [2024-06-27 22:16:02,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:02,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:02,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:02,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-27 22:16:02,712 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:02,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:02,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1497123724, now seen corresponding path program 12 times [2024-06-27 22:16:02,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:02,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648114478] [2024-06-27 22:16:02,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:02,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:04,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:04,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648114478] [2024-06-27 22:16:04,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648114478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:04,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:04,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:16:04,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336573791] [2024-06-27 22:16:04,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:04,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:16:04,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:04,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:16:04,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:16:04,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:16:04,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 295 transitions, 4525 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:04,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:04,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:16:04,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:05,103 INFO L124 PetriNetUnfolderBase]: 1387/2678 cut-off events. [2024-06-27 22:16:05,103 INFO L125 PetriNetUnfolderBase]: For 87103/87103 co-relation queries the response was YES. [2024-06-27 22:16:05,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16461 conditions, 2678 events. 1387/2678 cut-off events. For 87103/87103 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 17245 event pairs, 555 based on Foata normal form. 2/2491 useless extension candidates. Maximal degree in co-relation 16353. Up to 2245 conditions per place. [2024-06-27 22:16:05,127 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 262 selfloop transitions, 52 changer transitions 0/322 dead transitions. [2024-06-27 22:16:05,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 322 transitions, 5389 flow [2024-06-27 22:16:05,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:16:05,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:16:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 166 transitions. [2024-06-27 22:16:05,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41919191919191917 [2024-06-27 22:16:05,129 INFO L175 Difference]: Start difference. First operand has 240 places, 295 transitions, 4525 flow. Second operand 11 states and 166 transitions. [2024-06-27 22:16:05,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 322 transitions, 5389 flow [2024-06-27 22:16:05,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 322 transitions, 5112 flow, removed 25 selfloop flow, removed 11 redundant places. [2024-06-27 22:16:05,356 INFO L231 Difference]: Finished difference. Result has 240 places, 297 transitions, 4419 flow [2024-06-27 22:16:05,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4248, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4419, PETRI_PLACES=240, PETRI_TRANSITIONS=297} [2024-06-27 22:16:05,357 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 200 predicate places. [2024-06-27 22:16:05,357 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 297 transitions, 4419 flow [2024-06-27 22:16:05,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:05,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:05,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:05,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-27 22:16:05,358 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:05,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:05,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1497118144, now seen corresponding path program 13 times [2024-06-27 22:16:05,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:05,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672299169] [2024-06-27 22:16:05,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:05,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:06,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:06,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:06,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672299169] [2024-06-27 22:16:06,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672299169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:06,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:06,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:16:06,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232270845] [2024-06-27 22:16:06,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:06,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:16:06,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:06,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:16:06,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:16:06,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:16:06,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 297 transitions, 4419 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:06,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:06,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:16:06,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:07,754 INFO L124 PetriNetUnfolderBase]: 1400/2695 cut-off events. [2024-06-27 22:16:07,755 INFO L125 PetriNetUnfolderBase]: For 88054/88054 co-relation queries the response was YES. [2024-06-27 22:16:07,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16556 conditions, 2695 events. 1400/2695 cut-off events. For 88054/88054 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 17321 event pairs, 554 based on Foata normal form. 2/2504 useless extension candidates. Maximal degree in co-relation 16447. Up to 2220 conditions per place. [2024-06-27 22:16:07,782 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 259 selfloop transitions, 58 changer transitions 0/325 dead transitions. [2024-06-27 22:16:07,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 325 transitions, 5288 flow [2024-06-27 22:16:07,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:16:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:16:07,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2024-06-27 22:16:07,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-27 22:16:07,783 INFO L175 Difference]: Start difference. First operand has 240 places, 297 transitions, 4419 flow. Second operand 11 states and 168 transitions. [2024-06-27 22:16:07,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 325 transitions, 5288 flow [2024-06-27 22:16:08,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 325 transitions, 5155 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-27 22:16:08,037 INFO L231 Difference]: Finished difference. Result has 242 places, 299 transitions, 4465 flow [2024-06-27 22:16:08,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4286, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4465, PETRI_PLACES=242, PETRI_TRANSITIONS=299} [2024-06-27 22:16:08,037 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 202 predicate places. [2024-06-27 22:16:08,037 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 299 transitions, 4465 flow [2024-06-27 22:16:08,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:08,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:08,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:08,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-27 22:16:08,038 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:08,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:08,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1497333470, now seen corresponding path program 3 times [2024-06-27 22:16:08,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:08,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102088820] [2024-06-27 22:16:08,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:08,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:09,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:09,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102088820] [2024-06-27 22:16:09,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102088820] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:09,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:09,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:16:09,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424010254] [2024-06-27 22:16:09,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:09,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:16:09,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:09,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:16:09,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:16:09,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:16:09,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 299 transitions, 4465 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:09,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:09,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:16:09,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:10,224 INFO L124 PetriNetUnfolderBase]: 1417/2736 cut-off events. [2024-06-27 22:16:10,224 INFO L125 PetriNetUnfolderBase]: For 90918/90918 co-relation queries the response was YES. [2024-06-27 22:16:10,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16810 conditions, 2736 events. 1417/2736 cut-off events. For 90918/90918 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 17730 event pairs, 566 based on Foata normal form. 2/2544 useless extension candidates. Maximal degree in co-relation 16700. Up to 2344 conditions per place. [2024-06-27 22:16:10,251 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 283 selfloop transitions, 30 changer transitions 0/321 dead transitions. [2024-06-27 22:16:10,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 321 transitions, 5245 flow [2024-06-27 22:16:10,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:16:10,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:16:10,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-06-27 22:16:10,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4351851851851852 [2024-06-27 22:16:10,253 INFO L175 Difference]: Start difference. First operand has 242 places, 299 transitions, 4465 flow. Second operand 9 states and 141 transitions. [2024-06-27 22:16:10,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 321 transitions, 5245 flow [2024-06-27 22:16:10,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 321 transitions, 5094 flow, removed 19 selfloop flow, removed 9 redundant places. [2024-06-27 22:16:10,523 INFO L231 Difference]: Finished difference. Result has 242 places, 300 transitions, 4405 flow [2024-06-27 22:16:10,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4314, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4405, PETRI_PLACES=242, PETRI_TRANSITIONS=300} [2024-06-27 22:16:10,523 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 202 predicate places. [2024-06-27 22:16:10,524 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 300 transitions, 4405 flow [2024-06-27 22:16:10,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:10,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:10,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:10,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-27 22:16:10,524 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:10,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:10,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1497117989, now seen corresponding path program 11 times [2024-06-27 22:16:10,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:10,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281652569] [2024-06-27 22:16:10,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:10,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:11,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:11,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281652569] [2024-06-27 22:16:11,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281652569] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:11,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:11,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:16:11,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690756900] [2024-06-27 22:16:11,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:11,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:16:11,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:11,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:16:11,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:16:12,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:16:12,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 300 transitions, 4405 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:12,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:12,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:16:12,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:12,805 INFO L124 PetriNetUnfolderBase]: 1434/2777 cut-off events. [2024-06-27 22:16:12,805 INFO L125 PetriNetUnfolderBase]: For 93032/93032 co-relation queries the response was YES. [2024-06-27 22:16:12,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16904 conditions, 2777 events. 1434/2777 cut-off events. For 93032/93032 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 18101 event pairs, 576 based on Foata normal form. 2/2582 useless extension candidates. Maximal degree in co-relation 16793. Up to 2386 conditions per place. [2024-06-27 22:16:12,831 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 284 selfloop transitions, 30 changer transitions 0/322 dead transitions. [2024-06-27 22:16:12,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 322 transitions, 5178 flow [2024-06-27 22:16:12,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:16:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:16:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 151 transitions. [2024-06-27 22:16:12,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2024-06-27 22:16:12,833 INFO L175 Difference]: Start difference. First operand has 242 places, 300 transitions, 4405 flow. Second operand 10 states and 151 transitions. [2024-06-27 22:16:12,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 322 transitions, 5178 flow [2024-06-27 22:16:13,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 322 transitions, 5101 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-27 22:16:13,112 INFO L231 Difference]: Finished difference. Result has 245 places, 301 transitions, 4417 flow [2024-06-27 22:16:13,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4328, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4417, PETRI_PLACES=245, PETRI_TRANSITIONS=301} [2024-06-27 22:16:13,114 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 205 predicate places. [2024-06-27 22:16:13,114 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 301 transitions, 4417 flow [2024-06-27 22:16:13,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:13,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:13,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:13,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-27 22:16:13,115 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:13,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:13,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1454483096, now seen corresponding path program 4 times [2024-06-27 22:16:13,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:13,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770685296] [2024-06-27 22:16:13,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:13,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:14,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:14,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770685296] [2024-06-27 22:16:14,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770685296] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:14,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:14,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:16:14,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955031257] [2024-06-27 22:16:14,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:14,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:16:14,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:14,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:16:14,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:16:14,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:16:14,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 301 transitions, 4417 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:14,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:14,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:16:14,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:15,451 INFO L124 PetriNetUnfolderBase]: 1451/2810 cut-off events. [2024-06-27 22:16:15,452 INFO L125 PetriNetUnfolderBase]: For 95681/95681 co-relation queries the response was YES. [2024-06-27 22:16:15,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17066 conditions, 2810 events. 1451/2810 cut-off events. For 95681/95681 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 18349 event pairs, 573 based on Foata normal form. 2/2609 useless extension candidates. Maximal degree in co-relation 16954. Up to 2428 conditions per place. [2024-06-27 22:16:15,476 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 293 selfloop transitions, 19 changer transitions 0/320 dead transitions. [2024-06-27 22:16:15,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 320 transitions, 5146 flow [2024-06-27 22:16:15,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:16:15,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:16:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 146 transitions. [2024-06-27 22:16:15,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40555555555555556 [2024-06-27 22:16:15,478 INFO L175 Difference]: Start difference. First operand has 245 places, 301 transitions, 4417 flow. Second operand 10 states and 146 transitions. [2024-06-27 22:16:15,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 320 transitions, 5146 flow [2024-06-27 22:16:15,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 320 transitions, 5078 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-27 22:16:15,757 INFO L231 Difference]: Finished difference. Result has 248 places, 302 transitions, 4420 flow [2024-06-27 22:16:15,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4349, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4420, PETRI_PLACES=248, PETRI_TRANSITIONS=302} [2024-06-27 22:16:15,757 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 208 predicate places. [2024-06-27 22:16:15,757 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 302 transitions, 4420 flow [2024-06-27 22:16:15,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:15,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:15,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:15,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-27 22:16:15,758 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:15,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:15,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1698682190, now seen corresponding path program 5 times [2024-06-27 22:16:15,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:15,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292126633] [2024-06-27 22:16:15,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:15,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:17,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:17,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292126633] [2024-06-27 22:16:17,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292126633] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:17,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:17,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:16:17,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40744410] [2024-06-27 22:16:17,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:17,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:16:17,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:17,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:16:17,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:16:17,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:16:17,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 302 transitions, 4420 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:17,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:17,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:16:17,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:18,072 INFO L124 PetriNetUnfolderBase]: 1468/2850 cut-off events. [2024-06-27 22:16:18,073 INFO L125 PetriNetUnfolderBase]: For 98585/98585 co-relation queries the response was YES. [2024-06-27 22:16:18,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17262 conditions, 2850 events. 1468/2850 cut-off events. For 98585/98585 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 18759 event pairs, 581 based on Foata normal form. 2/2649 useless extension candidates. Maximal degree in co-relation 17149. Up to 2428 conditions per place. [2024-06-27 22:16:18,096 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 291 selfloop transitions, 23 changer transitions 0/322 dead transitions. [2024-06-27 22:16:18,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 322 transitions, 5161 flow [2024-06-27 22:16:18,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:16:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:16:18,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2024-06-27 22:16:18,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2024-06-27 22:16:18,098 INFO L175 Difference]: Start difference. First operand has 248 places, 302 transitions, 4420 flow. Second operand 9 states and 138 transitions. [2024-06-27 22:16:18,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 322 transitions, 5161 flow [2024-06-27 22:16:18,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 322 transitions, 5091 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-27 22:16:18,403 INFO L231 Difference]: Finished difference. Result has 249 places, 303 transitions, 4433 flow [2024-06-27 22:16:18,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4350, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4433, PETRI_PLACES=249, PETRI_TRANSITIONS=303} [2024-06-27 22:16:18,403 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 209 predicate places. [2024-06-27 22:16:18,403 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 303 transitions, 4433 flow [2024-06-27 22:16:18,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:18,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:18,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:18,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-27 22:16:18,404 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:18,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:18,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1751701508, now seen corresponding path program 6 times [2024-06-27 22:16:18,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:18,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411198911] [2024-06-27 22:16:18,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:18,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:19,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:19,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:19,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411198911] [2024-06-27 22:16:19,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411198911] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:19,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:19,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:16:19,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133006475] [2024-06-27 22:16:19,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:19,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:16:19,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:19,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:16:19,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:16:19,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:16:19,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 303 transitions, 4433 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:19,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:19,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:16:19,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:20,642 INFO L124 PetriNetUnfolderBase]: 1485/2892 cut-off events. [2024-06-27 22:16:20,642 INFO L125 PetriNetUnfolderBase]: For 101299/101299 co-relation queries the response was YES. [2024-06-27 22:16:20,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17497 conditions, 2892 events. 1485/2892 cut-off events. For 101299/101299 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 19116 event pairs, 577 based on Foata normal form. 2/2701 useless extension candidates. Maximal degree in co-relation 17383. Up to 2477 conditions per place. [2024-06-27 22:16:20,672 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 302 selfloop transitions, 16 changer transitions 0/326 dead transitions. [2024-06-27 22:16:20,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 326 transitions, 5197 flow [2024-06-27 22:16:20,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:16:20,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:16:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 148 transitions. [2024-06-27 22:16:20,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4111111111111111 [2024-06-27 22:16:20,673 INFO L175 Difference]: Start difference. First operand has 249 places, 303 transitions, 4433 flow. Second operand 10 states and 148 transitions. [2024-06-27 22:16:20,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 326 transitions, 5197 flow [2024-06-27 22:16:21,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 326 transitions, 5128 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-27 22:16:21,032 INFO L231 Difference]: Finished difference. Result has 253 places, 306 transitions, 4455 flow [2024-06-27 22:16:21,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4366, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4455, PETRI_PLACES=253, PETRI_TRANSITIONS=306} [2024-06-27 22:16:21,033 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 213 predicate places. [2024-06-27 22:16:21,033 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 306 transitions, 4455 flow [2024-06-27 22:16:21,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:21,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:21,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:21,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-27 22:16:21,034 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:21,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:21,034 INFO L85 PathProgramCache]: Analyzing trace with hash -767794036, now seen corresponding path program 7 times [2024-06-27 22:16:21,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:21,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42342653] [2024-06-27 22:16:21,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:21,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:22,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-27 22:16:22,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:22,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42342653] [2024-06-27 22:16:22,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42342653] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:22,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:22,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:16:22,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399068796] [2024-06-27 22:16:22,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:22,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:16:22,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:22,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:16:22,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:16:22,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:16:22,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 306 transitions, 4455 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:22,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:22,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:16:22,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:23,731 INFO L124 PetriNetUnfolderBase]: 1486/2902 cut-off events. [2024-06-27 22:16:23,732 INFO L125 PetriNetUnfolderBase]: For 96009/96009 co-relation queries the response was YES. [2024-06-27 22:16:23,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17326 conditions, 2902 events. 1486/2902 cut-off events. For 96009/96009 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 19278 event pairs, 590 based on Foata normal form. 2/2695 useless extension candidates. Maximal degree in co-relation 17210. Up to 2476 conditions per place. [2024-06-27 22:16:23,762 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 293 selfloop transitions, 26 changer transitions 0/327 dead transitions. [2024-06-27 22:16:23,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 327 transitions, 5231 flow [2024-06-27 22:16:23,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:16:23,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:16:23,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2024-06-27 22:16:23,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41388888888888886 [2024-06-27 22:16:23,763 INFO L175 Difference]: Start difference. First operand has 253 places, 306 transitions, 4455 flow. Second operand 10 states and 149 transitions. [2024-06-27 22:16:23,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 327 transitions, 5231 flow [2024-06-27 22:16:24,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 327 transitions, 5170 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-27 22:16:24,088 INFO L231 Difference]: Finished difference. Result has 256 places, 307 transitions, 4483 flow [2024-06-27 22:16:24,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4394, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4483, PETRI_PLACES=256, PETRI_TRANSITIONS=307} [2024-06-27 22:16:24,088 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 216 predicate places. [2024-06-27 22:16:24,088 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 307 transitions, 4483 flow [2024-06-27 22:16:24,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:24,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:24,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:24,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-27 22:16:24,096 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:24,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:24,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2046361344, now seen corresponding path program 14 times [2024-06-27 22:16:24,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:24,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313997099] [2024-06-27 22:16:24,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:24,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:25,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:25,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:25,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313997099] [2024-06-27 22:16:25,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313997099] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:25,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:25,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:16:25,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330140178] [2024-06-27 22:16:25,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:25,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:16:25,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:25,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:16:25,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:16:25,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:16:25,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 307 transitions, 4483 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:25,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:25,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:16:25,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:26,757 INFO L124 PetriNetUnfolderBase]: 1516/2948 cut-off events. [2024-06-27 22:16:26,757 INFO L125 PetriNetUnfolderBase]: For 98326/98326 co-relation queries the response was YES. [2024-06-27 22:16:26,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17649 conditions, 2948 events. 1516/2948 cut-off events. For 98326/98326 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 19557 event pairs, 586 based on Foata normal form. 2/2734 useless extension candidates. Maximal degree in co-relation 17532. Up to 2474 conditions per place. [2024-06-27 22:16:26,788 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 279 selfloop transitions, 48 changer transitions 0/335 dead transitions. [2024-06-27 22:16:26,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 335 transitions, 5404 flow [2024-06-27 22:16:26,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:16:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:16:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 163 transitions. [2024-06-27 22:16:26,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4116161616161616 [2024-06-27 22:16:26,789 INFO L175 Difference]: Start difference. First operand has 256 places, 307 transitions, 4483 flow. Second operand 11 states and 163 transitions. [2024-06-27 22:16:26,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 335 transitions, 5404 flow [2024-06-27 22:16:27,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 335 transitions, 5318 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-27 22:16:27,111 INFO L231 Difference]: Finished difference. Result has 259 places, 315 transitions, 4656 flow [2024-06-27 22:16:27,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4397, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4656, PETRI_PLACES=259, PETRI_TRANSITIONS=315} [2024-06-27 22:16:27,113 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 219 predicate places. [2024-06-27 22:16:27,113 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 315 transitions, 4656 flow [2024-06-27 22:16:27,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:27,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:27,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:27,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-27 22:16:27,113 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:27,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:27,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1170061630, now seen corresponding path program 15 times [2024-06-27 22:16:27,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:27,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711767342] [2024-06-27 22:16:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:27,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:28,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:28,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:28,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711767342] [2024-06-27 22:16:28,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711767342] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:28,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:28,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:16:28,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759409752] [2024-06-27 22:16:28,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:28,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:16:28,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:28,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:16:28,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:16:28,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:16:28,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 315 transitions, 4656 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:28,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:28,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:16:28,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:29,470 INFO L124 PetriNetUnfolderBase]: 1512/2945 cut-off events. [2024-06-27 22:16:29,471 INFO L125 PetriNetUnfolderBase]: For 93393/93393 co-relation queries the response was YES. [2024-06-27 22:16:29,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17277 conditions, 2945 events. 1512/2945 cut-off events. For 93393/93393 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 19567 event pairs, 595 based on Foata normal form. 2/2733 useless extension candidates. Maximal degree in co-relation 17160. Up to 2495 conditions per place. [2024-06-27 22:16:29,501 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 289 selfloop transitions, 41 changer transitions 0/338 dead transitions. [2024-06-27 22:16:29,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 338 transitions, 5592 flow [2024-06-27 22:16:29,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:16:29,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:16:29,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 156 transitions. [2024-06-27 22:16:29,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-27 22:16:29,502 INFO L175 Difference]: Start difference. First operand has 259 places, 315 transitions, 4656 flow. Second operand 10 states and 156 transitions. [2024-06-27 22:16:29,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 338 transitions, 5592 flow [2024-06-27 22:16:29,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 338 transitions, 5415 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-27 22:16:29,836 INFO L231 Difference]: Finished difference. Result has 262 places, 315 transitions, 4566 flow [2024-06-27 22:16:29,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4479, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4566, PETRI_PLACES=262, PETRI_TRANSITIONS=315} [2024-06-27 22:16:29,837 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 222 predicate places. [2024-06-27 22:16:29,837 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 315 transitions, 4566 flow [2024-06-27 22:16:29,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:29,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:29,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:29,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-27 22:16:29,838 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:29,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:29,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1691063134, now seen corresponding path program 16 times [2024-06-27 22:16:29,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:29,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774468148] [2024-06-27 22:16:29,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:29,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:31,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:31,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774468148] [2024-06-27 22:16:31,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774468148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:31,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:31,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:16:31,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177635054] [2024-06-27 22:16:31,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:31,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:16:31,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:31,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:16:31,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:16:31,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:16:31,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 315 transitions, 4566 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:31,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:31,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:16:31,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:32,304 INFO L124 PetriNetUnfolderBase]: 1517/2952 cut-off events. [2024-06-27 22:16:32,304 INFO L125 PetriNetUnfolderBase]: For 91815/91815 co-relation queries the response was YES. [2024-06-27 22:16:32,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17243 conditions, 2952 events. 1517/2952 cut-off events. For 91815/91815 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 19634 event pairs, 585 based on Foata normal form. 2/2738 useless extension candidates. Maximal degree in co-relation 17125. Up to 2475 conditions per place. [2024-06-27 22:16:32,390 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 279 selfloop transitions, 52 changer transitions 0/339 dead transitions. [2024-06-27 22:16:32,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 339 transitions, 5429 flow [2024-06-27 22:16:32,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:16:32,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:16:32,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 162 transitions. [2024-06-27 22:16:32,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-27 22:16:32,391 INFO L175 Difference]: Start difference. First operand has 262 places, 315 transitions, 4566 flow. Second operand 11 states and 162 transitions. [2024-06-27 22:16:32,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 339 transitions, 5429 flow [2024-06-27 22:16:32,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 339 transitions, 5152 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-27 22:16:32,669 INFO L231 Difference]: Finished difference. Result has 266 places, 317 transitions, 4468 flow [2024-06-27 22:16:32,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4293, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4468, PETRI_PLACES=266, PETRI_TRANSITIONS=317} [2024-06-27 22:16:32,670 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 226 predicate places. [2024-06-27 22:16:32,670 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 317 transitions, 4468 flow [2024-06-27 22:16:32,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:32,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:32,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:32,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-27 22:16:32,670 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:32,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:32,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1170061475, now seen corresponding path program 12 times [2024-06-27 22:16:32,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:32,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160681001] [2024-06-27 22:16:32,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:32,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:34,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-27 22:16:34,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:34,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160681001] [2024-06-27 22:16:34,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160681001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:34,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:34,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:16:34,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457711481] [2024-06-27 22:16:34,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:34,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:16:34,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:34,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:16:34,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:16:34,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:16:34,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 317 transitions, 4468 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:34,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:34,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:16:34,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:35,310 INFO L124 PetriNetUnfolderBase]: 1585/3131 cut-off events. [2024-06-27 22:16:35,311 INFO L125 PetriNetUnfolderBase]: For 115344/115344 co-relation queries the response was YES. [2024-06-27 22:16:35,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17316 conditions, 3131 events. 1585/3131 cut-off events. For 115344/115344 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 21192 event pairs, 628 based on Foata normal form. 12/2918 useless extension candidates. Maximal degree in co-relation 17197. Up to 2495 conditions per place. [2024-06-27 22:16:35,341 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 303 selfloop transitions, 33 changer transitions 0/344 dead transitions. [2024-06-27 22:16:35,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 344 transitions, 5306 flow [2024-06-27 22:16:35,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:16:35,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:16:35,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-06-27 22:16:35,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4388888888888889 [2024-06-27 22:16:35,343 INFO L175 Difference]: Start difference. First operand has 266 places, 317 transitions, 4468 flow. Second operand 10 states and 158 transitions. [2024-06-27 22:16:35,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 344 transitions, 5306 flow [2024-06-27 22:16:35,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 344 transitions, 5095 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-27 22:16:35,672 INFO L231 Difference]: Finished difference. Result has 267 places, 317 transitions, 4329 flow [2024-06-27 22:16:35,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4257, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4329, PETRI_PLACES=267, PETRI_TRANSITIONS=317} [2024-06-27 22:16:35,673 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 227 predicate places. [2024-06-27 22:16:35,673 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 317 transitions, 4329 flow [2024-06-27 22:16:35,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 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-27 22:16:35,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:35,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:35,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-27 22:16:35,674 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:35,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:35,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1629625071, now seen corresponding path program 1 times [2024-06-27 22:16:35,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:35,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163743536] [2024-06-27 22:16:35,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:35,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:37,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:37,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163743536] [2024-06-27 22:16:37,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163743536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:37,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:37,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:16:37,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659068392] [2024-06-27 22:16:37,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:37,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:16:37,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:37,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:16:37,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:16:37,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:16:37,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 317 transitions, 4329 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 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-27 22:16:37,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:37,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:16:37,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:38,120 INFO L124 PetriNetUnfolderBase]: 1510/3086 cut-off events. [2024-06-27 22:16:38,121 INFO L125 PetriNetUnfolderBase]: For 121699/121728 co-relation queries the response was YES. [2024-06-27 22:16:38,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17115 conditions, 3086 events. 1510/3086 cut-off events. For 121699/121728 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 21989 event pairs, 367 based on Foata normal form. 12/2831 useless extension candidates. Maximal degree in co-relation 16995. Up to 1282 conditions per place. [2024-06-27 22:16:38,152 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 177 selfloop transitions, 167 changer transitions 0/356 dead transitions. [2024-06-27 22:16:38,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 356 transitions, 5499 flow [2024-06-27 22:16:38,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:16:38,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:16:38,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-27 22:16:38,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5339506172839507 [2024-06-27 22:16:38,153 INFO L175 Difference]: Start difference. First operand has 267 places, 317 transitions, 4329 flow. Second operand 9 states and 173 transitions. [2024-06-27 22:16:38,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 356 transitions, 5499 flow [2024-06-27 22:16:38,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 356 transitions, 5380 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-27 22:16:38,541 INFO L231 Difference]: Finished difference. Result has 266 places, 317 transitions, 4547 flow [2024-06-27 22:16:38,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4210, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4547, PETRI_PLACES=266, PETRI_TRANSITIONS=317} [2024-06-27 22:16:38,542 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 226 predicate places. [2024-06-27 22:16:38,542 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 317 transitions, 4547 flow [2024-06-27 22:16:38,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 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-27 22:16:38,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:38,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:38,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-27 22:16:38,542 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:38,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:38,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1235039699, now seen corresponding path program 2 times [2024-06-27 22:16:38,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:38,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280464317] [2024-06-27 22:16:38,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:38,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:40,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:40,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280464317] [2024-06-27 22:16:40,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280464317] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:40,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:40,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:16:40,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312492160] [2024-06-27 22:16:40,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:40,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:16:40,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:40,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:16:40,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:16:40,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:16:40,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 317 transitions, 4547 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 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-27 22:16:40,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:40,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:16:40,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:40,964 INFO L124 PetriNetUnfolderBase]: 1495/3107 cut-off events. [2024-06-27 22:16:40,964 INFO L125 PetriNetUnfolderBase]: For 102431/102457 co-relation queries the response was YES. [2024-06-27 22:16:40,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16673 conditions, 3107 events. 1495/3107 cut-off events. For 102431/102457 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 22481 event pairs, 458 based on Foata normal form. 14/2846 useless extension candidates. Maximal degree in co-relation 16553. Up to 1821 conditions per place. [2024-06-27 22:16:40,997 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 163 selfloop transitions, 168 changer transitions 0/343 dead transitions. [2024-06-27 22:16:40,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 343 transitions, 5485 flow [2024-06-27 22:16:40,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:16:40,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:16:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-27 22:16:40,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2024-06-27 22:16:40,999 INFO L175 Difference]: Start difference. First operand has 266 places, 317 transitions, 4547 flow. Second operand 10 states and 174 transitions. [2024-06-27 22:16:40,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 343 transitions, 5485 flow [2024-06-27 22:16:41,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 343 transitions, 5152 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 22:16:41,317 INFO L231 Difference]: Finished difference. Result has 269 places, 317 transitions, 4554 flow [2024-06-27 22:16:41,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4214, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4554, PETRI_PLACES=269, PETRI_TRANSITIONS=317} [2024-06-27 22:16:41,317 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 229 predicate places. [2024-06-27 22:16:41,318 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 317 transitions, 4554 flow [2024-06-27 22:16:41,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 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-27 22:16:41,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:41,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:41,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-27 22:16:41,318 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:41,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:41,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1235159669, now seen corresponding path program 3 times [2024-06-27 22:16:41,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:41,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139891662] [2024-06-27 22:16:41,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:41,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:42,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-27 22:16:42,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:42,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139891662] [2024-06-27 22:16:42,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139891662] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:42,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:42,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:16:42,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058979937] [2024-06-27 22:16:42,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:42,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:16:42,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:42,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:16:42,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:16:42,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:16:42,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 317 transitions, 4554 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 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-27 22:16:42,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:42,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:16:42,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:43,630 INFO L124 PetriNetUnfolderBase]: 1554/3254 cut-off events. [2024-06-27 22:16:43,630 INFO L125 PetriNetUnfolderBase]: For 105579/105605 co-relation queries the response was YES. [2024-06-27 22:16:43,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17428 conditions, 3254 events. 1554/3254 cut-off events. For 105579/105605 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 23975 event pairs, 470 based on Foata normal form. 12/2989 useless extension candidates. Maximal degree in co-relation 17306. Up to 1634 conditions per place. [2024-06-27 22:16:43,663 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 176 selfloop transitions, 167 changer transitions 0/355 dead transitions. [2024-06-27 22:16:43,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 355 transitions, 5744 flow [2024-06-27 22:16:43,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:16:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:16:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-06-27 22:16:43,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2024-06-27 22:16:43,665 INFO L175 Difference]: Start difference. First operand has 269 places, 317 transitions, 4554 flow. Second operand 9 states and 177 transitions. [2024-06-27 22:16:43,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 355 transitions, 5744 flow [2024-06-27 22:16:44,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 355 transitions, 5410 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:16:44,103 INFO L231 Difference]: Finished difference. Result has 270 places, 317 transitions, 4557 flow [2024-06-27 22:16:44,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4220, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4557, PETRI_PLACES=270, PETRI_TRANSITIONS=317} [2024-06-27 22:16:44,104 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 230 predicate places. [2024-06-27 22:16:44,104 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 317 transitions, 4557 flow [2024-06-27 22:16:44,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 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-27 22:16:44,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:44,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:44,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-27 22:16:44,104 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:44,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:44,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1235044349, now seen corresponding path program 4 times [2024-06-27 22:16:44,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:44,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050875615] [2024-06-27 22:16:44,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:44,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:45,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:45,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:45,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050875615] [2024-06-27 22:16:45,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050875615] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:45,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:45,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:16:45,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457084492] [2024-06-27 22:16:45,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:45,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:16:45,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:45,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:16:45,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:16:46,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:16:46,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 317 transitions, 4557 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:46,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:46,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:16:46,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:46,905 INFO L124 PetriNetUnfolderBase]: 1734/3465 cut-off events. [2024-06-27 22:16:46,905 INFO L125 PetriNetUnfolderBase]: For 84942/84943 co-relation queries the response was YES. [2024-06-27 22:16:46,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18032 conditions, 3465 events. 1734/3465 cut-off events. For 84942/84943 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 24504 event pairs, 489 based on Foata normal form. 9/3235 useless extension candidates. Maximal degree in co-relation 17910. Up to 1929 conditions per place. [2024-06-27 22:16:46,943 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 181 selfloop transitions, 168 changer transitions 0/357 dead transitions. [2024-06-27 22:16:46,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 357 transitions, 5625 flow [2024-06-27 22:16:46,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:16:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:16:46,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2024-06-27 22:16:46,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49722222222222223 [2024-06-27 22:16:46,945 INFO L175 Difference]: Start difference. First operand has 270 places, 317 transitions, 4557 flow. Second operand 10 states and 179 transitions. [2024-06-27 22:16:46,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 357 transitions, 5625 flow [2024-06-27 22:16:47,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 357 transitions, 5292 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 22:16:47,293 INFO L231 Difference]: Finished difference. Result has 273 places, 317 transitions, 4563 flow [2024-06-27 22:16:47,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4224, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4563, PETRI_PLACES=273, PETRI_TRANSITIONS=317} [2024-06-27 22:16:47,293 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 233 predicate places. [2024-06-27 22:16:47,293 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 317 transitions, 4563 flow [2024-06-27 22:16:47,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:47,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:47,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:47,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-27 22:16:47,294 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:47,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:47,295 INFO L85 PathProgramCache]: Analyzing trace with hash 544477741, now seen corresponding path program 5 times [2024-06-27 22:16:47,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:47,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989255068] [2024-06-27 22:16:47,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:47,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:48,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:48,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989255068] [2024-06-27 22:16:48,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989255068] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:48,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:48,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:16:48,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078396727] [2024-06-27 22:16:48,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:48,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:16:48,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:48,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:16:48,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:16:49,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:16:49,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 317 transitions, 4563 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:49,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:49,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:16:49,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:49,991 INFO L124 PetriNetUnfolderBase]: 1666/3546 cut-off events. [2024-06-27 22:16:49,991 INFO L125 PetriNetUnfolderBase]: For 118252/118297 co-relation queries the response was YES. [2024-06-27 22:16:50,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18688 conditions, 3546 events. 1666/3546 cut-off events. For 118252/118297 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 27108 event pairs, 579 based on Foata normal form. 26/3279 useless extension candidates. Maximal degree in co-relation 18564. Up to 2167 conditions per place. [2024-06-27 22:16:50,030 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 193 selfloop transitions, 142 changer transitions 0/347 dead transitions. [2024-06-27 22:16:50,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 347 transitions, 5551 flow [2024-06-27 22:16:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:16:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:16:50,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-06-27 22:16:50,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2024-06-27 22:16:50,031 INFO L175 Difference]: Start difference. First operand has 273 places, 317 transitions, 4563 flow. Second operand 10 states and 177 transitions. [2024-06-27 22:16:50,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 347 transitions, 5551 flow [2024-06-27 22:16:50,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 347 transitions, 5216 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:16:50,515 INFO L231 Difference]: Finished difference. Result has 275 places, 317 transitions, 4515 flow [2024-06-27 22:16:50,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4228, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4515, PETRI_PLACES=275, PETRI_TRANSITIONS=317} [2024-06-27 22:16:50,516 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 235 predicate places. [2024-06-27 22:16:50,516 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 317 transitions, 4515 flow [2024-06-27 22:16:50,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:50,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:50,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:50,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-27 22:16:50,517 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:50,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:50,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1456875061, now seen corresponding path program 6 times [2024-06-27 22:16:50,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:50,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692381311] [2024-06-27 22:16:50,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:50,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:52,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:52,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:52,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692381311] [2024-06-27 22:16:52,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692381311] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:52,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:52,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:16:52,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089854682] [2024-06-27 22:16:52,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:52,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:16:52,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:52,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:16:52,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:16:52,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:16:52,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 317 transitions, 4515 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:52,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:52,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:16:52,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:53,198 INFO L124 PetriNetUnfolderBase]: 1653/3523 cut-off events. [2024-06-27 22:16:53,198 INFO L125 PetriNetUnfolderBase]: For 94979/95024 co-relation queries the response was YES. [2024-06-27 22:16:53,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17618 conditions, 3523 events. 1653/3523 cut-off events. For 94979/95024 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 26992 event pairs, 622 based on Foata normal form. 28/3254 useless extension candidates. Maximal degree in co-relation 17493. Up to 2449 conditions per place. [2024-06-27 22:16:53,237 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 186 selfloop transitions, 142 changer transitions 0/340 dead transitions. [2024-06-27 22:16:53,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 340 transitions, 5287 flow [2024-06-27 22:16:53,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:16:53,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:16:53,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-27 22:16:53,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-27 22:16:53,238 INFO L175 Difference]: Start difference. First operand has 275 places, 317 transitions, 4515 flow. Second operand 10 states and 171 transitions. [2024-06-27 22:16:53,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 340 transitions, 5287 flow [2024-06-27 22:16:53,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 340 transitions, 5004 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:16:53,609 INFO L231 Difference]: Finished difference. Result has 277 places, 317 transitions, 4520 flow [2024-06-27 22:16:53,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4232, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4520, PETRI_PLACES=277, PETRI_TRANSITIONS=317} [2024-06-27 22:16:53,609 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 237 predicate places. [2024-06-27 22:16:53,609 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 317 transitions, 4520 flow [2024-06-27 22:16:53,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:53,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:53,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:53,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-27 22:16:53,610 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:53,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:53,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1452286441, now seen corresponding path program 7 times [2024-06-27 22:16:53,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:53,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473351556] [2024-06-27 22:16:53,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:53,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:55,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-27 22:16:55,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:55,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473351556] [2024-06-27 22:16:55,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473351556] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:55,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:55,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:16:55,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787718634] [2024-06-27 22:16:55,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:55,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:16:55,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:55,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:16:55,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:16:55,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:16:55,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 317 transitions, 4520 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:55,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:55,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:16:55,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:56,203 INFO L124 PetriNetUnfolderBase]: 1780/3884 cut-off events. [2024-06-27 22:16:56,203 INFO L125 PetriNetUnfolderBase]: For 124330/124378 co-relation queries the response was YES. [2024-06-27 22:16:56,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19592 conditions, 3884 events. 1780/3884 cut-off events. For 124330/124378 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 30743 event pairs, 661 based on Foata normal form. 26/3588 useless extension candidates. Maximal degree in co-relation 19466. Up to 2030 conditions per place. [2024-06-27 22:16:56,244 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 192 selfloop transitions, 147 changer transitions 0/351 dead transitions. [2024-06-27 22:16:56,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 351 transitions, 5540 flow [2024-06-27 22:16:56,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:16:56,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:16:56,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-27 22:16:56,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2024-06-27 22:16:56,246 INFO L175 Difference]: Start difference. First operand has 277 places, 317 transitions, 4520 flow. Second operand 10 states and 183 transitions. [2024-06-27 22:16:56,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 351 transitions, 5540 flow [2024-06-27 22:16:56,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 351 transitions, 5258 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:16:56,671 INFO L231 Difference]: Finished difference. Result has 279 places, 317 transitions, 4535 flow [2024-06-27 22:16:56,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4238, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4535, PETRI_PLACES=279, PETRI_TRANSITIONS=317} [2024-06-27 22:16:56,672 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 239 predicate places. [2024-06-27 22:16:56,672 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 317 transitions, 4535 flow [2024-06-27 22:16:56,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:16:56,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:16:56,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:16:56,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-27 22:16:56,672 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:16:56,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:16:56,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1781782795, now seen corresponding path program 8 times [2024-06-27 22:16:56,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:16:56,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963621316] [2024-06-27 22:16:56,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:16:56,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:16:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:16:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:16:58,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:16:58,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963621316] [2024-06-27 22:16:58,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963621316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:16:58,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:16:58,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:16:58,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000430802] [2024-06-27 22:16:58,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:16:58,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:16:58,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:16:58,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:16:58,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:16:58,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:16:58,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 317 transitions, 4535 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 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-27 22:16:58,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:16:58,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:16:58,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:16:59,497 INFO L124 PetriNetUnfolderBase]: 1822/3939 cut-off events. [2024-06-27 22:16:59,498 INFO L125 PetriNetUnfolderBase]: For 127721/127766 co-relation queries the response was YES. [2024-06-27 22:16:59,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19857 conditions, 3939 events. 1822/3939 cut-off events. For 127721/127766 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 31452 event pairs, 782 based on Foata normal form. 28/3646 useless extension candidates. Maximal degree in co-relation 19730. Up to 2786 conditions per place. [2024-06-27 22:16:59,544 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 185 selfloop transitions, 143 changer transitions 0/340 dead transitions. [2024-06-27 22:16:59,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 340 transitions, 5307 flow [2024-06-27 22:16:59,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:16:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:16:59,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-27 22:16:59,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-06-27 22:16:59,545 INFO L175 Difference]: Start difference. First operand has 279 places, 317 transitions, 4535 flow. Second operand 10 states and 172 transitions. [2024-06-27 22:16:59,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 340 transitions, 5307 flow [2024-06-27 22:17:00,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 340 transitions, 5014 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:17:00,094 INFO L231 Difference]: Finished difference. Result has 281 places, 317 transitions, 4532 flow [2024-06-27 22:17:00,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4242, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4532, PETRI_PLACES=281, PETRI_TRANSITIONS=317} [2024-06-27 22:17:00,095 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 241 predicate places. [2024-06-27 22:17:00,095 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 317 transitions, 4532 flow [2024-06-27 22:17:00,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 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-27 22:17:00,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:00,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:00,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-27 22:17:00,096 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:00,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:00,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1781787445, now seen corresponding path program 9 times [2024-06-27 22:17:00,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:00,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749794608] [2024-06-27 22:17:00,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:00,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:17:01,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:01,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749794608] [2024-06-27 22:17:01,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749794608] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:01,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:01,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:17:01,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338923979] [2024-06-27 22:17:01,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:01,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:17:01,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:01,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:17:01,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:17:01,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:17:01,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 317 transitions, 4532 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:01,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:01,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:17:01,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:02,725 INFO L124 PetriNetUnfolderBase]: 1812/3937 cut-off events. [2024-06-27 22:17:02,725 INFO L125 PetriNetUnfolderBase]: For 95787/95832 co-relation queries the response was YES. [2024-06-27 22:17:02,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19147 conditions, 3937 events. 1812/3937 cut-off events. For 95787/95832 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 31427 event pairs, 739 based on Foata normal form. 26/3641 useless extension candidates. Maximal degree in co-relation 19019. Up to 2623 conditions per place. [2024-06-27 22:17:02,769 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 188 selfloop transitions, 147 changer transitions 0/347 dead transitions. [2024-06-27 22:17:02,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 347 transitions, 5366 flow [2024-06-27 22:17:02,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:17:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:17:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-06-27 22:17:02,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:17:02,771 INFO L175 Difference]: Start difference. First operand has 281 places, 317 transitions, 4532 flow. Second operand 10 states and 180 transitions. [2024-06-27 22:17:02,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 347 transitions, 5366 flow [2024-06-27 22:17:03,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 347 transitions, 5082 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:17:03,215 INFO L231 Difference]: Finished difference. Result has 283 places, 317 transitions, 4545 flow [2024-06-27 22:17:03,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4248, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4545, PETRI_PLACES=283, PETRI_TRANSITIONS=317} [2024-06-27 22:17:03,216 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 243 predicate places. [2024-06-27 22:17:03,216 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 317 transitions, 4545 flow [2024-06-27 22:17:03,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:03,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:03,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:03,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-27 22:17:03,217 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:03,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:03,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1031128529, now seen corresponding path program 10 times [2024-06-27 22:17:03,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:03,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982556773] [2024-06-27 22:17:03,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:03,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:04,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:17:04,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:04,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982556773] [2024-06-27 22:17:04,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982556773] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:04,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:04,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:17:04,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412466022] [2024-06-27 22:17:04,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:04,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:17:04,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:04,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:17:04,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:17:04,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:17:04,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 317 transitions, 4545 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 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-27 22:17:04,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:04,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:17:04,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:06,078 INFO L124 PetriNetUnfolderBase]: 1904/4253 cut-off events. [2024-06-27 22:17:06,078 INFO L125 PetriNetUnfolderBase]: For 132946/132976 co-relation queries the response was YES. [2024-06-27 22:17:06,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20878 conditions, 4253 events. 1904/4253 cut-off events. For 132946/132976 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 34941 event pairs, 743 based on Foata normal form. 13/3923 useless extension candidates. Maximal degree in co-relation 20749. Up to 2004 conditions per place. [2024-06-27 22:17:06,119 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 162 selfloop transitions, 185 changer transitions 0/359 dead transitions. [2024-06-27 22:17:06,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 359 transitions, 5807 flow [2024-06-27 22:17:06,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:17:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:17:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2024-06-27 22:17:06,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5305555555555556 [2024-06-27 22:17:06,120 INFO L175 Difference]: Start difference. First operand has 283 places, 317 transitions, 4545 flow. Second operand 10 states and 191 transitions. [2024-06-27 22:17:06,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 359 transitions, 5807 flow [2024-06-27 22:17:06,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 359 transitions, 5514 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:17:06,713 INFO L231 Difference]: Finished difference. Result has 285 places, 317 transitions, 4625 flow [2024-06-27 22:17:06,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4252, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4625, PETRI_PLACES=285, PETRI_TRANSITIONS=317} [2024-06-27 22:17:06,713 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 245 predicate places. [2024-06-27 22:17:06,714 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 317 transitions, 4625 flow [2024-06-27 22:17:06,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 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-27 22:17:06,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:06,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:06,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-27 22:17:06,714 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:06,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:06,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1032433141, now seen corresponding path program 11 times [2024-06-27 22:17:06,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:06,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45922537] [2024-06-27 22:17:06,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:06,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:17:08,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:08,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45922537] [2024-06-27 22:17:08,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45922537] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:08,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:08,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:17:08,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163353652] [2024-06-27 22:17:08,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:08,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:17:08,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:08,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:17:08,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:17:08,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:17:08,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 317 transitions, 4625 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:08,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:08,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:17:08,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:09,666 INFO L124 PetriNetUnfolderBase]: 2029/4458 cut-off events. [2024-06-27 22:17:09,667 INFO L125 PetriNetUnfolderBase]: For 173389/173422 co-relation queries the response was YES. [2024-06-27 22:17:09,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22946 conditions, 4458 events. 2029/4458 cut-off events. For 173389/173422 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 37036 event pairs, 899 based on Foata normal form. 13/4113 useless extension candidates. Maximal degree in co-relation 22816. Up to 2866 conditions per place. [2024-06-27 22:17:09,719 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 159 selfloop transitions, 184 changer transitions 0/355 dead transitions. [2024-06-27 22:17:09,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 355 transitions, 5857 flow [2024-06-27 22:17:09,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:17:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:17:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-27 22:17:09,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2024-06-27 22:17:09,720 INFO L175 Difference]: Start difference. First operand has 285 places, 317 transitions, 4625 flow. Second operand 10 states and 188 transitions. [2024-06-27 22:17:09,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 355 transitions, 5857 flow [2024-06-27 22:17:10,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 355 transitions, 5488 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:17:10,383 INFO L231 Difference]: Finished difference. Result has 287 places, 317 transitions, 4627 flow [2024-06-27 22:17:10,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4256, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4627, PETRI_PLACES=287, PETRI_TRANSITIONS=317} [2024-06-27 22:17:10,384 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 247 predicate places. [2024-06-27 22:17:10,384 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 317 transitions, 4627 flow [2024-06-27 22:17:10,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:10,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:10,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:10,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-27 22:17:10,384 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:10,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:10,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2093215881, now seen corresponding path program 12 times [2024-06-27 22:17:10,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:10,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909330758] [2024-06-27 22:17:10,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:10,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:17:11,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:11,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909330758] [2024-06-27 22:17:11,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909330758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:11,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:11,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:17:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962865880] [2024-06-27 22:17:11,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:11,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:17:11,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:11,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:17:11,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:17:12,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:17:12,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 317 transitions, 4627 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:12,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:12,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:17:12,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:13,422 INFO L124 PetriNetUnfolderBase]: 2217/4621 cut-off events. [2024-06-27 22:17:13,422 INFO L125 PetriNetUnfolderBase]: For 111947/111947 co-relation queries the response was YES. [2024-06-27 22:17:13,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22351 conditions, 4621 events. 2217/4621 cut-off events. For 111947/111947 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 36461 event pairs, 909 based on Foata normal form. 10/4328 useless extension candidates. Maximal degree in co-relation 22220. Up to 3135 conditions per place. [2024-06-27 22:17:13,474 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 158 selfloop transitions, 191 changer transitions 0/357 dead transitions. [2024-06-27 22:17:13,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 357 transitions, 5734 flow [2024-06-27 22:17:13,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:17:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:17:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2024-06-27 22:17:13,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49722222222222223 [2024-06-27 22:17:13,475 INFO L175 Difference]: Start difference. First operand has 287 places, 317 transitions, 4627 flow. Second operand 10 states and 179 transitions. [2024-06-27 22:17:13,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 357 transitions, 5734 flow [2024-06-27 22:17:13,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 357 transitions, 5367 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:17:13,967 INFO L231 Difference]: Finished difference. Result has 289 places, 317 transitions, 4646 flow [2024-06-27 22:17:13,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4260, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4646, PETRI_PLACES=289, PETRI_TRANSITIONS=317} [2024-06-27 22:17:13,968 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 249 predicate places. [2024-06-27 22:17:13,968 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 317 transitions, 4646 flow [2024-06-27 22:17:13,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:13,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:13,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:13,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-27 22:17:13,968 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:13,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:13,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1036906441, now seen corresponding path program 13 times [2024-06-27 22:17:13,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:13,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290586034] [2024-06-27 22:17:13,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:13,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:17:15,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:15,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290586034] [2024-06-27 22:17:15,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290586034] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:15,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:15,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:17:15,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283807573] [2024-06-27 22:17:15,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:15,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:17:15,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:15,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:17:15,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:17:15,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:17:15,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 317 transitions, 4646 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:15,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:15,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:17:15,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:16,831 INFO L124 PetriNetUnfolderBase]: 2004/4414 cut-off events. [2024-06-27 22:17:16,831 INFO L125 PetriNetUnfolderBase]: For 113045/113080 co-relation queries the response was YES. [2024-06-27 22:17:16,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21110 conditions, 4414 events. 2004/4414 cut-off events. For 113045/113080 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 36668 event pairs, 980 based on Foata normal form. 13/4067 useless extension candidates. Maximal degree in co-relation 20978. Up to 3168 conditions per place. [2024-06-27 22:17:16,875 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 170 selfloop transitions, 162 changer transitions 0/344 dead transitions. [2024-06-27 22:17:16,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 344 transitions, 5456 flow [2024-06-27 22:17:16,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:17:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:17:16,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-06-27 22:17:16,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2024-06-27 22:17:16,877 INFO L175 Difference]: Start difference. First operand has 289 places, 317 transitions, 4646 flow. Second operand 10 states and 177 transitions. [2024-06-27 22:17:16,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 344 transitions, 5456 flow [2024-06-27 22:17:17,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 344 transitions, 5076 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:17:17,283 INFO L231 Difference]: Finished difference. Result has 291 places, 317 transitions, 4594 flow [2024-06-27 22:17:17,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4266, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4594, PETRI_PLACES=291, PETRI_TRANSITIONS=317} [2024-06-27 22:17:17,284 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 251 predicate places. [2024-06-27 22:17:17,284 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 317 transitions, 4594 flow [2024-06-27 22:17:17,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:17,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:17,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:17,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-27 22:17:17,284 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:17,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:17,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1209806895, now seen corresponding path program 1 times [2024-06-27 22:17:17,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:17,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757815796] [2024-06-27 22:17:17,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:17,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:17:19,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:19,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757815796] [2024-06-27 22:17:19,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757815796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:19,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:19,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:17:19,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137356498] [2024-06-27 22:17:19,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:19,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:17:19,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:19,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:17:19,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:17:19,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:17:19,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 317 transitions, 4594 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:19,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:19,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:17:19,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:20,421 INFO L124 PetriNetUnfolderBase]: 2301/4791 cut-off events. [2024-06-27 22:17:20,421 INFO L125 PetriNetUnfolderBase]: For 86391/86393 co-relation queries the response was YES. [2024-06-27 22:17:20,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22946 conditions, 4791 events. 2301/4791 cut-off events. For 86391/86393 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 38204 event pairs, 965 based on Foata normal form. 4/4475 useless extension candidates. Maximal degree in co-relation 22813. Up to 3738 conditions per place. [2024-06-27 22:17:20,477 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 208 selfloop transitions, 136 changer transitions 0/352 dead transitions. [2024-06-27 22:17:20,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 352 transitions, 5454 flow [2024-06-27 22:17:20,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:17:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:17:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 209 transitions. [2024-06-27 22:17:20,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4465811965811966 [2024-06-27 22:17:20,479 INFO L175 Difference]: Start difference. First operand has 291 places, 317 transitions, 4594 flow. Second operand 13 states and 209 transitions. [2024-06-27 22:17:20,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 352 transitions, 5454 flow [2024-06-27 22:17:20,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 352 transitions, 5132 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:17:20,932 INFO L231 Difference]: Finished difference. Result has 296 places, 319 transitions, 4578 flow [2024-06-27 22:17:20,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4272, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4578, PETRI_PLACES=296, PETRI_TRANSITIONS=319} [2024-06-27 22:17:20,933 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 256 predicate places. [2024-06-27 22:17:20,933 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 319 transitions, 4578 flow [2024-06-27 22:17:20,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:20,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:20,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:20,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-27 22:17:20,934 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:20,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:20,934 INFO L85 PathProgramCache]: Analyzing trace with hash -577285101, now seen corresponding path program 14 times [2024-06-27 22:17:20,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:20,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443203836] [2024-06-27 22:17:20,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:20,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:22,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-27 22:17:22,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:22,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443203836] [2024-06-27 22:17:22,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443203836] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:22,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:22,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:17:22,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224555550] [2024-06-27 22:17:22,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:22,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:17:22,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:22,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:17:22,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:17:22,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:17:22,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 319 transitions, 4578 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:22,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:22,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:17:22,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:24,056 INFO L124 PetriNetUnfolderBase]: 2372/4981 cut-off events. [2024-06-27 22:17:24,057 INFO L125 PetriNetUnfolderBase]: For 121124/121126 co-relation queries the response was YES. [2024-06-27 22:17:24,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23789 conditions, 4981 events. 2372/4981 cut-off events. For 121124/121126 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 40165 event pairs, 1027 based on Foata normal form. 12/4666 useless extension candidates. Maximal degree in co-relation 23655. Up to 3718 conditions per place. [2024-06-27 22:17:24,112 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 207 selfloop transitions, 143 changer transitions 0/358 dead transitions. [2024-06-27 22:17:24,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 358 transitions, 5543 flow [2024-06-27 22:17:24,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:17:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:17:24,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 183 transitions. [2024-06-27 22:17:24,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2024-06-27 22:17:24,132 INFO L175 Difference]: Start difference. First operand has 296 places, 319 transitions, 4578 flow. Second operand 11 states and 183 transitions. [2024-06-27 22:17:24,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 358 transitions, 5543 flow [2024-06-27 22:17:24,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 358 transitions, 5243 flow, removed 10 selfloop flow, removed 11 redundant places. [2024-06-27 22:17:24,690 INFO L231 Difference]: Finished difference. Result has 296 places, 319 transitions, 4580 flow [2024-06-27 22:17:24,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4290, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4580, PETRI_PLACES=296, PETRI_TRANSITIONS=319} [2024-06-27 22:17:24,690 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 256 predicate places. [2024-06-27 22:17:24,690 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 319 transitions, 4580 flow [2024-06-27 22:17:24,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:24,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:24,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:24,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-27 22:17:24,691 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:24,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:24,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1035712499, now seen corresponding path program 15 times [2024-06-27 22:17:24,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:24,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856791003] [2024-06-27 22:17:24,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:24,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:17:26,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:26,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856791003] [2024-06-27 22:17:26,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856791003] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:26,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:26,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:17:26,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303695853] [2024-06-27 22:17:26,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:26,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:17:26,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:26,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:17:26,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:17:26,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:17:26,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 319 transitions, 4580 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 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-27 22:17:26,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:26,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:17:26,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:27,587 INFO L124 PetriNetUnfolderBase]: 2203/4898 cut-off events. [2024-06-27 22:17:27,587 INFO L125 PetriNetUnfolderBase]: For 154623/154665 co-relation queries the response was YES. [2024-06-27 22:17:27,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23791 conditions, 4898 events. 2203/4898 cut-off events. For 154623/154665 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 42006 event pairs, 1062 based on Foata normal form. 11/4522 useless extension candidates. Maximal degree in co-relation 23656. Up to 3271 conditions per place. [2024-06-27 22:17:27,645 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 179 selfloop transitions, 162 changer transitions 0/353 dead transitions. [2024-06-27 22:17:27,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 353 transitions, 5636 flow [2024-06-27 22:17:27,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:17:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:17:27,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-06-27 22:17:27,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2024-06-27 22:17:27,646 INFO L175 Difference]: Start difference. First operand has 296 places, 319 transitions, 4580 flow. Second operand 10 states and 183 transitions. [2024-06-27 22:17:27,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 353 transitions, 5636 flow [2024-06-27 22:17:28,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 353 transitions, 5352 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:17:28,410 INFO L231 Difference]: Finished difference. Result has 297 places, 319 transitions, 4623 flow [2024-06-27 22:17:28,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4296, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4623, PETRI_PLACES=297, PETRI_TRANSITIONS=319} [2024-06-27 22:17:28,410 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 257 predicate places. [2024-06-27 22:17:28,411 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 319 transitions, 4623 flow [2024-06-27 22:17:28,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 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-27 22:17:28,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:28,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:28,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-27 22:17:28,411 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:28,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:28,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1037079421, now seen corresponding path program 16 times [2024-06-27 22:17:28,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:28,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710504872] [2024-06-27 22:17:28,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:28,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:30,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:17:30,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:30,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710504872] [2024-06-27 22:17:30,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710504872] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:30,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:30,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:17:30,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996111929] [2024-06-27 22:17:30,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:30,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:17:30,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:30,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:17:30,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:17:30,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:17:30,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 319 transitions, 4623 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:30,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:30,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:17:30,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:31,561 INFO L124 PetriNetUnfolderBase]: 2497/5282 cut-off events. [2024-06-27 22:17:31,562 INFO L125 PetriNetUnfolderBase]: For 126066/126066 co-relation queries the response was YES. [2024-06-27 22:17:31,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24911 conditions, 5282 events. 2497/5282 cut-off events. For 126066/126066 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 43449 event pairs, 1195 based on Foata normal form. 10/4948 useless extension candidates. Maximal degree in co-relation 24775. Up to 3971 conditions per place. [2024-06-27 22:17:31,619 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 192 selfloop transitions, 157 changer transitions 0/357 dead transitions. [2024-06-27 22:17:31,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 357 transitions, 5569 flow [2024-06-27 22:17:31,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:17:31,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:17:31,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-27 22:17:31,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-27 22:17:31,620 INFO L175 Difference]: Start difference. First operand has 297 places, 319 transitions, 4623 flow. Second operand 10 states and 171 transitions. [2024-06-27 22:17:31,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 357 transitions, 5569 flow [2024-06-27 22:17:32,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 357 transitions, 5246 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:17:32,156 INFO L231 Difference]: Finished difference. Result has 299 places, 319 transitions, 4618 flow [2024-06-27 22:17:32,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4300, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4618, PETRI_PLACES=299, PETRI_TRANSITIONS=319} [2024-06-27 22:17:32,156 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 259 predicate places. [2024-06-27 22:17:32,157 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 319 transitions, 4618 flow [2024-06-27 22:17:32,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:32,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:32,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:32,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-27 22:17:32,157 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:32,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:32,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1209815265, now seen corresponding path program 2 times [2024-06-27 22:17:32,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:32,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902167893] [2024-06-27 22:17:32,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:32,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:17:33,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:33,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902167893] [2024-06-27 22:17:33,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902167893] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:33,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:33,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:17:33,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861333287] [2024-06-27 22:17:33,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:33,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:17:33,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:33,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:17:33,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:17:33,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:17:33,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 319 transitions, 4618 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:33,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:33,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:17:33,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:35,379 INFO L124 PetriNetUnfolderBase]: 2546/5377 cut-off events. [2024-06-27 22:17:35,380 INFO L125 PetriNetUnfolderBase]: For 104744/104746 co-relation queries the response was YES. [2024-06-27 22:17:35,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25593 conditions, 5377 events. 2546/5377 cut-off events. For 104744/104746 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 44548 event pairs, 1109 based on Foata normal form. 4/5029 useless extension candidates. Maximal degree in co-relation 25456. Up to 4088 conditions per place. [2024-06-27 22:17:35,435 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 211 selfloop transitions, 144 changer transitions 0/363 dead transitions. [2024-06-27 22:17:35,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 363 transitions, 5772 flow [2024-06-27 22:17:35,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:17:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:17:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 214 transitions. [2024-06-27 22:17:35,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45726495726495725 [2024-06-27 22:17:35,437 INFO L175 Difference]: Start difference. First operand has 299 places, 319 transitions, 4618 flow. Second operand 13 states and 214 transitions. [2024-06-27 22:17:35,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 363 transitions, 5772 flow [2024-06-27 22:17:36,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 363 transitions, 5460 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:17:36,021 INFO L231 Difference]: Finished difference. Result has 305 places, 324 transitions, 4704 flow [2024-06-27 22:17:36,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4306, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4704, PETRI_PLACES=305, PETRI_TRANSITIONS=324} [2024-06-27 22:17:36,022 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 265 predicate places. [2024-06-27 22:17:36,022 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 324 transitions, 4704 flow [2024-06-27 22:17:36,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:36,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:36,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:36,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-27 22:17:36,023 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:36,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:36,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1258622223, now seen corresponding path program 3 times [2024-06-27 22:17:36,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:36,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433297672] [2024-06-27 22:17:36,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:36,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:17:37,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:37,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433297672] [2024-06-27 22:17:37,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433297672] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:37,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:37,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:17:37,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276191079] [2024-06-27 22:17:37,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:37,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:17:37,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:37,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:17:37,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:17:37,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:17:37,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 324 transitions, 4704 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:37,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:37,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:17:37,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:39,252 INFO L124 PetriNetUnfolderBase]: 2547/5389 cut-off events. [2024-06-27 22:17:39,253 INFO L125 PetriNetUnfolderBase]: For 98689/98691 co-relation queries the response was YES. [2024-06-27 22:17:39,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25656 conditions, 5389 events. 2547/5389 cut-off events. For 98689/98691 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 44746 event pairs, 1109 based on Foata normal form. 4/5034 useless extension candidates. Maximal degree in co-relation 25517. Up to 4218 conditions per place. [2024-06-27 22:17:39,306 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 215 selfloop transitions, 133 changer transitions 0/356 dead transitions. [2024-06-27 22:17:39,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 356 transitions, 5565 flow [2024-06-27 22:17:39,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:17:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:17:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions. [2024-06-27 22:17:39,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4671717171717172 [2024-06-27 22:17:39,308 INFO L175 Difference]: Start difference. First operand has 305 places, 324 transitions, 4704 flow. Second operand 11 states and 185 transitions. [2024-06-27 22:17:39,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 356 transitions, 5565 flow [2024-06-27 22:17:40,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 356 transitions, 5351 flow, removed 20 selfloop flow, removed 10 redundant places. [2024-06-27 22:17:40,121 INFO L231 Difference]: Finished difference. Result has 306 places, 325 transitions, 4782 flow [2024-06-27 22:17:40,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4494, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4782, PETRI_PLACES=306, PETRI_TRANSITIONS=325} [2024-06-27 22:17:40,122 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 266 predicate places. [2024-06-27 22:17:40,122 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 325 transitions, 4782 flow [2024-06-27 22:17:40,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:40,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:40,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:40,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-27 22:17:40,122 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:40,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:40,123 INFO L85 PathProgramCache]: Analyzing trace with hash -571028991, now seen corresponding path program 17 times [2024-06-27 22:17:40,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:40,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38266211] [2024-06-27 22:17:40,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:40,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:17:41,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:41,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38266211] [2024-06-27 22:17:41,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38266211] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:41,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:41,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:17:41,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968765854] [2024-06-27 22:17:41,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:41,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:17:41,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:41,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:17:41,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:17:42,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:17:42,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 325 transitions, 4782 flow. Second operand has 12 states, 12 states have (on average 11.25) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:42,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:42,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:17:42,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:43,264 INFO L124 PetriNetUnfolderBase]: 2334/5237 cut-off events. [2024-06-27 22:17:43,265 INFO L125 PetriNetUnfolderBase]: For 133742/133789 co-relation queries the response was YES. [2024-06-27 22:17:43,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24757 conditions, 5237 events. 2334/5237 cut-off events. For 133742/133789 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 46117 event pairs, 1161 based on Foata normal form. 15/4830 useless extension candidates. Maximal degree in co-relation 24616. Up to 3876 conditions per place. [2024-06-27 22:17:43,328 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 193 selfloop transitions, 147 changer transitions 0/352 dead transitions. [2024-06-27 22:17:43,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 352 transitions, 5594 flow [2024-06-27 22:17:43,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:17:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:17:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 210 transitions. [2024-06-27 22:17:43,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2024-06-27 22:17:43,330 INFO L175 Difference]: Start difference. First operand has 306 places, 325 transitions, 4782 flow. Second operand 13 states and 210 transitions. [2024-06-27 22:17:43,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 352 transitions, 5594 flow [2024-06-27 22:17:44,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 352 transitions, 5329 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-27 22:17:44,165 INFO L231 Difference]: Finished difference. Result has 310 places, 325 transitions, 4815 flow [2024-06-27 22:17:44,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4517, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4815, PETRI_PLACES=310, PETRI_TRANSITIONS=325} [2024-06-27 22:17:44,165 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 270 predicate places. [2024-06-27 22:17:44,165 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 325 transitions, 4815 flow [2024-06-27 22:17:44,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.25) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:44,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:44,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:44,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-27 22:17:44,166 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:44,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:44,167 INFO L85 PathProgramCache]: Analyzing trace with hash -577458081, now seen corresponding path program 18 times [2024-06-27 22:17:44,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:44,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224598150] [2024-06-27 22:17:44,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:44,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:17:45,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:45,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224598150] [2024-06-27 22:17:45,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224598150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:45,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:45,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:17:45,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984458345] [2024-06-27 22:17:45,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:45,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:17:45,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:45,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:17:45,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:17:45,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:17:45,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 325 transitions, 4815 flow. Second operand has 12 states, 12 states have (on average 11.25) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:45,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:45,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:17:45,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:47,282 INFO L124 PetriNetUnfolderBase]: 2396/5394 cut-off events. [2024-06-27 22:17:47,282 INFO L125 PetriNetUnfolderBase]: For 136585/136635 co-relation queries the response was YES. [2024-06-27 22:17:47,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25352 conditions, 5394 events. 2396/5394 cut-off events. For 136585/136635 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 47928 event pairs, 1203 based on Foata normal form. 15/4976 useless extension candidates. Maximal degree in co-relation 25210. Up to 3960 conditions per place. [2024-06-27 22:17:47,349 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 190 selfloop transitions, 148 changer transitions 0/350 dead transitions. [2024-06-27 22:17:47,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 350 transitions, 5619 flow [2024-06-27 22:17:47,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:17:47,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:17:47,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions. [2024-06-27 22:17:47,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-27 22:17:47,350 INFO L175 Difference]: Start difference. First operand has 310 places, 325 transitions, 4815 flow. Second operand 11 states and 187 transitions. [2024-06-27 22:17:47,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 350 transitions, 5619 flow [2024-06-27 22:17:48,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 350 transitions, 5327 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-06-27 22:17:48,073 INFO L231 Difference]: Finished difference. Result has 310 places, 325 transitions, 4823 flow [2024-06-27 22:17:48,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4523, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4823, PETRI_PLACES=310, PETRI_TRANSITIONS=325} [2024-06-27 22:17:48,073 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 270 predicate places. [2024-06-27 22:17:48,073 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 325 transitions, 4823 flow [2024-06-27 22:17:48,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.25) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:48,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:48,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:48,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-27 22:17:48,074 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:48,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:48,074 INFO L85 PathProgramCache]: Analyzing trace with hash 483315359, now seen corresponding path program 19 times [2024-06-27 22:17:48,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:48,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242628364] [2024-06-27 22:17:48,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:48,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:17:49,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:49,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242628364] [2024-06-27 22:17:49,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242628364] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:49,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:49,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:17:49,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093503565] [2024-06-27 22:17:49,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:49,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:17:49,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:49,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:17:49,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:17:49,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:17:49,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 325 transitions, 4823 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:49,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:49,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:17:49,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:51,243 INFO L124 PetriNetUnfolderBase]: 2442/5530 cut-off events. [2024-06-27 22:17:51,243 INFO L125 PetriNetUnfolderBase]: For 130272/130322 co-relation queries the response was YES. [2024-06-27 22:17:51,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25859 conditions, 5530 events. 2442/5530 cut-off events. For 130272/130322 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 49456 event pairs, 1181 based on Foata normal form. 13/5105 useless extension candidates. Maximal degree in co-relation 25716. Up to 3634 conditions per place. [2024-06-27 22:17:51,298 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 196 selfloop transitions, 148 changer transitions 0/356 dead transitions. [2024-06-27 22:17:51,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 356 transitions, 5681 flow [2024-06-27 22:17:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:17:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:17:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2024-06-27 22:17:51,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-06-27 22:17:51,300 INFO L175 Difference]: Start difference. First operand has 310 places, 325 transitions, 4823 flow. Second operand 11 states and 192 transitions. [2024-06-27 22:17:51,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 356 transitions, 5681 flow [2024-06-27 22:17:52,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 356 transitions, 5387 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:17:52,055 INFO L231 Difference]: Finished difference. Result has 312 places, 325 transitions, 4828 flow [2024-06-27 22:17:52,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4529, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4828, PETRI_PLACES=312, PETRI_TRANSITIONS=325} [2024-06-27 22:17:52,056 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 272 predicate places. [2024-06-27 22:17:52,056 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 325 transitions, 4828 flow [2024-06-27 22:17:52,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:52,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:52,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:52,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-27 22:17:52,056 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:52,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:52,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2096675163, now seen corresponding path program 4 times [2024-06-27 22:17:52,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:52,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807031486] [2024-06-27 22:17:52,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:52,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:17:53,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:53,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807031486] [2024-06-27 22:17:53,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807031486] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:53,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:53,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:17:53,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495605499] [2024-06-27 22:17:53,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:53,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:17:53,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:53,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:17:53,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:17:53,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:17:53,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 325 transitions, 4828 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:53,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:53,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:17:53,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:55,215 INFO L124 PetriNetUnfolderBase]: 2760/5886 cut-off events. [2024-06-27 22:17:55,215 INFO L125 PetriNetUnfolderBase]: For 106436/106437 co-relation queries the response was YES. [2024-06-27 22:17:55,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27843 conditions, 5886 events. 2760/5886 cut-off events. For 106436/106437 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 50316 event pairs, 1251 based on Foata normal form. 3/5494 useless extension candidates. Maximal degree in co-relation 27699. Up to 4641 conditions per place. [2024-06-27 22:17:55,298 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 207 selfloop transitions, 141 changer transitions 0/356 dead transitions. [2024-06-27 22:17:55,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 356 transitions, 5681 flow [2024-06-27 22:17:55,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:17:55,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:17:55,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-27 22:17:55,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-27 22:17:55,299 INFO L175 Difference]: Start difference. First operand has 312 places, 325 transitions, 4828 flow. Second operand 10 states and 171 transitions. [2024-06-27 22:17:55,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 356 transitions, 5681 flow [2024-06-27 22:17:56,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 356 transitions, 5386 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:17:56,072 INFO L231 Difference]: Finished difference. Result has 313 places, 326 transitions, 4840 flow [2024-06-27 22:17:56,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4533, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4840, PETRI_PLACES=313, PETRI_TRANSITIONS=326} [2024-06-27 22:17:56,074 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 273 predicate places. [2024-06-27 22:17:56,074 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 326 transitions, 4840 flow [2024-06-27 22:17:56,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:56,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:17:56,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:17:56,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-27 22:17:56,075 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:17:56,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:17:56,075 INFO L85 PathProgramCache]: Analyzing trace with hash 767617953, now seen corresponding path program 5 times [2024-06-27 22:17:56,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:17:56,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303294084] [2024-06-27 22:17:56,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:17:56,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:17:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:17:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:17:57,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:17:57,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303294084] [2024-06-27 22:17:57,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303294084] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:17:57,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:17:57,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:17:57,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988642580] [2024-06-27 22:17:57,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:17:57,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:17:57,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:17:57,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:17:57,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:17:57,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:17:57,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 326 transitions, 4840 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:17:57,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:17:57,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:17:57,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:17:59,453 INFO L124 PetriNetUnfolderBase]: 2788/5971 cut-off events. [2024-06-27 22:17:59,453 INFO L125 PetriNetUnfolderBase]: For 109283/109283 co-relation queries the response was YES. [2024-06-27 22:17:59,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28251 conditions, 5971 events. 2788/5971 cut-off events. For 109283/109283 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 51394 event pairs, 1891 based on Foata normal form. 2/5579 useless extension candidates. Maximal degree in co-relation 28106. Up to 4790 conditions per place. [2024-06-27 22:17:59,514 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 225 selfloop transitions, 121 changer transitions 0/354 dead transitions. [2024-06-27 22:17:59,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 354 transitions, 5746 flow [2024-06-27 22:17:59,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:17:59,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:17:59,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2024-06-27 22:17:59,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-27 22:17:59,516 INFO L175 Difference]: Start difference. First operand has 313 places, 326 transitions, 4840 flow. Second operand 11 states and 174 transitions. [2024-06-27 22:17:59,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 354 transitions, 5746 flow [2024-06-27 22:18:00,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 354 transitions, 5447 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-27 22:18:00,187 INFO L231 Difference]: Finished difference. Result has 316 places, 328 transitions, 4842 flow [2024-06-27 22:18:00,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4553, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4842, PETRI_PLACES=316, PETRI_TRANSITIONS=328} [2024-06-27 22:18:00,187 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 276 predicate places. [2024-06-27 22:18:00,188 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 328 transitions, 4842 flow [2024-06-27 22:18:00,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:00,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:00,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:00,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-27 22:18:00,188 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:18:00,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:00,189 INFO L85 PathProgramCache]: Analyzing trace with hash 774104703, now seen corresponding path program 6 times [2024-06-27 22:18:00,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:00,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311661962] [2024-06-27 22:18:00,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:00,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:18:01,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:01,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311661962] [2024-06-27 22:18:01,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311661962] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:01,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:01,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:18:01,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671584617] [2024-06-27 22:18:01,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:01,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:18:01,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:01,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:18:01,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:18:02,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:18:02,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 328 transitions, 4842 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:02,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:02,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:18:02,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:03,655 INFO L124 PetriNetUnfolderBase]: 2816/6041 cut-off events. [2024-06-27 22:18:03,656 INFO L125 PetriNetUnfolderBase]: For 110802/110802 co-relation queries the response was YES. [2024-06-27 22:18:03,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28506 conditions, 6041 events. 2816/6041 cut-off events. For 110802/110802 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 52150 event pairs, 1907 based on Foata normal form. 2/5644 useless extension candidates. Maximal degree in co-relation 28360. Up to 4842 conditions per place. [2024-06-27 22:18:03,732 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 227 selfloop transitions, 125 changer transitions 0/360 dead transitions. [2024-06-27 22:18:03,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 360 transitions, 5767 flow [2024-06-27 22:18:03,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:18:03,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:18:03,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 199 transitions. [2024-06-27 22:18:03,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4252136752136752 [2024-06-27 22:18:03,733 INFO L175 Difference]: Start difference. First operand has 316 places, 328 transitions, 4842 flow. Second operand 13 states and 199 transitions. [2024-06-27 22:18:03,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 360 transitions, 5767 flow [2024-06-27 22:18:04,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 360 transitions, 5516 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-27 22:18:04,626 INFO L231 Difference]: Finished difference. Result has 320 places, 331 transitions, 4902 flow [2024-06-27 22:18:04,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4591, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4902, PETRI_PLACES=320, PETRI_TRANSITIONS=331} [2024-06-27 22:18:04,627 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 280 predicate places. [2024-06-27 22:18:04,627 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 331 transitions, 4902 flow [2024-06-27 22:18:04,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:04,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:04,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:04,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-27 22:18:04,627 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:18:04,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:04,636 INFO L85 PathProgramCache]: Analyzing trace with hash 774113073, now seen corresponding path program 7 times [2024-06-27 22:18:04,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:04,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564327387] [2024-06-27 22:18:04,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:04,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:06,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:18:06,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:06,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564327387] [2024-06-27 22:18:06,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564327387] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:06,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:06,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:18:06,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003693692] [2024-06-27 22:18:06,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:06,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:18:06,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:06,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:18:06,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:18:06,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:18:06,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 331 transitions, 4902 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:06,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:06,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:18:06,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:08,202 INFO L124 PetriNetUnfolderBase]: 2844/6102 cut-off events. [2024-06-27 22:18:08,202 INFO L125 PetriNetUnfolderBase]: For 112994/112994 co-relation queries the response was YES. [2024-06-27 22:18:08,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28896 conditions, 6102 events. 2844/6102 cut-off events. For 112994/112994 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 52806 event pairs, 1897 based on Foata normal form. 2/5708 useless extension candidates. Maximal degree in co-relation 28749. Up to 4732 conditions per place. [2024-06-27 22:18:08,272 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 223 selfloop transitions, 135 changer transitions 0/366 dead transitions. [2024-06-27 22:18:08,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 366 transitions, 5843 flow [2024-06-27 22:18:08,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:18:08,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:18:08,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 202 transitions. [2024-06-27 22:18:08,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43162393162393164 [2024-06-27 22:18:08,274 INFO L175 Difference]: Start difference. First operand has 320 places, 331 transitions, 4902 flow. Second operand 13 states and 202 transitions. [2024-06-27 22:18:08,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 366 transitions, 5843 flow [2024-06-27 22:18:09,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 366 transitions, 5558 flow, removed 7 selfloop flow, removed 12 redundant places. [2024-06-27 22:18:09,189 INFO L231 Difference]: Finished difference. Result has 321 places, 333 transitions, 4935 flow [2024-06-27 22:18:09,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4617, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4935, PETRI_PLACES=321, PETRI_TRANSITIONS=333} [2024-06-27 22:18:09,190 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 281 predicate places. [2024-06-27 22:18:09,190 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 333 transitions, 4935 flow [2024-06-27 22:18:09,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:09,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:09,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:09,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-27 22:18:09,191 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:18:09,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:09,191 INFO L85 PathProgramCache]: Analyzing trace with hash 601384173, now seen corresponding path program 8 times [2024-06-27 22:18:09,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:09,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608215755] [2024-06-27 22:18:09,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:09,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:10,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:18:10,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:10,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608215755] [2024-06-27 22:18:10,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608215755] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:10,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:10,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:18:10,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990019089] [2024-06-27 22:18:10,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:10,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:18:10,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:10,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:18:10,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:18:10,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:18:10,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 333 transitions, 4935 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:10,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:10,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:18:10,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:12,218 INFO L124 PetriNetUnfolderBase]: 2872/6179 cut-off events. [2024-06-27 22:18:12,219 INFO L125 PetriNetUnfolderBase]: For 116057/116057 co-relation queries the response was YES. [2024-06-27 22:18:12,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29349 conditions, 6179 events. 2872/6179 cut-off events. For 116057/116057 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 53804 event pairs, 1913 based on Foata normal form. 2/5772 useless extension candidates. Maximal degree in co-relation 29201. Up to 4948 conditions per place. [2024-06-27 22:18:12,299 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 217 selfloop transitions, 134 changer transitions 0/359 dead transitions. [2024-06-27 22:18:12,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 359 transitions, 5825 flow [2024-06-27 22:18:12,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:18:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:18:12,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2024-06-27 22:18:12,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-27 22:18:12,300 INFO L175 Difference]: Start difference. First operand has 321 places, 333 transitions, 4935 flow. Second operand 10 states and 160 transitions. [2024-06-27 22:18:12,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 359 transitions, 5825 flow [2024-06-27 22:18:13,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 359 transitions, 5548 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-27 22:18:13,285 INFO L231 Difference]: Finished difference. Result has 320 places, 335 transitions, 4975 flow [2024-06-27 22:18:13,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4658, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4975, PETRI_PLACES=320, PETRI_TRANSITIONS=335} [2024-06-27 22:18:13,286 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 280 predicate places. [2024-06-27 22:18:13,286 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 335 transitions, 4975 flow [2024-06-27 22:18:13,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:13,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:13,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:13,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-27 22:18:13,287 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:18:13,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:13,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1443122851, now seen corresponding path program 9 times [2024-06-27 22:18:13,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:13,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869258232] [2024-06-27 22:18:13,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:13,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:15,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:18:15,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:15,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869258232] [2024-06-27 22:18:15,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869258232] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:15,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:15,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:18:15,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914347592] [2024-06-27 22:18:15,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:15,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:18:15,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:15,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:18:15,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:18:15,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:18:15,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 335 transitions, 4975 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:15,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:15,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:18:15,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:16,691 INFO L124 PetriNetUnfolderBase]: 2889/6215 cut-off events. [2024-06-27 22:18:16,692 INFO L125 PetriNetUnfolderBase]: For 118040/118040 co-relation queries the response was YES. [2024-06-27 22:18:16,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29547 conditions, 6215 events. 2889/6215 cut-off events. For 118040/118040 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 54134 event pairs, 1932 based on Foata normal form. 2/5803 useless extension candidates. Maximal degree in co-relation 29398. Up to 5189 conditions per place. [2024-06-27 22:18:16,768 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 305 selfloop transitions, 53 changer transitions 0/366 dead transitions. [2024-06-27 22:18:16,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 366 transitions, 5917 flow [2024-06-27 22:18:16,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:18:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:18:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 192 transitions. [2024-06-27 22:18:16,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2024-06-27 22:18:16,769 INFO L175 Difference]: Start difference. First operand has 320 places, 335 transitions, 4975 flow. Second operand 13 states and 192 transitions. [2024-06-27 22:18:16,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 366 transitions, 5917 flow [2024-06-27 22:18:17,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 366 transitions, 5640 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-27 22:18:17,574 INFO L231 Difference]: Finished difference. Result has 325 places, 336 transitions, 4840 flow [2024-06-27 22:18:17,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4698, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4840, PETRI_PLACES=325, PETRI_TRANSITIONS=336} [2024-06-27 22:18:17,575 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 285 predicate places. [2024-06-27 22:18:17,575 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 336 transitions, 4840 flow [2024-06-27 22:18:17,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:17,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:17,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:17,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-27 22:18:17,575 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:18:17,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:17,576 INFO L85 PathProgramCache]: Analyzing trace with hash 162574925, now seen corresponding path program 10 times [2024-06-27 22:18:17,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:17,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627630633] [2024-06-27 22:18:17,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:17,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:19,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:18:19,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:19,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627630633] [2024-06-27 22:18:19,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627630633] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:19,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:19,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:18:19,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059747345] [2024-06-27 22:18:19,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:19,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:18:19,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:19,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:18:19,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:18:19,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:18:19,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 336 transitions, 4840 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:19,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:19,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:18:19,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:20,832 INFO L124 PetriNetUnfolderBase]: 2926/6292 cut-off events. [2024-06-27 22:18:20,832 INFO L125 PetriNetUnfolderBase]: For 131793/131793 co-relation queries the response was YES. [2024-06-27 22:18:20,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30099 conditions, 6292 events. 2926/6292 cut-off events. For 131793/131793 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 54959 event pairs, 1926 based on Foata normal form. 2/5878 useless extension candidates. Maximal degree in co-relation 29949. Up to 5174 conditions per place. [2024-06-27 22:18:20,913 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 308 selfloop transitions, 56 changer transitions 0/372 dead transitions. [2024-06-27 22:18:20,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 372 transitions, 6045 flow [2024-06-27 22:18:20,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:18:20,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:18:20,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 196 transitions. [2024-06-27 22:18:20,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4188034188034188 [2024-06-27 22:18:20,914 INFO L175 Difference]: Start difference. First operand has 325 places, 336 transitions, 4840 flow. Second operand 13 states and 196 transitions. [2024-06-27 22:18:20,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 372 transitions, 6045 flow [2024-06-27 22:18:21,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 372 transitions, 5925 flow, removed 9 selfloop flow, removed 11 redundant places. [2024-06-27 22:18:21,954 INFO L231 Difference]: Finished difference. Result has 327 places, 338 transitions, 4898 flow [2024-06-27 22:18:21,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4720, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4898, PETRI_PLACES=327, PETRI_TRANSITIONS=338} [2024-06-27 22:18:21,954 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 287 predicate places. [2024-06-27 22:18:21,954 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 338 transitions, 4898 flow [2024-06-27 22:18:21,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:21,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:21,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:21,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-27 22:18:21,955 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:18:21,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:21,955 INFO L85 PathProgramCache]: Analyzing trace with hash 156079805, now seen corresponding path program 11 times [2024-06-27 22:18:21,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:21,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479318705] [2024-06-27 22:18:21,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:21,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:18:23,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:23,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479318705] [2024-06-27 22:18:23,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479318705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:23,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:23,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:18:23,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584498125] [2024-06-27 22:18:23,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:23,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:18:23,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:23,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:18:23,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:18:23,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:18:23,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 338 transitions, 4898 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:23,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:23,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:18:23,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:25,052 INFO L124 PetriNetUnfolderBase]: 2923/6295 cut-off events. [2024-06-27 22:18:25,052 INFO L125 PetriNetUnfolderBase]: For 122389/122389 co-relation queries the response was YES. [2024-06-27 22:18:25,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29830 conditions, 6295 events. 2923/6295 cut-off events. For 122389/122389 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 55037 event pairs, 1938 based on Foata normal form. 2/5877 useless extension candidates. Maximal degree in co-relation 29679. Up to 5251 conditions per place. [2024-06-27 22:18:25,131 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 307 selfloop transitions, 51 changer transitions 0/366 dead transitions. [2024-06-27 22:18:25,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 366 transitions, 5808 flow [2024-06-27 22:18:25,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:18:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:18:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2024-06-27 22:18:25,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-27 22:18:25,132 INFO L175 Difference]: Start difference. First operand has 327 places, 338 transitions, 4898 flow. Second operand 11 states and 168 transitions. [2024-06-27 22:18:25,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 366 transitions, 5808 flow [2024-06-27 22:18:25,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 366 transitions, 5701 flow, removed 19 selfloop flow, removed 9 redundant places. [2024-06-27 22:18:25,968 INFO L231 Difference]: Finished difference. Result has 329 places, 338 transitions, 4899 flow [2024-06-27 22:18:25,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4791, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4899, PETRI_PLACES=329, PETRI_TRANSITIONS=338} [2024-06-27 22:18:25,969 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 289 predicate places. [2024-06-27 22:18:25,969 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 338 transitions, 4899 flow [2024-06-27 22:18:25,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:25,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:25,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:25,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-27 22:18:25,969 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:18:25,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:25,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1093622447, now seen corresponding path program 20 times [2024-06-27 22:18:25,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:25,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063617198] [2024-06-27 22:18:25,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:25,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:18:27,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:27,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063617198] [2024-06-27 22:18:27,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063617198] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:27,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:27,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:18:27,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737445740] [2024-06-27 22:18:27,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:27,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:18:27,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:27,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:18:27,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:18:27,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:18:27,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 338 transitions, 4899 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:27,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:27,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:18:27,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:29,728 INFO L124 PetriNetUnfolderBase]: 2994/6479 cut-off events. [2024-06-27 22:18:29,729 INFO L125 PetriNetUnfolderBase]: For 166604/166604 co-relation queries the response was YES. [2024-06-27 22:18:29,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30324 conditions, 6479 events. 2994/6479 cut-off events. For 166604/166604 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 57027 event pairs, 1973 based on Foata normal form. 10/6058 useless extension candidates. Maximal degree in co-relation 30171. Up to 5247 conditions per place. [2024-06-27 22:18:29,812 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 313 selfloop transitions, 54 changer transitions 0/375 dead transitions. [2024-06-27 22:18:29,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 375 transitions, 5885 flow [2024-06-27 22:18:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 22:18:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 22:18:29,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 209 transitions. [2024-06-27 22:18:29,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146825396825397 [2024-06-27 22:18:29,814 INFO L175 Difference]: Start difference. First operand has 329 places, 338 transitions, 4899 flow. Second operand 14 states and 209 transitions. [2024-06-27 22:18:29,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 375 transitions, 5885 flow [2024-06-27 22:18:30,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 375 transitions, 5774 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-27 22:18:30,904 INFO L231 Difference]: Finished difference. Result has 333 places, 338 transitions, 4900 flow [2024-06-27 22:18:30,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4788, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4900, PETRI_PLACES=333, PETRI_TRANSITIONS=338} [2024-06-27 22:18:30,904 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 293 predicate places. [2024-06-27 22:18:30,904 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 338 transitions, 4900 flow [2024-06-27 22:18:30,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:30,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:30,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:30,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-27 22:18:30,905 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:18:30,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:30,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1087193357, now seen corresponding path program 21 times [2024-06-27 22:18:30,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:30,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006942977] [2024-06-27 22:18:30,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:30,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:18:32,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:32,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006942977] [2024-06-27 22:18:32,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006942977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:32,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:32,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:18:32,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56970433] [2024-06-27 22:18:32,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:32,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:18:32,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:32,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:18:32,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:18:32,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:18:32,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 338 transitions, 4900 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:32,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:32,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:18:32,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:34,241 INFO L124 PetriNetUnfolderBase]: 3065/6644 cut-off events. [2024-06-27 22:18:34,241 INFO L125 PetriNetUnfolderBase]: For 169628/169628 co-relation queries the response was YES. [2024-06-27 22:18:34,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30919 conditions, 6644 events. 3065/6644 cut-off events. For 169628/169628 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 58837 event pairs, 2024 based on Foata normal form. 10/6214 useless extension candidates. Maximal degree in co-relation 30765. Up to 5344 conditions per place. [2024-06-27 22:18:34,325 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 308 selfloop transitions, 58 changer transitions 0/374 dead transitions. [2024-06-27 22:18:34,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 374 transitions, 5881 flow [2024-06-27 22:18:34,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:18:34,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:18:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2024-06-27 22:18:34,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43287037037037035 [2024-06-27 22:18:34,326 INFO L175 Difference]: Start difference. First operand has 333 places, 338 transitions, 4900 flow. Second operand 12 states and 187 transitions. [2024-06-27 22:18:34,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 374 transitions, 5881 flow [2024-06-27 22:18:35,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 374 transitions, 5775 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-06-27 22:18:35,426 INFO L231 Difference]: Finished difference. Result has 333 places, 338 transitions, 4914 flow [2024-06-27 22:18:35,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4794, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4914, PETRI_PLACES=333, PETRI_TRANSITIONS=338} [2024-06-27 22:18:35,427 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 293 predicate places. [2024-06-27 22:18:35,427 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 338 transitions, 4914 flow [2024-06-27 22:18:35,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:35,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:35,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:35,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-27 22:18:35,427 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:18:35,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:35,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1087188707, now seen corresponding path program 22 times [2024-06-27 22:18:35,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:35,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511148777] [2024-06-27 22:18:35,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:35,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:18:37,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:37,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511148777] [2024-06-27 22:18:37,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511148777] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:37,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:37,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:18:37,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897986468] [2024-06-27 22:18:37,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:37,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:18:37,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:37,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:18:37,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:18:37,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:18:37,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 338 transitions, 4914 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:37,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:37,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:18:37,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:38,921 INFO L124 PetriNetUnfolderBase]: 3119/6780 cut-off events. [2024-06-27 22:18:38,921 INFO L125 PetriNetUnfolderBase]: For 160696/160696 co-relation queries the response was YES. [2024-06-27 22:18:38,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31453 conditions, 6780 events. 3119/6780 cut-off events. For 160696/160696 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 60391 event pairs, 2052 based on Foata normal form. 8/6340 useless extension candidates. Maximal degree in co-relation 31298. Up to 5404 conditions per place. [2024-06-27 22:18:39,000 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 329 selfloop transitions, 38 changer transitions 0/375 dead transitions. [2024-06-27 22:18:39,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 375 transitions, 5893 flow [2024-06-27 22:18:39,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:18:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:18:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 188 transitions. [2024-06-27 22:18:39,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4351851851851852 [2024-06-27 22:18:39,001 INFO L175 Difference]: Start difference. First operand has 333 places, 338 transitions, 4914 flow. Second operand 12 states and 188 transitions. [2024-06-27 22:18:39,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 375 transitions, 5893 flow [2024-06-27 22:18:39,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 375 transitions, 5779 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 22:18:39,953 INFO L231 Difference]: Finished difference. Result has 335 places, 338 transitions, 4879 flow [2024-06-27 22:18:39,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4800, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4879, PETRI_PLACES=335, PETRI_TRANSITIONS=338} [2024-06-27 22:18:39,953 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 295 predicate places. [2024-06-27 22:18:39,953 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 338 transitions, 4879 flow [2024-06-27 22:18:39,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:39,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:39,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:39,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-27 22:18:39,954 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:18:39,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:39,954 INFO L85 PathProgramCache]: Analyzing trace with hash 156072861, now seen corresponding path program 23 times [2024-06-27 22:18:39,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:39,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917614013] [2024-06-27 22:18:39,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:39,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:18:41,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:41,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917614013] [2024-06-27 22:18:41,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917614013] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:41,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:41,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:18:41,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320222480] [2024-06-27 22:18:41,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:41,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:18:41,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:41,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:18:41,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:18:41,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:18:41,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 338 transitions, 4879 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:41,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:41,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:18:41,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:43,480 INFO L124 PetriNetUnfolderBase]: 3190/6939 cut-off events. [2024-06-27 22:18:43,481 INFO L125 PetriNetUnfolderBase]: For 176209/176209 co-relation queries the response was YES. [2024-06-27 22:18:43,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32012 conditions, 6939 events. 3190/6939 cut-off events. For 176209/176209 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 62210 event pairs, 2129 based on Foata normal form. 10/6492 useless extension candidates. Maximal degree in co-relation 31856. Up to 5639 conditions per place. [2024-06-27 22:18:43,593 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 313 selfloop transitions, 52 changer transitions 0/373 dead transitions. [2024-06-27 22:18:43,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 373 transitions, 5857 flow [2024-06-27 22:18:43,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:18:43,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:18:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 176 transitions. [2024-06-27 22:18:43,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-27 22:18:43,594 INFO L175 Difference]: Start difference. First operand has 335 places, 338 transitions, 4879 flow. Second operand 11 states and 176 transitions. [2024-06-27 22:18:43,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 373 transitions, 5857 flow [2024-06-27 22:18:44,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 373 transitions, 5782 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 22:18:44,725 INFO L231 Difference]: Finished difference. Result has 336 places, 338 transitions, 4912 flow [2024-06-27 22:18:44,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4804, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4912, PETRI_PLACES=336, PETRI_TRANSITIONS=338} [2024-06-27 22:18:44,725 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 296 predicate places. [2024-06-27 22:18:44,725 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 338 transitions, 4912 flow [2024-06-27 22:18:44,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:44,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:44,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:44,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-27 22:18:44,726 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:18:44,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:44,726 INFO L85 PathProgramCache]: Analyzing trace with hash 981059513, now seen corresponding path program 12 times [2024-06-27 22:18:44,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:44,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679616606] [2024-06-27 22:18:44,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:44,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:18:46,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:46,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679616606] [2024-06-27 22:18:46,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679616606] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:46,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:46,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:18:46,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708067619] [2024-06-27 22:18:46,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:46,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:18:46,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:46,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:18:46,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:18:46,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:18:46,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 338 transitions, 4912 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:46,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:46,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:18:46,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:48,063 INFO L124 PetriNetUnfolderBase]: 3207/6961 cut-off events. [2024-06-27 22:18:48,063 INFO L125 PetriNetUnfolderBase]: For 132966/132966 co-relation queries the response was YES. [2024-06-27 22:18:48,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32354 conditions, 6961 events. 3207/6961 cut-off events. For 132966/132966 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 62461 event pairs, 2148 based on Foata normal form. 2/6503 useless extension candidates. Maximal degree in co-relation 32197. Up to 5821 conditions per place. [2024-06-27 22:18:48,150 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 305 selfloop transitions, 51 changer transitions 0/364 dead transitions. [2024-06-27 22:18:48,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 364 transitions, 5807 flow [2024-06-27 22:18:48,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:18:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:18:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 164 transitions. [2024-06-27 22:18:48,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-27 22:18:48,151 INFO L175 Difference]: Start difference. First operand has 336 places, 338 transitions, 4912 flow. Second operand 11 states and 164 transitions. [2024-06-27 22:18:48,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 364 transitions, 5807 flow [2024-06-27 22:18:49,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 364 transitions, 5705 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:18:49,322 INFO L231 Difference]: Finished difference. Result has 338 places, 339 transitions, 4952 flow [2024-06-27 22:18:49,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4810, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4952, PETRI_PLACES=338, PETRI_TRANSITIONS=339} [2024-06-27 22:18:49,323 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 298 predicate places. [2024-06-27 22:18:49,323 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 339 transitions, 4952 flow [2024-06-27 22:18:49,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:49,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:49,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:49,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-27 22:18:49,324 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:18:49,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:49,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1912168415, now seen corresponding path program 24 times [2024-06-27 22:18:49,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:49,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145386370] [2024-06-27 22:18:49,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:49,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:18:50,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:50,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145386370] [2024-06-27 22:18:50,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145386370] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:50,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:50,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:18:50,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273876168] [2024-06-27 22:18:50,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:50,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:18:50,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:50,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:18:50,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:18:50,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:18:50,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 339 transitions, 4952 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:50,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:50,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:18:50,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:52,910 INFO L124 PetriNetUnfolderBase]: 3305/7230 cut-off events. [2024-06-27 22:18:52,910 INFO L125 PetriNetUnfolderBase]: For 207700/207700 co-relation queries the response was YES. [2024-06-27 22:18:52,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33892 conditions, 7230 events. 3305/7230 cut-off events. For 207700/207700 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 65495 event pairs, 2154 based on Foata normal form. 8/6765 useless extension candidates. Maximal degree in co-relation 33734. Up to 5438 conditions per place. [2024-06-27 22:18:53,006 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 307 selfloop transitions, 66 changer transitions 0/381 dead transitions. [2024-06-27 22:18:53,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 381 transitions, 6400 flow [2024-06-27 22:18:53,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:18:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:18:53,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 190 transitions. [2024-06-27 22:18:53,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4398148148148148 [2024-06-27 22:18:53,007 INFO L175 Difference]: Start difference. First operand has 338 places, 339 transitions, 4952 flow. Second operand 12 states and 190 transitions. [2024-06-27 22:18:53,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 381 transitions, 6400 flow [2024-06-27 22:18:54,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 381 transitions, 6280 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-27 22:18:54,285 INFO L231 Difference]: Finished difference. Result has 341 places, 339 transitions, 4967 flow [2024-06-27 22:18:54,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4832, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4967, PETRI_PLACES=341, PETRI_TRANSITIONS=339} [2024-06-27 22:18:54,285 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 301 predicate places. [2024-06-27 22:18:54,285 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 339 transitions, 4967 flow [2024-06-27 22:18:54,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:54,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:54,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:54,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-27 22:18:54,286 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:18:54,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:54,286 INFO L85 PathProgramCache]: Analyzing trace with hash 980879589, now seen corresponding path program 25 times [2024-06-27 22:18:54,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:54,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717570647] [2024-06-27 22:18:54,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:54,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:18:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:18:55,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:18:55,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717570647] [2024-06-27 22:18:55,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717570647] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:18:55,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:18:55,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:18:55,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100962826] [2024-06-27 22:18:55,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:18:55,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:18:55,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:18:55,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:18:55,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:18:56,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:18:56,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 339 transitions, 4967 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:56,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:18:56,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:18:56,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:18:57,767 INFO L124 PetriNetUnfolderBase]: 3376/7372 cut-off events. [2024-06-27 22:18:57,768 INFO L125 PetriNetUnfolderBase]: For 223078/223078 co-relation queries the response was YES. [2024-06-27 22:18:57,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34436 conditions, 7372 events. 3376/7372 cut-off events. For 223078/223078 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 67071 event pairs, 2258 based on Foata normal form. 10/6898 useless extension candidates. Maximal degree in co-relation 34277. Up to 5944 conditions per place. [2024-06-27 22:18:57,873 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 300 selfloop transitions, 66 changer transitions 0/374 dead transitions. [2024-06-27 22:18:57,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 374 transitions, 6137 flow [2024-06-27 22:18:57,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:18:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:18:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 184 transitions. [2024-06-27 22:18:57,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2024-06-27 22:18:57,875 INFO L175 Difference]: Start difference. First operand has 341 places, 339 transitions, 4967 flow. Second operand 12 states and 184 transitions. [2024-06-27 22:18:57,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 374 transitions, 6137 flow [2024-06-27 22:18:59,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 374 transitions, 6010 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-27 22:18:59,647 INFO L231 Difference]: Finished difference. Result has 343 places, 339 transitions, 4976 flow [2024-06-27 22:18:59,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4840, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4976, PETRI_PLACES=343, PETRI_TRANSITIONS=339} [2024-06-27 22:18:59,647 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 303 predicate places. [2024-06-27 22:18:59,647 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 339 transitions, 4976 flow [2024-06-27 22:18:59,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:18:59,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:18:59,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:18:59,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-27 22:18:59,648 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:18:59,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:18:59,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1912346045, now seen corresponding path program 26 times [2024-06-27 22:18:59,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:18:59,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571305362] [2024-06-27 22:18:59,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:18:59,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:18:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:01,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:01,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:01,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571305362] [2024-06-27 22:19:01,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571305362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:01,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:01,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:19:01,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282139885] [2024-06-27 22:19:01,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:01,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:19:01,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:01,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:19:01,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:19:01,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:19:01,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 339 transitions, 4976 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:01,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:01,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:19:01,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:03,053 INFO L124 PetriNetUnfolderBase]: 3403/7441 cut-off events. [2024-06-27 22:19:03,053 INFO L125 PetriNetUnfolderBase]: For 189654/189654 co-relation queries the response was YES. [2024-06-27 22:19:03,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34082 conditions, 7441 events. 3403/7441 cut-off events. For 189654/189654 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 67910 event pairs, 2279 based on Foata normal form. 10/6961 useless extension candidates. Maximal degree in co-relation 33923. Up to 6068 conditions per place. [2024-06-27 22:19:03,143 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 311 selfloop transitions, 52 changer transitions 0/371 dead transitions. [2024-06-27 22:19:03,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 371 transitions, 5907 flow [2024-06-27 22:19:03,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:19:03,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:19:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 181 transitions. [2024-06-27 22:19:03,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41898148148148145 [2024-06-27 22:19:03,145 INFO L175 Difference]: Start difference. First operand has 343 places, 339 transitions, 4976 flow. Second operand 12 states and 181 transitions. [2024-06-27 22:19:03,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 371 transitions, 5907 flow [2024-06-27 22:19:04,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 371 transitions, 5776 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 22:19:04,404 INFO L231 Difference]: Finished difference. Result has 345 places, 339 transitions, 4953 flow [2024-06-27 22:19:04,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4845, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4953, PETRI_PLACES=345, PETRI_TRANSITIONS=339} [2024-06-27 22:19:04,405 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 305 predicate places. [2024-06-27 22:19:04,405 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 339 transitions, 4953 flow [2024-06-27 22:19:04,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:04,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:04,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:04,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-27 22:19:04,406 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:19:04,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:04,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1918839739, now seen corresponding path program 13 times [2024-06-27 22:19:04,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:04,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694823926] [2024-06-27 22:19:04,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:04,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:06,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:06,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694823926] [2024-06-27 22:19:06,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694823926] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:06,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:06,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:19:06,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906538359] [2024-06-27 22:19:06,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:06,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:19:06,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:06,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:19:06,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:19:06,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:19:06,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 339 transitions, 4953 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:06,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:06,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:19:06,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:08,123 INFO L124 PetriNetUnfolderBase]: 3471/7599 cut-off events. [2024-06-27 22:19:08,123 INFO L125 PetriNetUnfolderBase]: For 193132/193132 co-relation queries the response was YES. [2024-06-27 22:19:08,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34573 conditions, 7599 events. 3471/7599 cut-off events. For 193132/193132 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 69700 event pairs, 2317 based on Foata normal form. 12/7110 useless extension candidates. Maximal degree in co-relation 34413. Up to 6148 conditions per place. [2024-06-27 22:19:08,230 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 315 selfloop transitions, 50 changer transitions 0/373 dead transitions. [2024-06-27 22:19:08,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 373 transitions, 5916 flow [2024-06-27 22:19:08,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:19:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:19:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 188 transitions. [2024-06-27 22:19:08,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4351851851851852 [2024-06-27 22:19:08,232 INFO L175 Difference]: Start difference. First operand has 345 places, 339 transitions, 4953 flow. Second operand 12 states and 188 transitions. [2024-06-27 22:19:08,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 373 transitions, 5916 flow [2024-06-27 22:19:09,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 373 transitions, 5814 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 22:19:09,364 INFO L231 Difference]: Finished difference. Result has 347 places, 339 transitions, 4958 flow [2024-06-27 22:19:09,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4851, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4958, PETRI_PLACES=347, PETRI_TRANSITIONS=339} [2024-06-27 22:19:09,365 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 307 predicate places. [2024-06-27 22:19:09,365 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 339 transitions, 4958 flow [2024-06-27 22:19:09,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:09,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:09,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:09,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-27 22:19:09,365 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:19:09,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:09,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1918848109, now seen corresponding path program 14 times [2024-06-27 22:19:09,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:09,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33208846] [2024-06-27 22:19:09,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:09,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:11,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:11,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33208846] [2024-06-27 22:19:11,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33208846] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:11,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:11,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:19:11,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51123886] [2024-06-27 22:19:11,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:11,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:19:11,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:11,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:19:11,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:19:11,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:19:11,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 339 transitions, 4958 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:11,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:11,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:19:11,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:12,939 INFO L124 PetriNetUnfolderBase]: 3488/7622 cut-off events. [2024-06-27 22:19:12,939 INFO L125 PetriNetUnfolderBase]: For 133404/133404 co-relation queries the response was YES. [2024-06-27 22:19:13,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34900 conditions, 7622 events. 3488/7622 cut-off events. For 133404/133404 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 70009 event pairs, 2330 based on Foata normal form. 2/7121 useless extension candidates. Maximal degree in co-relation 34739. Up to 6301 conditions per place. [2024-06-27 22:19:13,043 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 311 selfloop transitions, 48 changer transitions 0/367 dead transitions. [2024-06-27 22:19:13,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 367 transitions, 5882 flow [2024-06-27 22:19:13,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:19:13,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:19:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 159 transitions. [2024-06-27 22:19:13,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2024-06-27 22:19:13,045 INFO L175 Difference]: Start difference. First operand has 347 places, 339 transitions, 4958 flow. Second operand 10 states and 159 transitions. [2024-06-27 22:19:13,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 367 transitions, 5882 flow [2024-06-27 22:19:14,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 367 transitions, 5787 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 22:19:14,461 INFO L231 Difference]: Finished difference. Result has 347 places, 341 transitions, 5033 flow [2024-06-27 22:19:14,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4863, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5033, PETRI_PLACES=347, PETRI_TRANSITIONS=341} [2024-06-27 22:19:14,462 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 307 predicate places. [2024-06-27 22:19:14,462 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 341 transitions, 5033 flow [2024-06-27 22:19:14,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:14,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:14,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:14,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-27 22:19:14,462 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:19:14,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:14,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1254264489, now seen corresponding path program 1 times [2024-06-27 22:19:14,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:14,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580469744] [2024-06-27 22:19:14,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:14,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:15,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:15,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580469744] [2024-06-27 22:19:15,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580469744] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:15,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:15,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:19:15,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153055010] [2024-06-27 22:19:15,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:15,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:19:15,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:15,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:19:15,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:19:16,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:19:16,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 341 transitions, 5033 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:16,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:16,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:19:16,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:17,893 INFO L124 PetriNetUnfolderBase]: 3484/7618 cut-off events. [2024-06-27 22:19:17,894 INFO L125 PetriNetUnfolderBase]: For 122123/122123 co-relation queries the response was YES. [2024-06-27 22:19:17,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34695 conditions, 7618 events. 3484/7618 cut-off events. For 122123/122123 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 70005 event pairs, 2344 based on Foata normal form. 2/7115 useless extension candidates. Maximal degree in co-relation 34533. Up to 6414 conditions per place. [2024-06-27 22:19:17,992 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 315 selfloop transitions, 39 changer transitions 0/362 dead transitions. [2024-06-27 22:19:17,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 362 transitions, 5841 flow [2024-06-27 22:19:17,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:19:17,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:19:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 171 transitions. [2024-06-27 22:19:17,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-27 22:19:17,994 INFO L175 Difference]: Start difference. First operand has 347 places, 341 transitions, 5033 flow. Second operand 12 states and 171 transitions. [2024-06-27 22:19:17,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 362 transitions, 5841 flow [2024-06-27 22:19:19,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 362 transitions, 5692 flow, removed 47 selfloop flow, removed 6 redundant places. [2024-06-27 22:19:19,071 INFO L231 Difference]: Finished difference. Result has 353 places, 341 transitions, 4977 flow [2024-06-27 22:19:19,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4884, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4977, PETRI_PLACES=353, PETRI_TRANSITIONS=341} [2024-06-27 22:19:19,071 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 313 predicate places. [2024-06-27 22:19:19,071 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 341 transitions, 4977 flow [2024-06-27 22:19:19,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:19,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:19,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:19,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-27 22:19:19,072 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:19:19,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:19,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1254264241, now seen corresponding path program 15 times [2024-06-27 22:19:19,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:19,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612554391] [2024-06-27 22:19:19,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:19,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:20,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:20,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612554391] [2024-06-27 22:19:20,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612554391] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:20,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:20,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:19:20,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932626692] [2024-06-27 22:19:20,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:20,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:19:20,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:20,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:19:20,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:19:20,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:19:20,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 341 transitions, 4977 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:20,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:20,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:19:20,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:22,416 INFO L124 PetriNetUnfolderBase]: 3501/7658 cut-off events. [2024-06-27 22:19:22,417 INFO L125 PetriNetUnfolderBase]: For 121340/121340 co-relation queries the response was YES. [2024-06-27 22:19:22,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34732 conditions, 7658 events. 3501/7658 cut-off events. For 121340/121340 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 70431 event pairs, 2361 based on Foata normal form. 2/7154 useless extension candidates. Maximal degree in co-relation 34568. Up to 6440 conditions per place. [2024-06-27 22:19:22,522 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 323 selfloop transitions, 33 changer transitions 0/364 dead transitions. [2024-06-27 22:19:22,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 364 transitions, 5831 flow [2024-06-27 22:19:22,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:19:22,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:19:22,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 152 transitions. [2024-06-27 22:19:22,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-27 22:19:22,523 INFO L175 Difference]: Start difference. First operand has 353 places, 341 transitions, 4977 flow. Second operand 10 states and 152 transitions. [2024-06-27 22:19:22,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 364 transitions, 5831 flow [2024-06-27 22:19:23,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 364 transitions, 5721 flow, removed 8 selfloop flow, removed 11 redundant places. [2024-06-27 22:19:23,585 INFO L231 Difference]: Finished difference. Result has 352 places, 342 transitions, 4978 flow [2024-06-27 22:19:23,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4867, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4978, PETRI_PLACES=352, PETRI_TRANSITIONS=342} [2024-06-27 22:19:23,585 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 312 predicate places. [2024-06-27 22:19:23,585 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 342 transitions, 4978 flow [2024-06-27 22:19:23,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:23,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:23,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:23,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-27 22:19:23,586 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:19:23,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:23,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1308305077, now seen corresponding path program 16 times [2024-06-27 22:19:23,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:23,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852401229] [2024-06-27 22:19:23,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:23,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:24,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:24,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852401229] [2024-06-27 22:19:24,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852401229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:24,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:24,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:19:24,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436082864] [2024-06-27 22:19:24,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:24,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:19:24,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:24,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:19:24,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:19:24,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:19:24,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 342 transitions, 4978 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:24,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:24,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:19:24,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:26,730 INFO L124 PetriNetUnfolderBase]: 3518/7694 cut-off events. [2024-06-27 22:19:26,731 INFO L125 PetriNetUnfolderBase]: For 124646/124646 co-relation queries the response was YES. [2024-06-27 22:19:26,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35032 conditions, 7694 events. 3518/7694 cut-off events. For 124646/124646 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 70721 event pairs, 2348 based on Foata normal form. 2/7227 useless extension candidates. Maximal degree in co-relation 34867. Up to 6465 conditions per place. [2024-06-27 22:19:26,838 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 344 selfloop transitions, 17 changer transitions 0/369 dead transitions. [2024-06-27 22:19:26,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 369 transitions, 5852 flow [2024-06-27 22:19:26,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:19:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:19:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 164 transitions. [2024-06-27 22:19:26,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-27 22:19:26,839 INFO L175 Difference]: Start difference. First operand has 352 places, 342 transitions, 4978 flow. Second operand 11 states and 164 transitions. [2024-06-27 22:19:26,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 369 transitions, 5852 flow [2024-06-27 22:19:27,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 369 transitions, 5765 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-27 22:19:27,989 INFO L231 Difference]: Finished difference. Result has 355 places, 343 transitions, 4969 flow [2024-06-27 22:19:27,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4891, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4969, PETRI_PLACES=355, PETRI_TRANSITIONS=343} [2024-06-27 22:19:27,990 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 315 predicate places. [2024-06-27 22:19:27,990 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 343 transitions, 4969 flow [2024-06-27 22:19:27,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:27,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:27,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:27,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-27 22:19:27,991 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:19:27,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:27,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2139303857, now seen corresponding path program 17 times [2024-06-27 22:19:27,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:27,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049999925] [2024-06-27 22:19:27,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:27,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:29,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:29,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:29,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049999925] [2024-06-27 22:19:29,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049999925] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:29,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:29,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:19:29,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166722623] [2024-06-27 22:19:29,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:29,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:19:29,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:29,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:19:29,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:19:29,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:19:29,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 343 transitions, 4969 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:29,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:29,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:19:29,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:31,641 INFO L124 PetriNetUnfolderBase]: 3519/7690 cut-off events. [2024-06-27 22:19:31,642 INFO L125 PetriNetUnfolderBase]: For 111078/111078 co-relation queries the response was YES. [2024-06-27 22:19:31,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34681 conditions, 7690 events. 3519/7690 cut-off events. For 111078/111078 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 70768 event pairs, 2362 based on Foata normal form. 2/7186 useless extension candidates. Maximal degree in co-relation 34515. Up to 6385 conditions per place. [2024-06-27 22:19:31,753 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 331 selfloop transitions, 34 changer transitions 0/373 dead transitions. [2024-06-27 22:19:31,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 373 transitions, 5877 flow [2024-06-27 22:19:31,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:19:31,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:19:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 191 transitions. [2024-06-27 22:19:31,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4081196581196581 [2024-06-27 22:19:31,755 INFO L175 Difference]: Start difference. First operand has 355 places, 343 transitions, 4969 flow. Second operand 13 states and 191 transitions. [2024-06-27 22:19:31,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 373 transitions, 5877 flow [2024-06-27 22:19:33,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 373 transitions, 5817 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-27 22:19:33,096 INFO L231 Difference]: Finished difference. Result has 359 places, 344 transitions, 5024 flow [2024-06-27 22:19:33,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4909, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5024, PETRI_PLACES=359, PETRI_TRANSITIONS=344} [2024-06-27 22:19:33,097 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 319 predicate places. [2024-06-27 22:19:33,097 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 344 transitions, 5024 flow [2024-06-27 22:19:33,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:33,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:33,097 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-27 22:19:33,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-27 22:19:33,097 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:19:33,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:33,098 INFO L85 PathProgramCache]: Analyzing trace with hash -295336547, now seen corresponding path program 1 times [2024-06-27 22:19:33,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:33,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345677141] [2024-06-27 22:19:33,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:33,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:35,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-27 22:19:35,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:35,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345677141] [2024-06-27 22:19:35,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345677141] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:35,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:35,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:19:35,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941997376] [2024-06-27 22:19:35,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:35,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:19:35,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:35,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:19:35,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:19:35,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:19:35,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 344 transitions, 5024 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:35,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:35,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:19:35,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:36,850 INFO L124 PetriNetUnfolderBase]: 3130/7272 cut-off events. [2024-06-27 22:19:36,850 INFO L125 PetriNetUnfolderBase]: For 136722/136782 co-relation queries the response was YES. [2024-06-27 22:19:36,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32288 conditions, 7272 events. 3130/7272 cut-off events. For 136722/136782 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 70403 event pairs, 1684 based on Foata normal form. 14/6730 useless extension candidates. Maximal degree in co-relation 32121. Up to 5468 conditions per place. [2024-06-27 22:19:36,948 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 206 selfloop transitions, 150 changer transitions 0/368 dead transitions. [2024-06-27 22:19:36,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 368 transitions, 5853 flow [2024-06-27 22:19:36,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:19:36,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:19:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-06-27 22:19:36,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-06-27 22:19:36,949 INFO L175 Difference]: Start difference. First operand has 359 places, 344 transitions, 5024 flow. Second operand 10 states and 170 transitions. [2024-06-27 22:19:36,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 368 transitions, 5853 flow [2024-06-27 22:19:37,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 368 transitions, 5751 flow, removed 18 selfloop flow, removed 10 redundant places. [2024-06-27 22:19:37,943 INFO L231 Difference]: Finished difference. Result has 360 places, 345 transitions, 5264 flow [2024-06-27 22:19:37,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4922, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5264, PETRI_PLACES=360, PETRI_TRANSITIONS=345} [2024-06-27 22:19:37,944 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 320 predicate places. [2024-06-27 22:19:37,944 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 345 transitions, 5264 flow [2024-06-27 22:19:37,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:37,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:37,944 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-27 22:19:37,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-27 22:19:37,945 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:19:37,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:37,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2048039063, now seen corresponding path program 2 times [2024-06-27 22:19:37,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:37,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822313679] [2024-06-27 22:19:37,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:37,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:40,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:40,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822313679] [2024-06-27 22:19:40,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822313679] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:40,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:40,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:19:40,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477532310] [2024-06-27 22:19:40,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:40,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:19:40,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:40,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:19:40,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:19:40,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:19:40,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 345 transitions, 5264 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:40,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:40,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:19:40,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:42,045 INFO L124 PetriNetUnfolderBase]: 3138/7287 cut-off events. [2024-06-27 22:19:42,046 INFO L125 PetriNetUnfolderBase]: For 137563/137616 co-relation queries the response was YES. [2024-06-27 22:19:42,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32481 conditions, 7287 events. 3138/7287 cut-off events. For 137563/137616 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 70543 event pairs, 1747 based on Foata normal form. 7/6726 useless extension candidates. Maximal degree in co-relation 32312. Up to 5358 conditions per place. [2024-06-27 22:19:42,155 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 206 selfloop transitions, 160 changer transitions 0/378 dead transitions. [2024-06-27 22:19:42,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 378 transitions, 6172 flow [2024-06-27 22:19:42,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:19:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:19:42,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 191 transitions. [2024-06-27 22:19:42,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4823232323232323 [2024-06-27 22:19:42,156 INFO L175 Difference]: Start difference. First operand has 360 places, 345 transitions, 5264 flow. Second operand 11 states and 191 transitions. [2024-06-27 22:19:42,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 378 transitions, 6172 flow [2024-06-27 22:19:43,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 378 transitions, 5887 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-27 22:19:43,344 INFO L231 Difference]: Finished difference. Result has 364 places, 345 transitions, 5304 flow [2024-06-27 22:19:43,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4979, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5304, PETRI_PLACES=364, PETRI_TRANSITIONS=345} [2024-06-27 22:19:43,344 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 324 predicate places. [2024-06-27 22:19:43,344 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 345 transitions, 5304 flow [2024-06-27 22:19:43,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:43,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:43,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:43,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-27 22:19:43,345 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:19:43,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1150691047, now seen corresponding path program 3 times [2024-06-27 22:19:43,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:43,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901801224] [2024-06-27 22:19:43,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:43,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:45,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:45,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:45,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901801224] [2024-06-27 22:19:45,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901801224] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:45,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:45,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:19:45,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477940453] [2024-06-27 22:19:45,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:45,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:19:45,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:45,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:19:45,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:19:45,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:19:45,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 345 transitions, 5304 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:45,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:45,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:19:45,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:47,502 INFO L124 PetriNetUnfolderBase]: 3204/7445 cut-off events. [2024-06-27 22:19:47,502 INFO L125 PetriNetUnfolderBase]: For 140194/140249 co-relation queries the response was YES. [2024-06-27 22:19:47,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33142 conditions, 7445 events. 3204/7445 cut-off events. For 140194/140249 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 72449 event pairs, 1771 based on Foata normal form. 9/6880 useless extension candidates. Maximal degree in co-relation 32972. Up to 5467 conditions per place. [2024-06-27 22:19:47,615 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 213 selfloop transitions, 156 changer transitions 0/381 dead transitions. [2024-06-27 22:19:47,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 381 transitions, 6220 flow [2024-06-27 22:19:47,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-27 22:19:47,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-27 22:19:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 242 transitions. [2024-06-27 22:19:47,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44814814814814813 [2024-06-27 22:19:47,617 INFO L175 Difference]: Start difference. First operand has 364 places, 345 transitions, 5304 flow. Second operand 15 states and 242 transitions. [2024-06-27 22:19:47,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 381 transitions, 6220 flow [2024-06-27 22:19:48,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 381 transitions, 5903 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:19:48,751 INFO L231 Difference]: Finished difference. Result has 370 places, 345 transitions, 5306 flow [2024-06-27 22:19:48,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4987, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5306, PETRI_PLACES=370, PETRI_TRANSITIONS=345} [2024-06-27 22:19:48,752 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 330 predicate places. [2024-06-27 22:19:48,752 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 345 transitions, 5306 flow [2024-06-27 22:19:48,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:48,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:48,752 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-27 22:19:48,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-27 22:19:48,752 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:19:48,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:48,753 INFO L85 PathProgramCache]: Analyzing trace with hash 362584121, now seen corresponding path program 4 times [2024-06-27 22:19:48,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:48,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624519444] [2024-06-27 22:19:48,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:48,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:51,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:51,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624519444] [2024-06-27 22:19:51,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624519444] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:51,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:51,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-27 22:19:51,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093981052] [2024-06-27 22:19:51,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:51,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 22:19:51,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:51,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 22:19:51,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-27 22:19:51,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:19:51,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 345 transitions, 5306 flow. Second operand has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:51,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:51,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:19:51,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:53,477 INFO L124 PetriNetUnfolderBase]: 3243/7514 cut-off events. [2024-06-27 22:19:53,478 INFO L125 PetriNetUnfolderBase]: For 141817/141870 co-relation queries the response was YES. [2024-06-27 22:19:53,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33473 conditions, 7514 events. 3243/7514 cut-off events. For 141817/141870 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 73121 event pairs, 1797 based on Foata normal form. 9/6952 useless extension candidates. Maximal degree in co-relation 33302. Up to 5589 conditions per place. [2024-06-27 22:19:53,570 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 219 selfloop transitions, 146 changer transitions 0/377 dead transitions. [2024-06-27 22:19:53,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 377 transitions, 6200 flow [2024-06-27 22:19:53,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:19:53,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:19:53,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 203 transitions. [2024-06-27 22:19:53,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4699074074074074 [2024-06-27 22:19:53,572 INFO L175 Difference]: Start difference. First operand has 370 places, 345 transitions, 5306 flow. Second operand 12 states and 203 transitions. [2024-06-27 22:19:53,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 377 transitions, 6200 flow [2024-06-27 22:19:54,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 377 transitions, 5885 flow, removed 3 selfloop flow, removed 13 redundant places. [2024-06-27 22:19:54,501 INFO L231 Difference]: Finished difference. Result has 369 places, 345 transitions, 5288 flow [2024-06-27 22:19:54,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4991, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5288, PETRI_PLACES=369, PETRI_TRANSITIONS=345} [2024-06-27 22:19:54,501 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 329 predicate places. [2024-06-27 22:19:54,501 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 345 transitions, 5288 flow [2024-06-27 22:19:54,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:54,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:54,502 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-27 22:19:54,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-27 22:19:54,502 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:19:54,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:54,502 INFO L85 PathProgramCache]: Analyzing trace with hash -514404091, now seen corresponding path program 5 times [2024-06-27 22:19:54,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:54,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340430338] [2024-06-27 22:19:54,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:54,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:19:56,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:19:56,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:19:56,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340430338] [2024-06-27 22:19:56,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340430338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:19:56,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:19:56,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:19:56,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645204866] [2024-06-27 22:19:56,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:19:56,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:19:56,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:19:56,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:19:56,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:19:56,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-27 22:19:56,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 345 transitions, 5288 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:56,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:19:56,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-27 22:19:56,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:19:58,686 INFO L124 PetriNetUnfolderBase]: 3274/7675 cut-off events. [2024-06-27 22:19:58,687 INFO L125 PetriNetUnfolderBase]: For 144305/144358 co-relation queries the response was YES. [2024-06-27 22:19:58,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33751 conditions, 7675 events. 3274/7675 cut-off events. For 144305/144358 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 75309 event pairs, 1809 based on Foata normal form. 9/7100 useless extension candidates. Maximal degree in co-relation 33580. Up to 4766 conditions per place. [2024-06-27 22:19:58,797 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 211 selfloop transitions, 159 changer transitions 0/382 dead transitions. [2024-06-27 22:19:58,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 382 transitions, 6210 flow [2024-06-27 22:19:58,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 22:19:58,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 22:19:58,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 231 transitions. [2024-06-27 22:19:58,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-27 22:19:58,799 INFO L175 Difference]: Start difference. First operand has 369 places, 345 transitions, 5288 flow. Second operand 14 states and 231 transitions. [2024-06-27 22:19:58,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 382 transitions, 6210 flow [2024-06-27 22:19:59,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 382 transitions, 5921 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 22:19:59,869 INFO L231 Difference]: Finished difference. Result has 373 places, 345 transitions, 5322 flow [2024-06-27 22:19:59,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4999, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5322, PETRI_PLACES=373, PETRI_TRANSITIONS=345} [2024-06-27 22:19:59,869 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 333 predicate places. [2024-06-27 22:19:59,869 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 345 transitions, 5322 flow [2024-06-27 22:19:59,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:19:59,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:19:59,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:19:59,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-27 22:19:59,870 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:19:59,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:19:59,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1881172397, now seen corresponding path program 6 times [2024-06-27 22:19:59,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:19:59,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138663485] [2024-06-27 22:19:59,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:19:59,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:19:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:01,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:01,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:01,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138663485] [2024-06-27 22:20:01,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138663485] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:01,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:01,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-27 22:20:01,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630425850] [2024-06-27 22:20:01,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:01,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 22:20:01,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:01,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 22:20:01,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-06-27 22:20:01,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:20:01,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 345 transitions, 5322 flow. Second operand has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:01,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:01,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:20:01,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:04,408 INFO L124 PetriNetUnfolderBase]: 3745/8202 cut-off events. [2024-06-27 22:20:04,408 INFO L125 PetriNetUnfolderBase]: For 149338/149338 co-relation queries the response was YES. [2024-06-27 22:20:04,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36731 conditions, 8202 events. 3745/8202 cut-off events. For 149338/149338 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 76706 event pairs, 2605 based on Foata normal form. 6/7687 useless extension candidates. Maximal degree in co-relation 36559. Up to 6822 conditions per place. [2024-06-27 22:20:04,511 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 322 selfloop transitions, 53 changer transitions 0/383 dead transitions. [2024-06-27 22:20:04,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 383 transitions, 6312 flow [2024-06-27 22:20:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 22:20:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 22:20:04,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 209 transitions. [2024-06-27 22:20:04,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146825396825397 [2024-06-27 22:20:04,513 INFO L175 Difference]: Start difference. First operand has 373 places, 345 transitions, 5322 flow. Second operand 14 states and 209 transitions. [2024-06-27 22:20:04,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 383 transitions, 6312 flow [2024-06-27 22:20:05,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 383 transitions, 5997 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-06-27 22:20:05,547 INFO L231 Difference]: Finished difference. Result has 375 places, 345 transitions, 5116 flow [2024-06-27 22:20:05,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5007, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5116, PETRI_PLACES=375, PETRI_TRANSITIONS=345} [2024-06-27 22:20:05,547 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 335 predicate places. [2024-06-27 22:20:05,547 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 345 transitions, 5116 flow [2024-06-27 22:20:05,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:05,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:05,548 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-27 22:20:05,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-27 22:20:05,548 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:20:05,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:05,549 INFO L85 PathProgramCache]: Analyzing trace with hash -449817065, now seen corresponding path program 7 times [2024-06-27 22:20:05,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:05,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642820517] [2024-06-27 22:20:05,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:05,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:07,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:07,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:07,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642820517] [2024-06-27 22:20:07,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642820517] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:07,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:07,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-27 22:20:07,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22456795] [2024-06-27 22:20:07,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:07,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 22:20:07,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:07,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 22:20:07,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-06-27 22:20:07,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:20:07,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 345 transitions, 5116 flow. Second operand has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:07,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:07,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:20:07,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:09,920 INFO L124 PetriNetUnfolderBase]: 3782/8289 cut-off events. [2024-06-27 22:20:09,920 INFO L125 PetriNetUnfolderBase]: For 150460/150460 co-relation queries the response was YES. [2024-06-27 22:20:10,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36670 conditions, 8289 events. 3782/8289 cut-off events. For 150460/150460 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 77748 event pairs, 2611 based on Foata normal form. 6/7772 useless extension candidates. Maximal degree in co-relation 36497. Up to 6822 conditions per place. [2024-06-27 22:20:10,059 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 322 selfloop transitions, 56 changer transitions 0/386 dead transitions. [2024-06-27 22:20:10,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 386 transitions, 6121 flow [2024-06-27 22:20:10,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 22:20:10,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 22:20:10,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 212 transitions. [2024-06-27 22:20:10,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2024-06-27 22:20:10,061 INFO L175 Difference]: Start difference. First operand has 375 places, 345 transitions, 5116 flow. Second operand 14 states and 212 transitions. [2024-06-27 22:20:10,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 386 transitions, 6121 flow [2024-06-27 22:20:11,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 386 transitions, 6016 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-06-27 22:20:11,390 INFO L231 Difference]: Finished difference. Result has 377 places, 345 transitions, 5126 flow [2024-06-27 22:20:11,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5011, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5126, PETRI_PLACES=377, PETRI_TRANSITIONS=345} [2024-06-27 22:20:11,391 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 337 predicate places. [2024-06-27 22:20:11,391 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 345 transitions, 5126 flow [2024-06-27 22:20:11,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:11,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:11,391 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-27 22:20:11,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-27 22:20:11,392 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:20:11,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:11,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1959338825, now seen corresponding path program 8 times [2024-06-27 22:20:11,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:11,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417002856] [2024-06-27 22:20:11,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:11,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:13,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:13,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417002856] [2024-06-27 22:20:13,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417002856] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:13,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:13,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:20:13,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641675416] [2024-06-27 22:20:13,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:13,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:20:13,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:13,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:20:13,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:20:13,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:20:13,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 345 transitions, 5126 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:13,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:13,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:20:13,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:15,857 INFO L124 PetriNetUnfolderBase]: 3819/8379 cut-off events. [2024-06-27 22:20:15,858 INFO L125 PetriNetUnfolderBase]: For 152069/152069 co-relation queries the response was YES. [2024-06-27 22:20:15,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37015 conditions, 8379 events. 3819/8379 cut-off events. For 152069/152069 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 78753 event pairs, 2686 based on Foata normal form. 6/7855 useless extension candidates. Maximal degree in co-relation 36841. Up to 6980 conditions per place. [2024-06-27 22:20:15,965 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 322 selfloop transitions, 51 changer transitions 0/381 dead transitions. [2024-06-27 22:20:15,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 381 transitions, 6108 flow [2024-06-27 22:20:15,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:20:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:20:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 185 transitions. [2024-06-27 22:20:15,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42824074074074076 [2024-06-27 22:20:15,966 INFO L175 Difference]: Start difference. First operand has 377 places, 345 transitions, 5126 flow. Second operand 12 states and 185 transitions. [2024-06-27 22:20:15,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 381 transitions, 6108 flow [2024-06-27 22:20:17,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 381 transitions, 5997 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-06-27 22:20:17,181 INFO L231 Difference]: Finished difference. Result has 377 places, 345 transitions, 5120 flow [2024-06-27 22:20:17,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5015, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5120, PETRI_PLACES=377, PETRI_TRANSITIONS=345} [2024-06-27 22:20:17,181 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 337 predicate places. [2024-06-27 22:20:17,182 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 345 transitions, 5120 flow [2024-06-27 22:20:17,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:17,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:17,182 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-27 22:20:17,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-06-27 22:20:17,182 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:20:17,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:17,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1893910999, now seen corresponding path program 9 times [2024-06-27 22:20:17,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:17,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799438256] [2024-06-27 22:20:17,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:17,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:19,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-27 22:20:19,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:19,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799438256] [2024-06-27 22:20:19,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799438256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:19,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:19,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:20:19,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008037547] [2024-06-27 22:20:19,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:19,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:20:19,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:19,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:20:19,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:20:19,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:20:19,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 345 transitions, 5120 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:19,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:19,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:20:19,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:21,404 INFO L124 PetriNetUnfolderBase]: 3856/8427 cut-off events. [2024-06-27 22:20:21,405 INFO L125 PetriNetUnfolderBase]: For 153719/153719 co-relation queries the response was YES. [2024-06-27 22:20:21,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37224 conditions, 8427 events. 3856/8427 cut-off events. For 153719/153719 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 79255 event pairs, 2721 based on Foata normal form. 6/7909 useless extension candidates. Maximal degree in co-relation 37049. Up to 7011 conditions per place. [2024-06-27 22:20:21,538 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 339 selfloop transitions, 31 changer transitions 0/378 dead transitions. [2024-06-27 22:20:21,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 378 transitions, 6019 flow [2024-06-27 22:20:21,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:20:21,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:20:21,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 182 transitions. [2024-06-27 22:20:21,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212962962962963 [2024-06-27 22:20:21,540 INFO L175 Difference]: Start difference. First operand has 377 places, 345 transitions, 5120 flow. Second operand 12 states and 182 transitions. [2024-06-27 22:20:21,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 378 transitions, 6019 flow [2024-06-27 22:20:22,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 378 transitions, 5918 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 22:20:22,883 INFO L231 Difference]: Finished difference. Result has 379 places, 345 transitions, 5084 flow [2024-06-27 22:20:22,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5019, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5084, PETRI_PLACES=379, PETRI_TRANSITIONS=345} [2024-06-27 22:20:22,883 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 339 predicate places. [2024-06-27 22:20:22,883 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 345 transitions, 5084 flow [2024-06-27 22:20:22,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:22,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:22,884 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-27 22:20:22,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-06-27 22:20:22,884 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:20:22,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:22,884 INFO L85 PathProgramCache]: Analyzing trace with hash -645249893, now seen corresponding path program 10 times [2024-06-27 22:20:22,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:22,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533571664] [2024-06-27 22:20:22,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:22,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:24,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:24,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533571664] [2024-06-27 22:20:24,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533571664] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:24,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:24,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:20:24,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997184643] [2024-06-27 22:20:24,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:24,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:20:24,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:24,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:20:24,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:20:24,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:20:24,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 345 transitions, 5084 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:24,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:24,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:20:24,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:26,884 INFO L124 PetriNetUnfolderBase]: 3893/8519 cut-off events. [2024-06-27 22:20:26,884 INFO L125 PetriNetUnfolderBase]: For 156264/156264 co-relation queries the response was YES. [2024-06-27 22:20:26,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37510 conditions, 8519 events. 3893/8519 cut-off events. For 156264/156264 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 80400 event pairs, 2745 based on Foata normal form. 6/7994 useless extension candidates. Maximal degree in co-relation 37334. Up to 7065 conditions per place. [2024-06-27 22:20:27,008 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 323 selfloop transitions, 48 changer transitions 0/379 dead transitions. [2024-06-27 22:20:27,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 379 transitions, 6006 flow [2024-06-27 22:20:27,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:20:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:20:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 185 transitions. [2024-06-27 22:20:27,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42824074074074076 [2024-06-27 22:20:27,011 INFO L175 Difference]: Start difference. First operand has 379 places, 345 transitions, 5084 flow. Second operand 12 states and 185 transitions. [2024-06-27 22:20:27,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 379 transitions, 6006 flow [2024-06-27 22:20:28,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 379 transitions, 5945 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 22:20:28,326 INFO L231 Difference]: Finished difference. Result has 381 places, 345 transitions, 5122 flow [2024-06-27 22:20:28,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5023, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5122, PETRI_PLACES=381, PETRI_TRANSITIONS=345} [2024-06-27 22:20:28,326 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 341 predicate places. [2024-06-27 22:20:28,326 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 345 transitions, 5122 flow [2024-06-27 22:20:28,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:28,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:28,327 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-27 22:20:28,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-06-27 22:20:28,327 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:20:28,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:28,327 INFO L85 PathProgramCache]: Analyzing trace with hash -846598613, now seen corresponding path program 11 times [2024-06-27 22:20:28,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:28,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303342301] [2024-06-27 22:20:28,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:28,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:30,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-27 22:20:30,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:30,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303342301] [2024-06-27 22:20:30,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303342301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:30,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:30,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-27 22:20:30,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009070346] [2024-06-27 22:20:30,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:30,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 22:20:30,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:30,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 22:20:30,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-06-27 22:20:30,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:20:30,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 345 transitions, 5122 flow. Second operand has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:30,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:30,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:20:30,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:32,591 INFO L124 PetriNetUnfolderBase]: 3930/8595 cut-off events. [2024-06-27 22:20:32,591 INFO L125 PetriNetUnfolderBase]: For 158065/158065 co-relation queries the response was YES. [2024-06-27 22:20:32,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37839 conditions, 8595 events. 3930/8595 cut-off events. For 158065/158065 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 81189 event pairs, 2803 based on Foata normal form. 6/8070 useless extension candidates. Maximal degree in co-relation 37662. Up to 7223 conditions per place. [2024-06-27 22:20:32,703 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 319 selfloop transitions, 51 changer transitions 0/378 dead transitions. [2024-06-27 22:20:32,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 378 transitions, 6055 flow [2024-06-27 22:20:32,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:20:32,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:20:32,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 181 transitions. [2024-06-27 22:20:32,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41898148148148145 [2024-06-27 22:20:32,705 INFO L175 Difference]: Start difference. First operand has 381 places, 345 transitions, 5122 flow. Second operand 12 states and 181 transitions. [2024-06-27 22:20:32,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 378 transitions, 6055 flow [2024-06-27 22:20:34,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 378 transitions, 5960 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 22:20:34,133 INFO L231 Difference]: Finished difference. Result has 383 places, 345 transitions, 5132 flow [2024-06-27 22:20:34,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5027, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5132, PETRI_PLACES=383, PETRI_TRANSITIONS=345} [2024-06-27 22:20:34,134 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 343 predicate places. [2024-06-27 22:20:34,134 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 345 transitions, 5132 flow [2024-06-27 22:20:34,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:34,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:34,134 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-27 22:20:34,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-06-27 22:20:34,134 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:20:34,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:34,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1886501689, now seen corresponding path program 12 times [2024-06-27 22:20:34,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:34,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042500575] [2024-06-27 22:20:34,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:34,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:36,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-27 22:20:36,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:36,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042500575] [2024-06-27 22:20:36,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042500575] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:36,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:36,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-27 22:20:36,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155508844] [2024-06-27 22:20:36,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:36,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 22:20:36,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:36,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 22:20:36,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-06-27 22:20:36,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:20:36,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 345 transitions, 5132 flow. Second operand has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:36,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:36,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:20:36,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:38,311 INFO L124 PetriNetUnfolderBase]: 3984/8730 cut-off events. [2024-06-27 22:20:38,312 INFO L125 PetriNetUnfolderBase]: For 159996/159996 co-relation queries the response was YES. [2024-06-27 22:20:38,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38278 conditions, 8730 events. 3984/8730 cut-off events. For 159996/159996 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 82766 event pairs, 2858 based on Foata normal form. 6/8193 useless extension candidates. Maximal degree in co-relation 38100. Up to 7387 conditions per place. [2024-06-27 22:20:38,438 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 338 selfloop transitions, 28 changer transitions 0/374 dead transitions. [2024-06-27 22:20:38,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 374 transitions, 6012 flow [2024-06-27 22:20:38,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:20:38,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:20:38,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 177 transitions. [2024-06-27 22:20:38,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-27 22:20:38,439 INFO L175 Difference]: Start difference. First operand has 383 places, 345 transitions, 5132 flow. Second operand 12 states and 177 transitions. [2024-06-27 22:20:38,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 374 transitions, 6012 flow [2024-06-27 22:20:39,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 374 transitions, 5911 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 22:20:39,814 INFO L231 Difference]: Finished difference. Result has 386 places, 346 transitions, 5108 flow [2024-06-27 22:20:39,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5031, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5108, PETRI_PLACES=386, PETRI_TRANSITIONS=346} [2024-06-27 22:20:39,814 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 346 predicate places. [2024-06-27 22:20:39,814 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 346 transitions, 5108 flow [2024-06-27 22:20:39,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:39,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:39,815 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-27 22:20:39,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2024-06-27 22:20:39,815 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:20:39,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:39,815 INFO L85 PathProgramCache]: Analyzing trace with hash -952615529, now seen corresponding path program 13 times [2024-06-27 22:20:39,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:39,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143468420] [2024-06-27 22:20:39,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:39,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:41,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:41,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:41,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143468420] [2024-06-27 22:20:41,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143468420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:41,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:41,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:20:41,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726555068] [2024-06-27 22:20:41,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:41,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:20:41,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:41,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:20:41,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:20:41,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:20:41,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 346 transitions, 5108 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-27 22:20:41,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:41,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:20:41,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:43,705 INFO L124 PetriNetUnfolderBase]: 4021/8815 cut-off events. [2024-06-27 22:20:43,705 INFO L125 PetriNetUnfolderBase]: For 161629/161629 co-relation queries the response was YES. [2024-06-27 22:20:43,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38543 conditions, 8815 events. 4021/8815 cut-off events. For 161629/161629 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 83721 event pairs, 2855 based on Foata normal form. 6/8318 useless extension candidates. Maximal degree in co-relation 38363. Up to 7435 conditions per place. [2024-06-27 22:20:43,835 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 355 selfloop transitions, 22 changer transitions 0/385 dead transitions. [2024-06-27 22:20:43,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 385 transitions, 6048 flow [2024-06-27 22:20:43,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:20:43,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:20:43,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 193 transitions. [2024-06-27 22:20:43,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41239316239316237 [2024-06-27 22:20:43,837 INFO L175 Difference]: Start difference. First operand has 386 places, 346 transitions, 5108 flow. Second operand 13 states and 193 transitions. [2024-06-27 22:20:43,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 385 transitions, 6048 flow [2024-06-27 22:20:45,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 385 transitions, 5981 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:20:45,296 INFO L231 Difference]: Finished difference. Result has 392 places, 350 transitions, 5151 flow [2024-06-27 22:20:45,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5041, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5151, PETRI_PLACES=392, PETRI_TRANSITIONS=350} [2024-06-27 22:20:45,296 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 352 predicate places. [2024-06-27 22:20:45,296 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 350 transitions, 5151 flow [2024-06-27 22:20:45,296 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-27 22:20:45,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:45,297 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-27 22:20:45,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2024-06-27 22:20:45,297 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:20:45,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:45,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1294287516, now seen corresponding path program 1 times [2024-06-27 22:20:45,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:45,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533663017] [2024-06-27 22:20:45,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:45,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:47,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:47,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:47,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533663017] [2024-06-27 22:20:47,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533663017] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:47,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:47,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:20:47,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877678407] [2024-06-27 22:20:47,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:47,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:20:47,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:47,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:20:47,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:20:47,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:20:47,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 350 transitions, 5151 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-27 22:20:47,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:47,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:20:47,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:49,341 INFO L124 PetriNetUnfolderBase]: 4075/8959 cut-off events. [2024-06-27 22:20:49,341 INFO L125 PetriNetUnfolderBase]: For 186995/186995 co-relation queries the response was YES. [2024-06-27 22:20:49,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39995 conditions, 8959 events. 4075/8959 cut-off events. For 186995/186995 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 85586 event pairs, 2941 based on Foata normal form. 8/8416 useless extension candidates. Maximal degree in co-relation 39812. Up to 7408 conditions per place. [2024-06-27 22:20:49,485 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 344 selfloop transitions, 29 changer transitions 0/381 dead transitions. [2024-06-27 22:20:49,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 381 transitions, 6069 flow [2024-06-27 22:20:49,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:20:49,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:20:49,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 181 transitions. [2024-06-27 22:20:49,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41898148148148145 [2024-06-27 22:20:49,486 INFO L175 Difference]: Start difference. First operand has 392 places, 350 transitions, 5151 flow. Second operand 12 states and 181 transitions. [2024-06-27 22:20:49,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 381 transitions, 6069 flow [2024-06-27 22:20:51,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 381 transitions, 5818 flow, removed 49 selfloop flow, removed 13 redundant places. [2024-06-27 22:20:51,109 INFO L231 Difference]: Finished difference. Result has 391 places, 350 transitions, 4964 flow [2024-06-27 22:20:51,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4900, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4964, PETRI_PLACES=391, PETRI_TRANSITIONS=350} [2024-06-27 22:20:51,110 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 351 predicate places. [2024-06-27 22:20:51,110 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 350 transitions, 4964 flow [2024-06-27 22:20:51,110 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-27 22:20:51,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:51,110 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-27 22:20:51,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2024-06-27 22:20:51,111 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:20:51,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:51,111 INFO L85 PathProgramCache]: Analyzing trace with hash -99606543, now seen corresponding path program 14 times [2024-06-27 22:20:51,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:51,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601377862] [2024-06-27 22:20:51,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:51,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:52,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:52,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601377862] [2024-06-27 22:20:52,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601377862] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:52,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:52,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:20:52,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507678783] [2024-06-27 22:20:52,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:52,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:20:52,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:52,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:20:52,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:20:52,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:20:52,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 350 transitions, 4964 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-27 22:20:52,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:52,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:20:52,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:20:55,266 INFO L124 PetriNetUnfolderBase]: 4112/9043 cut-off events. [2024-06-27 22:20:55,267 INFO L125 PetriNetUnfolderBase]: For 171310/171310 co-relation queries the response was YES. [2024-06-27 22:20:55,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39761 conditions, 9043 events. 4112/9043 cut-off events. For 171310/171310 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 86607 event pairs, 2914 based on Foata normal form. 6/8490 useless extension candidates. Maximal degree in co-relation 39581. Up to 7526 conditions per place. [2024-06-27 22:20:55,388 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 339 selfloop transitions, 35 changer transitions 0/382 dead transitions. [2024-06-27 22:20:55,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 382 transitions, 5876 flow [2024-06-27 22:20:55,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:20:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:20:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 190 transitions. [2024-06-27 22:20:55,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.405982905982906 [2024-06-27 22:20:55,390 INFO L175 Difference]: Start difference. First operand has 391 places, 350 transitions, 4964 flow. Second operand 13 states and 190 transitions. [2024-06-27 22:20:55,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 382 transitions, 5876 flow [2024-06-27 22:20:56,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 382 transitions, 5758 flow, removed 5 selfloop flow, removed 13 redundant places. [2024-06-27 22:20:56,744 INFO L231 Difference]: Finished difference. Result has 391 places, 350 transitions, 4920 flow [2024-06-27 22:20:56,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4846, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4920, PETRI_PLACES=391, PETRI_TRANSITIONS=350} [2024-06-27 22:20:56,744 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 351 predicate places. [2024-06-27 22:20:56,744 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 350 transitions, 4920 flow [2024-06-27 22:20:56,744 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-27 22:20:56,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:20:56,745 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-27 22:20:56,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2024-06-27 22:20:56,745 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:20:56,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:20:56,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1886494249, now seen corresponding path program 15 times [2024-06-27 22:20:56,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:20:56,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133000070] [2024-06-27 22:20:56,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:20:56,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:20:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:20:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:20:58,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:20:58,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133000070] [2024-06-27 22:20:58,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133000070] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:20:58,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:20:58,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:20:58,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910263407] [2024-06-27 22:20:58,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:20:58,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:20:58,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:20:58,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:20:58,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:20:58,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:20:58,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 350 transitions, 4920 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:20:58,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:20:58,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:20:58,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:00,947 INFO L124 PetriNetUnfolderBase]: 4110/9065 cut-off events. [2024-06-27 22:21:00,947 INFO L125 PetriNetUnfolderBase]: For 119522/119522 co-relation queries the response was YES. [2024-06-27 22:21:01,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38693 conditions, 9065 events. 4110/9065 cut-off events. For 119522/119522 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 86988 event pairs, 2975 based on Foata normal form. 8/8517 useless extension candidates. Maximal degree in co-relation 38512. Up to 7347 conditions per place. [2024-06-27 22:21:01,081 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 333 selfloop transitions, 39 changer transitions 0/380 dead transitions. [2024-06-27 22:21:01,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 380 transitions, 5564 flow [2024-06-27 22:21:01,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:21:01,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:21:01,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 180 transitions. [2024-06-27 22:21:01,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-27 22:21:01,082 INFO L175 Difference]: Start difference. First operand has 391 places, 350 transitions, 4920 flow. Second operand 12 states and 180 transitions. [2024-06-27 22:21:01,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 380 transitions, 5564 flow [2024-06-27 22:21:01,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 380 transitions, 4955 flow, removed 19 selfloop flow, removed 128 redundant places. [2024-06-27 22:21:01,603 INFO L231 Difference]: Finished difference. Result has 273 places, 349 transitions, 4133 flow [2024-06-27 22:21:01,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4055, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4133, PETRI_PLACES=273, PETRI_TRANSITIONS=349} [2024-06-27 22:21:01,604 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 233 predicate places. [2024-06-27 22:21:01,604 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 349 transitions, 4133 flow [2024-06-27 22:21:01,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:01,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:01,605 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-27 22:21:01,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2024-06-27 22:21:01,605 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:21:01,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:01,606 INFO L85 PathProgramCache]: Analyzing trace with hash -607357654, now seen corresponding path program 1 times [2024-06-27 22:21:01,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:01,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777912084] [2024-06-27 22:21:01,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:01,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:01,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:21:01,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:01,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777912084] [2024-06-27 22:21:01,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777912084] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:01,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:01,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:21:01,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828986806] [2024-06-27 22:21:01,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:01,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:21:01,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:01,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:21:01,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:21:01,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2024-06-27 22:21:01,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 349 transitions, 4133 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:01,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:01,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2024-06-27 22:21:01,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:02,475 INFO L124 PetriNetUnfolderBase]: 2897/6820 cut-off events. [2024-06-27 22:21:02,475 INFO L125 PetriNetUnfolderBase]: For 17537/17629 co-relation queries the response was YES. [2024-06-27 22:21:02,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24703 conditions, 6820 events. 2897/6820 cut-off events. For 17537/17629 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 63741 event pairs, 598 based on Foata normal form. 478/6971 useless extension candidates. Maximal degree in co-relation 24642. Up to 2063 conditions per place. [2024-06-27 22:21:02,517 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 170 selfloop transitions, 95 changer transitions 0/344 dead transitions. [2024-06-27 22:21:02,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 344 transitions, 4555 flow [2024-06-27 22:21:02,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:21:02,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:21:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2024-06-27 22:21:02,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2024-06-27 22:21:02,518 INFO L175 Difference]: Start difference. First operand has 273 places, 349 transitions, 4133 flow. Second operand 5 states and 112 transitions. [2024-06-27 22:21:02,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 344 transitions, 4555 flow [2024-06-27 22:21:02,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 344 transitions, 4231 flow, removed 101 selfloop flow, removed 21 redundant places. [2024-06-27 22:21:02,599 INFO L231 Difference]: Finished difference. Result has 258 places, 334 transitions, 3961 flow [2024-06-27 22:21:02,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3665, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3961, PETRI_PLACES=258, PETRI_TRANSITIONS=334} [2024-06-27 22:21:02,600 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 218 predicate places. [2024-06-27 22:21:02,600 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 334 transitions, 3961 flow [2024-06-27 22:21:02,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:02,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:02,600 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, 1, 1, 1, 1, 1] [2024-06-27 22:21:02,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2024-06-27 22:21:02,600 INFO L420 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:21:02,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:02,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1164236629, now seen corresponding path program 1 times [2024-06-27 22:21:02,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:02,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369153269] [2024-06-27 22:21:02,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:02,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:02,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:21:02,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:02,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369153269] [2024-06-27 22:21:02,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369153269] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:02,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:02,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:21:02,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348635607] [2024-06-27 22:21:02,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:02,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:21:02,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:02,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:21:02,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:21:02,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-27 22:21:02,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 334 transitions, 3961 flow. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:02,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:02,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-27 22:21:02,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:04,014 INFO L124 PetriNetUnfolderBase]: 2919/7541 cut-off events. [2024-06-27 22:21:04,014 INFO L125 PetriNetUnfolderBase]: For 14118/14153 co-relation queries the response was YES. [2024-06-27 22:21:04,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25716 conditions, 7541 events. 2919/7541 cut-off events. For 14118/14153 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 76754 event pairs, 1066 based on Foata normal form. 155/7308 useless extension candidates. Maximal degree in co-relation 25658. Up to 1692 conditions per place. [2024-06-27 22:21:04,055 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 91 selfloop transitions, 105 changer transitions 122/383 dead transitions. [2024-06-27 22:21:04,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 383 transitions, 4750 flow [2024-06-27 22:21:04,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:21:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:21:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 194 transitions. [2024-06-27 22:21:04,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44907407407407407 [2024-06-27 22:21:04,057 INFO L175 Difference]: Start difference. First operand has 258 places, 334 transitions, 3961 flow. Second operand 12 states and 194 transitions. [2024-06-27 22:21:04,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 383 transitions, 4750 flow [2024-06-27 22:21:04,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 383 transitions, 4578 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-27 22:21:04,148 INFO L231 Difference]: Finished difference. Result has 269 places, 235 transitions, 2945 flow [2024-06-27 22:21:04,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3789, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2945, PETRI_PLACES=269, PETRI_TRANSITIONS=235} [2024-06-27 22:21:04,149 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 229 predicate places. [2024-06-27 22:21:04,149 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 235 transitions, 2945 flow [2024-06-27 22:21:04,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:04,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:04,149 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, 1, 1, 1, 1, 1] [2024-06-27 22:21:04,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2024-06-27 22:21:04,149 INFO L420 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:21:04,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:04,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1469444583, now seen corresponding path program 2 times [2024-06-27 22:21:04,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:04,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195580136] [2024-06-27 22:21:04,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:04,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:21:04,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:21:04,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:21:04,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195580136] [2024-06-27 22:21:04,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195580136] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:21:04,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:21:04,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:21:04,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393021555] [2024-06-27 22:21:04,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:21:04,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:21:04,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:21:04,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:21:04,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:21:04,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2024-06-27 22:21:04,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 235 transitions, 2945 flow. Second operand has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:04,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:21:04,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2024-06-27 22:21:04,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:21:05,145 INFO L124 PetriNetUnfolderBase]: 1418/3838 cut-off events. [2024-06-27 22:21:05,145 INFO L125 PetriNetUnfolderBase]: For 8923/8941 co-relation queries the response was YES. [2024-06-27 22:21:05,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14212 conditions, 3838 events. 1418/3838 cut-off events. For 8923/8941 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 35411 event pairs, 207 based on Foata normal form. 85/3664 useless extension candidates. Maximal degree in co-relation 14162. Up to 1052 conditions per place. [2024-06-27 22:21:05,168 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 46 selfloop transitions, 37 changer transitions 102/261 dead transitions. [2024-06-27 22:21:05,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 261 transitions, 3341 flow [2024-06-27 22:21:05,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:21:05,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:21:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-27 22:21:05,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-27 22:21:05,169 INFO L175 Difference]: Start difference. First operand has 269 places, 235 transitions, 2945 flow. Second operand 10 states and 189 transitions. [2024-06-27 22:21:05,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 261 transitions, 3341 flow [2024-06-27 22:21:05,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 261 transitions, 2649 flow, removed 20 selfloop flow, removed 29 redundant places. [2024-06-27 22:21:05,222 INFO L231 Difference]: Finished difference. Result has 201 places, 149 transitions, 1536 flow [2024-06-27 22:21:05,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2275, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1536, PETRI_PLACES=201, PETRI_TRANSITIONS=149} [2024-06-27 22:21:05,222 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 161 predicate places. [2024-06-27 22:21:05,222 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 149 transitions, 1536 flow [2024-06-27 22:21:05,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:21:05,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:21:05,223 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, 1, 1, 1, 1, 1] [2024-06-27 22:21:05,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2024-06-27 22:21:05,223 INFO L420 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:21:05,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:21:05,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1878082039, now seen corresponding path program 3 times [2024-06-27 22:21:05,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:21:05,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407232807] [2024-06-27 22:21:05,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:21:05,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:21:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:21:05,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 22:21:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:21:05,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 22:21:05,289 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 22:21:05,290 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-27 22:21:05,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-27 22:21:05,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-06-27 22:21:05,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-06-27 22:21:05,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-27 22:21:05,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-27 22:21:05,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-27 22:21:05,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2024-06-27 22:21:05,292 INFO L445 BasicCegarLoop]: Path program histogram: [26, 17, 16, 15, 12, 8, 7, 6, 5, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:21:05,296 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 22:21:05,296 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 22:21:05,353 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 22:21:05,353 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 22:21:05,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 10:21:05 BasicIcfg [2024-06-27 22:21:05,354 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 22:21:05,354 INFO L158 Benchmark]: Toolchain (without parser) took 431203.94ms. Allocated memory was 167.8MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 90.8MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-06-27 22:21:05,354 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 121.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:21:05,354 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 138.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:21:05,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 616.03ms. Allocated memory was 167.8MB in the beginning and 237.0MB in the end (delta: 69.2MB). Free memory was 90.5MB in the beginning and 187.0MB in the end (delta: -96.5MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-06-27 22:21:05,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.09ms. Allocated memory is still 237.0MB. Free memory was 187.0MB in the beginning and 180.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-27 22:21:05,355 INFO L158 Benchmark]: Boogie Preprocessor took 49.27ms. Allocated memory is still 237.0MB. Free memory was 180.8MB in the beginning and 176.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 22:21:05,355 INFO L158 Benchmark]: RCFGBuilder took 716.55ms. Allocated memory is still 237.0MB. Free memory was 176.6MB in the beginning and 95.9MB in the end (delta: 80.7MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2024-06-27 22:21:05,355 INFO L158 Benchmark]: TraceAbstraction took 429750.81ms. Allocated memory was 237.0MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 95.9MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-06-27 22:21:05,356 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 121.2MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 138.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 616.03ms. Allocated memory was 167.8MB in the beginning and 237.0MB in the end (delta: 69.2MB). Free memory was 90.5MB in the beginning and 187.0MB in the end (delta: -96.5MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.09ms. Allocated memory is still 237.0MB. Free memory was 187.0MB in the beginning and 180.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.27ms. Allocated memory is still 237.0MB. Free memory was 180.8MB in the beginning and 176.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 716.55ms. Allocated memory is still 237.0MB. Free memory was 176.6MB in the beginning and 95.9MB in the end (delta: 80.7MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. * TraceAbstraction took 429750.81ms. Allocated memory was 237.0MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 95.9MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t585; [L811] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t585=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L811] FCALL, FORK 0 pthread_create(&t585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t585=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L812] 0 pthread_t t586; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t585=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L813] 0 //@ assert (!multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p1_EBX) + (long long) y) >= 0LL) && (((0LL - (long long) __unbuffered_p1_EBX) + (long long) y$mem_tmp) >= 0LL)) && (((0LL - (long long) y$flush_delayed) + (long long) y$r_buff0_thd1) >= 0LL)) && (((0LL - (long long) y$flush_delayed) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$flush_delayed) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$r_buff0_thd1) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd1) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) y$w_buff0) + (long long) y$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$w_buff0_used) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$w_buff0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) x + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) x + (long long) y$w_buff0) >= 0LL)) && (((long long) x + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y + (long long) y$w_buff0) >= 0LL)) && (((long long) y + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$w_buff0) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$w_buff0) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff1_thd1) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff1_thd1 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd1 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$read_delayed + (long long) y$w_buff0) >= 0LL)) && (((long long) y$read_delayed + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used + (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0_used + (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$w_buff0) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$w_buff0) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$w_buff0_used) >= 0LL)) && (((1LL + (long long) y$w_buff0_used) - (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) y$mem_tmp) >= 0LL)) && (((long long) y - (long long) y$mem_tmp) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff1_thd1) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL))); [L813] FCALL, FORK 0 pthread_create(&t586, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t585=-1, t586=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L766] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L814] 0 //@ assert (!multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p1_EBX) + (long long) y) >= 0LL) && (((0LL - (long long) __unbuffered_p1_EBX) + (long long) y$mem_tmp) >= 0LL)) && (((0LL - (long long) y$flush_delayed) + (long long) y$r_buff0_thd1) >= 0LL)) && (((0LL - (long long) y$flush_delayed) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$flush_delayed) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$r_buff0_thd1) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd1) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) + (long long) y$w_buff0_used) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) y$w_buff0) + (long long) y$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$w_buff0_used) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$w_buff0_used) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$w_buff0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) x + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) x + (long long) y$w_buff0) >= 0LL)) && (((long long) x + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y + (long long) y$w_buff0) >= 0LL)) && (((long long) y + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$w_buff0) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$w_buff0) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff1_thd1) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd1 + (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd2 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff1_thd1 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd1 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff1_thd2 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$read_delayed + (long long) y$w_buff0) >= 0LL)) && (((long long) y$read_delayed + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0 + (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used + (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0_used + (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$w_buff0) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$w_buff0_used) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff0_thd1) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$w_buff0) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$w_buff0_used) >= 0LL)) && (((1LL + (long long) y$w_buff0_used) - (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) y$mem_tmp) >= 0LL)) && (((long long) y - (long long) y$mem_tmp) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff1_thd1) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$read_delayed) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff0) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t585=-1, t586=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585=-1, t586=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585=-1, t586=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L826] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585=-1, t586=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L828] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 54 locations, 7 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: 429.6s, OverallIterations: 143, TraceHistogramMax: 1, PathProgramHistogramMax: 26, EmptinessCheckTime: 0.0s, AutomataDifference: 226.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8684 SdHoareTripleChecker+Valid, 45.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7441 mSDsluCounter, 4343 SdHoareTripleChecker+Invalid, 39.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3488 mSDsCounter, 2661 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60804 IncrementalHoareTripleChecker+Invalid, 63465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2661 mSolverCounterUnsat, 855 mSDtfsCounter, 60804 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1618 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 1606 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2554 ImplicationChecksByTransitivity, 47.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6156occurred in iteration=43, InterpolantAutomatonStates: 1381, 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.2s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 199.0s InterpolantComputationTime, 2276 NumberOfCodeBlocks, 2276 NumberOfCodeBlocksAsserted, 143 NumberOfCheckSat, 2108 ConstructedInterpolants, 0 QuantifiedInterpolants, 96425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 142 InterpolantComputations, 142 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 RESULT: Ultimate proved your program to be incorrect! [2024-06-27 22:21:05,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE