./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_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/safe012_pso.oepc_pso.opt_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/safe012_pso.oepc_pso.opt_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe012_pso.oepc_pso.opt_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:46:02,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:46:02,067 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:46:02,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:46:02,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:46:02,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:46:02,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:46:02,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:46:02,103 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:46:02,106 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:46:02,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:46:02,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:46:02,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:46:02,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:46:02,109 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:46:02,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:46:02,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:46:02,109 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:46:02,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:46:02,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:46:02,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:46:02,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:46:02,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:46:02,111 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:46:02,111 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:46:02,111 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:46:02,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:46:02,111 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:46:02,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:46:02,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:46:02,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:46:02,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:46:02,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:46:02,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:46:02,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:46:02,114 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:46:02,114 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:46:02,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:46:02,114 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:46:02,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:46:02,115 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:46:02,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:46:02,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:46:02,115 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:46:02,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:46:02,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:46:02,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:46:02,325 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:46:02,326 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:46:02,327 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/safe012_pso.oepc_pso.opt_rmo.opt.yml/witness.yml [2024-06-27 22:46:02,445 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:46:02,445 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:46:02,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2024-06-27 22:46:03,461 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:46:03,641 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:46:03,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2024-06-27 22:46:03,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01ef766a8/e158bc703b6942aea4c1fd62f63d3526/FLAGbf0e5bfec [2024-06-27 22:46:03,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01ef766a8/e158bc703b6942aea4c1fd62f63d3526 [2024-06-27 22:46:03,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:46:03,667 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:46:03,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:46:03,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:46:03,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:46:03,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:46:02" (1/2) ... [2024-06-27 22:46:03,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7962cfe4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:46:03, skipping insertion in model container [2024-06-27 22:46:03,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:46:02" (1/2) ... [2024-06-27 22:46:03,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4bf08ec7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:46:03, skipping insertion in model container [2024-06-27 22:46:03,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:46:03" (2/2) ... [2024-06-27 22:46:03,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7962cfe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:46:03, skipping insertion in model container [2024-06-27 22:46:03,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:46:03" (2/2) ... [2024-06-27 22:46:03,675 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:46:03,698 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:46:03,699 INFO L97 edCorrectnessWitness]: Location invariant before [L836-L836] ! multithreaded || (((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$mem_tmp >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:46:03,699 INFO L97 edCorrectnessWitness]: Location invariant before [L834-L834] ! multithreaded || (((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$mem_tmp >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:46:03,699 INFO L97 edCorrectnessWitness]: Location invariant before [L837-L837] ! multithreaded || (((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x >= 0LL) && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x$mem_tmp >= 0LL) && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )__unbuffered_p0_EBX) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$mem_tmp) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$mem_tmp >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) [2024-06-27 22:46:03,699 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:46:03,699 INFO L106 edCorrectnessWitness]: ghost_update [L832-L832] multithreaded = 1; [2024-06-27 22:46:03,741 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:46:03,889 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/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2024-06-27 22:46:03,986 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:46:03,994 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:46:04,021 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/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:46:04,103 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:46:04,135 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:46:04,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:46:04 WrapperNode [2024-06-27 22:46:04,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:46:04,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:46:04,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:46:04,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:46:04,142 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:46:04" (1/1) ... [2024-06-27 22:46:04,154 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:46:04" (1/1) ... [2024-06-27 22:46:04,219 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 122 [2024-06-27 22:46:04,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:46:04,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:46:04,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:46:04,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:46:04,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:46:04" (1/1) ... [2024-06-27 22:46:04,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:46:04" (1/1) ... [2024-06-27 22:46:04,260 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:46:04" (1/1) ... [2024-06-27 22:46:04,272 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:46:04,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:46:04" (1/1) ... [2024-06-27 22:46:04,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:46:04" (1/1) ... [2024-06-27 22:46:04,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:46:04" (1/1) ... [2024-06-27 22:46:04,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:46:04" (1/1) ... [2024-06-27 22:46:04,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:46:04" (1/1) ... [2024-06-27 22:46:04,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:46:04" (1/1) ... [2024-06-27 22:46:04,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:46:04,317 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:46:04,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:46:04,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:46:04,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:46:04" (1/1) ... [2024-06-27 22:46:04,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:46:04,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:46:04,355 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:46:04,408 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:46:04,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:46:04,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:46:04,435 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:46:04,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:46:04,435 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:46:04,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:46:04,436 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:46:04,436 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:46:04,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:46:04,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:46:04,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:46:04,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:46:04,437 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:46:04,543 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:46:04,545 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:46:04,916 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:46:04,916 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:46:05,064 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:46:05,065 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:46:05,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:46:05 BoogieIcfgContainer [2024-06-27 22:46:05,065 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:46:05,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:46:05,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:46:05,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:46:05,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:46:02" (1/4) ... [2024-06-27 22:46:05,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5b57c5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:46:05, skipping insertion in model container [2024-06-27 22:46:05,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:46:03" (2/4) ... [2024-06-27 22:46:05,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5b57c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:46:05, skipping insertion in model container [2024-06-27 22:46:05,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:46:04" (3/4) ... [2024-06-27 22:46:05,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5b57c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:46:05, skipping insertion in model container [2024-06-27 22:46:05,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:46:05" (4/4) ... [2024-06-27 22:46:05,074 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc_pso.opt_rmo.opt.i [2024-06-27 22:46:05,087 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:46:05,088 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 22:46:05,088 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:46:05,146 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:46:05,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 46 transitions, 104 flow [2024-06-27 22:46:05,210 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2024-06-27 22:46:05,210 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:46:05,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 1/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-06-27 22:46:05,213 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 46 transitions, 104 flow [2024-06-27 22:46:05,217 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 43 transitions, 95 flow [2024-06-27 22:46:05,226 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:46:05,231 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;@318bea82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:46:05,231 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 22:46:05,237 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:46:05,237 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-27 22:46:05,237 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:46:05,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:05,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:46:05,238 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:05,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:05,242 INFO L85 PathProgramCache]: Analyzing trace with hash 345513232, now seen corresponding path program 1 times [2024-06-27 22:46:05,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:05,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728466643] [2024-06-27 22:46:05,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:05,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:05,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:05,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728466643] [2024-06-27 22:46:05,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728466643] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:05,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:05,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:46:05,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752450178] [2024-06-27 22:46:05,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:05,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:46:05,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:05,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:46:05,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:46:05,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:46:05,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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:46:05,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:05,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:46:05,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:06,459 INFO L124 PetriNetUnfolderBase]: 1091/1829 cut-off events. [2024-06-27 22:46:06,460 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-06-27 22:46:06,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3510 conditions, 1829 events. 1091/1829 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10948 event pairs, 322 based on Foata normal form. 72/1813 useless extension candidates. Maximal degree in co-relation 3498. Up to 1580 conditions per place. [2024-06-27 22:46:06,475 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 34 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2024-06-27 22:46:06,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 53 transitions, 192 flow [2024-06-27 22:46:06,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:46:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:46:06,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-06-27 22:46:06,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7246376811594203 [2024-06-27 22:46:06,487 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 95 flow. Second operand 3 states and 100 transitions. [2024-06-27 22:46:06,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 53 transitions, 192 flow [2024-06-27 22:46:06,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:46:06,494 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 111 flow [2024-06-27 22:46:06,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2024-06-27 22:46:06,498 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2024-06-27 22:46:06,498 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 111 flow [2024-06-27 22:46:06,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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:46:06,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:06,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:06,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:46:06,500 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:06,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1199399381, now seen corresponding path program 1 times [2024-06-27 22:46:06,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:06,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110074885] [2024-06-27 22:46:06,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:06,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:06,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:06,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110074885] [2024-06-27 22:46:06,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110074885] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:06,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:06,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:46:06,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662375706] [2024-06-27 22:46:06,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:06,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:46:06,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:06,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:46:06,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:46:06,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:46:06,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 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:46:06,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:06,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:46:06,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:07,196 INFO L124 PetriNetUnfolderBase]: 1086/1998 cut-off events. [2024-06-27 22:46:07,196 INFO L125 PetriNetUnfolderBase]: For 203/206 co-relation queries the response was YES. [2024-06-27 22:46:07,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4047 conditions, 1998 events. 1086/1998 cut-off events. For 203/206 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13027 event pairs, 635 based on Foata normal form. 4/1843 useless extension candidates. Maximal degree in co-relation 4035. Up to 1611 conditions per place. [2024-06-27 22:46:07,206 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 39 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2024-06-27 22:46:07,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 64 transitions, 263 flow [2024-06-27 22:46:07,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:46:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:46:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2024-06-27 22:46:07,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6739130434782609 [2024-06-27 22:46:07,209 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 111 flow. Second operand 4 states and 124 transitions. [2024-06-27 22:46:07,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 64 transitions, 263 flow [2024-06-27 22:46:07,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:46:07,211 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 174 flow [2024-06-27 22:46:07,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2024-06-27 22:46:07,211 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2024-06-27 22:46:07,212 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 174 flow [2024-06-27 22:46:07,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 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:46:07,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:07,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:07,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:46:07,212 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:07,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:07,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1473326340, now seen corresponding path program 1 times [2024-06-27 22:46:07,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:07,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752468612] [2024-06-27 22:46:07,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:07,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:07,584 INFO 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:46:07,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:07,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752468612] [2024-06-27 22:46:07,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752468612] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:07,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:07,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:46:07,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415080474] [2024-06-27 22:46:07,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:07,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:46:07,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:07,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:46:07,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:46:07,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-06-27 22:46:07,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:07,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:07,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-06-27 22:46:07,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:07,901 INFO L124 PetriNetUnfolderBase]: 1314/2388 cut-off events. [2024-06-27 22:46:07,901 INFO L125 PetriNetUnfolderBase]: For 887/887 co-relation queries the response was YES. [2024-06-27 22:46:07,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5438 conditions, 2388 events. 1314/2388 cut-off events. For 887/887 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16174 event pairs, 749 based on Foata normal form. 2/2232 useless extension candidates. Maximal degree in co-relation 5423. Up to 1927 conditions per place. [2024-06-27 22:46:07,915 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 53 selfloop transitions, 13 changer transitions 0/81 dead transitions. [2024-06-27 22:46:07,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 81 transitions, 399 flow [2024-06-27 22:46:07,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:46:07,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:46:07,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2024-06-27 22:46:07,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6434782608695652 [2024-06-27 22:46:07,917 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 174 flow. Second operand 5 states and 148 transitions. [2024-06-27 22:46:07,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 81 transitions, 399 flow [2024-06-27 22:46:07,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 81 transitions, 397 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-27 22:46:07,920 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 286 flow [2024-06-27 22:46:07,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=286, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2024-06-27 22:46:07,921 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places. [2024-06-27 22:46:07,921 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 286 flow [2024-06-27 22:46:07,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:07,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:07,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:07,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:46:07,922 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:07,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:07,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1587514268, now seen corresponding path program 1 times [2024-06-27 22:46:07,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:07,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085460473] [2024-06-27 22:46:07,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:07,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:08,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:46:08,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:08,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085460473] [2024-06-27 22:46:08,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085460473] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:08,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:08,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:46:08,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501899853] [2024-06-27 22:46:08,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:08,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:46:08,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:08,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:46:08,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:46:08,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-06-27 22:46:08,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 286 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:08,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:08,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-06-27 22:46:08,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:08,923 INFO L124 PetriNetUnfolderBase]: 1335/2420 cut-off events. [2024-06-27 22:46:08,923 INFO L125 PetriNetUnfolderBase]: For 1749/1749 co-relation queries the response was YES. [2024-06-27 22:46:08,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6185 conditions, 2420 events. 1335/2420 cut-off events. For 1749/1749 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 16354 event pairs, 715 based on Foata normal form. 4/2264 useless extension candidates. Maximal degree in co-relation 6165. Up to 1909 conditions per place. [2024-06-27 22:46:08,935 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 66 selfloop transitions, 23 changer transitions 3/107 dead transitions. [2024-06-27 22:46:08,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 107 transitions, 604 flow [2024-06-27 22:46:08,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:46:08,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:46:08,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2024-06-27 22:46:08,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6630434782608695 [2024-06-27 22:46:08,937 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 286 flow. Second operand 6 states and 183 transitions. [2024-06-27 22:46:08,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 107 transitions, 604 flow [2024-06-27 22:46:08,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 107 transitions, 600 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-27 22:46:08,941 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 425 flow [2024-06-27 22:46:08,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=425, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2024-06-27 22:46:08,944 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2024-06-27 22:46:08,945 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 425 flow [2024-06-27 22:46:08,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:08,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:08,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:08,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:46:08,945 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:08,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:08,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1789851574, now seen corresponding path program 1 times [2024-06-27 22:46:08,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:08,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780932276] [2024-06-27 22:46:08,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:08,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:09,430 INFO 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:46:09,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:09,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780932276] [2024-06-27 22:46:09,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780932276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:09,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:09,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:46:09,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084637746] [2024-06-27 22:46:09,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:09,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:46:09,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:09,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:46:09,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:46:09,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-06-27 22:46:09,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 425 flow. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 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:46:09,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:09,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-06-27 22:46:09,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:09,940 INFO L124 PetriNetUnfolderBase]: 2117/3752 cut-off events. [2024-06-27 22:46:09,940 INFO L125 PetriNetUnfolderBase]: For 4820/4864 co-relation queries the response was YES. [2024-06-27 22:46:09,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10580 conditions, 3752 events. 2117/3752 cut-off events. For 4820/4864 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 25121 event pairs, 829 based on Foata normal form. 14/3514 useless extension candidates. Maximal degree in co-relation 10553. Up to 2965 conditions per place. [2024-06-27 22:46:09,961 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 76 selfloop transitions, 25 changer transitions 0/121 dead transitions. [2024-06-27 22:46:09,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 121 transitions, 822 flow [2024-06-27 22:46:09,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:46:09,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:46:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2024-06-27 22:46:09,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5597826086956522 [2024-06-27 22:46:09,963 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 425 flow. Second operand 8 states and 206 transitions. [2024-06-27 22:46:09,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 121 transitions, 822 flow [2024-06-27 22:46:09,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 121 transitions, 812 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-06-27 22:46:09,974 INFO L231 Difference]: Finished difference. Result has 82 places, 90 transitions, 623 flow [2024-06-27 22:46:09,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=623, PETRI_PLACES=82, PETRI_TRANSITIONS=90} [2024-06-27 22:46:09,975 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 30 predicate places. [2024-06-27 22:46:09,975 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 90 transitions, 623 flow [2024-06-27 22:46:09,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 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:46:09,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:09,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:09,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:46:09,976 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:09,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:09,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1734476726, now seen corresponding path program 2 times [2024-06-27 22:46:09,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:09,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206326972] [2024-06-27 22:46:09,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:09,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:10,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:10,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206326972] [2024-06-27 22:46:10,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206326972] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:10,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:10,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:46:10,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436253015] [2024-06-27 22:46:10,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:10,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:46:10,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:10,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:46:10,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:46:10,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-06-27 22:46:10,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 90 transitions, 623 flow. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 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:46:10,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:10,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-06-27 22:46:10,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:11,121 INFO L124 PetriNetUnfolderBase]: 2190/3856 cut-off events. [2024-06-27 22:46:11,122 INFO L125 PetriNetUnfolderBase]: For 7755/7832 co-relation queries the response was YES. [2024-06-27 22:46:11,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12060 conditions, 3856 events. 2190/3856 cut-off events. For 7755/7832 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 25653 event pairs, 694 based on Foata normal form. 38/3637 useless extension candidates. Maximal degree in co-relation 12026. Up to 2939 conditions per place. [2024-06-27 22:46:11,142 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 76 selfloop transitions, 33 changer transitions 1/130 dead transitions. [2024-06-27 22:46:11,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 130 transitions, 995 flow [2024-06-27 22:46:11,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:46:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:46:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-06-27 22:46:11,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5570652173913043 [2024-06-27 22:46:11,144 INFO L175 Difference]: Start difference. First operand has 82 places, 90 transitions, 623 flow. Second operand 8 states and 205 transitions. [2024-06-27 22:46:11,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 130 transitions, 995 flow [2024-06-27 22:46:11,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 130 transitions, 955 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-27 22:46:11,155 INFO L231 Difference]: Finished difference. Result has 89 places, 98 transitions, 750 flow [2024-06-27 22:46:11,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=750, PETRI_PLACES=89, PETRI_TRANSITIONS=98} [2024-06-27 22:46:11,156 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 37 predicate places. [2024-06-27 22:46:11,156 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 98 transitions, 750 flow [2024-06-27 22:46:11,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 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:46:11,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:11,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:11,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:46:11,157 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:11,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:11,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1734597626, now seen corresponding path program 3 times [2024-06-27 22:46:11,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:11,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090433866] [2024-06-27 22:46:11,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:11,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:11,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:11,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090433866] [2024-06-27 22:46:11,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090433866] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:11,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:11,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:46:11,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221184165] [2024-06-27 22:46:11,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:11,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:46:11,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:11,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:46:11,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:46:11,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-06-27 22:46:11,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 98 transitions, 750 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:11,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:11,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-06-27 22:46:11,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:12,314 INFO L124 PetriNetUnfolderBase]: 1983/3584 cut-off events. [2024-06-27 22:46:12,314 INFO L125 PetriNetUnfolderBase]: For 9975/10053 co-relation queries the response was YES. [2024-06-27 22:46:12,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12145 conditions, 3584 events. 1983/3584 cut-off events. For 9975/10053 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 24474 event pairs, 584 based on Foata normal form. 32/3377 useless extension candidates. Maximal degree in co-relation 12109. Up to 2598 conditions per place. [2024-06-27 22:46:12,333 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 73 selfloop transitions, 38 changer transitions 0/133 dead transitions. [2024-06-27 22:46:12,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 133 transitions, 1187 flow [2024-06-27 22:46:12,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:46:12,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:46:12,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2024-06-27 22:46:12,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6565217391304348 [2024-06-27 22:46:12,334 INFO L175 Difference]: Start difference. First operand has 89 places, 98 transitions, 750 flow. Second operand 5 states and 151 transitions. [2024-06-27 22:46:12,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 133 transitions, 1187 flow [2024-06-27 22:46:12,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 133 transitions, 1063 flow, removed 44 selfloop flow, removed 4 redundant places. [2024-06-27 22:46:12,357 INFO L231 Difference]: Finished difference. Result has 92 places, 111 transitions, 912 flow [2024-06-27 22:46:12,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=912, PETRI_PLACES=92, PETRI_TRANSITIONS=111} [2024-06-27 22:46:12,357 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 40 predicate places. [2024-06-27 22:46:12,358 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 111 transitions, 912 flow [2024-06-27 22:46:12,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:12,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:12,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:12,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:46:12,358 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:12,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:12,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1155047646, now seen corresponding path program 4 times [2024-06-27 22:46:12,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:12,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381147906] [2024-06-27 22:46:12,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:12,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:12,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:12,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381147906] [2024-06-27 22:46:12,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381147906] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:12,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:12,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:46:12,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909726325] [2024-06-27 22:46:12,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:12,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:46:12,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:12,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:46:12,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:46:12,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-06-27 22:46:12,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 111 transitions, 912 flow. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 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:46:12,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:12,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-06-27 22:46:12,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:13,380 INFO L124 PetriNetUnfolderBase]: 2313/4099 cut-off events. [2024-06-27 22:46:13,380 INFO L125 PetriNetUnfolderBase]: For 12158/12281 co-relation queries the response was YES. [2024-06-27 22:46:13,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14297 conditions, 4099 events. 2313/4099 cut-off events. For 12158/12281 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 27871 event pairs, 559 based on Foata normal form. 97/3930 useless extension candidates. Maximal degree in co-relation 14258. Up to 3020 conditions per place. [2024-06-27 22:46:13,407 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 82 selfloop transitions, 58 changer transitions 0/160 dead transitions. [2024-06-27 22:46:13,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 160 transitions, 1436 flow [2024-06-27 22:46:13,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:46:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:46:13,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 195 transitions. [2024-06-27 22:46:13,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6055900621118012 [2024-06-27 22:46:13,409 INFO L175 Difference]: Start difference. First operand has 92 places, 111 transitions, 912 flow. Second operand 7 states and 195 transitions. [2024-06-27 22:46:13,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 160 transitions, 1436 flow [2024-06-27 22:46:13,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 160 transitions, 1390 flow, removed 23 selfloop flow, removed 0 redundant places. [2024-06-27 22:46:13,443 INFO L231 Difference]: Finished difference. Result has 101 places, 127 transitions, 1231 flow [2024-06-27 22:46:13,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1231, PETRI_PLACES=101, PETRI_TRANSITIONS=127} [2024-06-27 22:46:13,443 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 49 predicate places. [2024-06-27 22:46:13,443 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 127 transitions, 1231 flow [2024-06-27 22:46:13,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 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:46:13,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:13,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:13,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:46:13,444 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:13,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:13,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2065794855, now seen corresponding path program 1 times [2024-06-27 22:46:13,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:13,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423188321] [2024-06-27 22:46:13,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:13,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:13,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:46:13,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:13,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423188321] [2024-06-27 22:46:13,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423188321] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:13,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:13,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:46:13,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912036750] [2024-06-27 22:46:13,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:13,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:46:13,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:13,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:46:13,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:46:13,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:46:13,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 127 transitions, 1231 flow. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:13,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:13,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:46:13,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:14,352 INFO L124 PetriNetUnfolderBase]: 2426/4202 cut-off events. [2024-06-27 22:46:14,353 INFO L125 PetriNetUnfolderBase]: For 14234/14234 co-relation queries the response was YES. [2024-06-27 22:46:14,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15399 conditions, 4202 events. 2426/4202 cut-off events. For 14234/14234 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 28345 event pairs, 589 based on Foata normal form. 4/3969 useless extension candidates. Maximal degree in co-relation 15355. Up to 3149 conditions per place. [2024-06-27 22:46:14,378 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 120 selfloop transitions, 38 changer transitions 0/173 dead transitions. [2024-06-27 22:46:14,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 173 transitions, 1902 flow [2024-06-27 22:46:14,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:46:14,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:46:14,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2024-06-27 22:46:14,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6391304347826087 [2024-06-27 22:46:14,380 INFO L175 Difference]: Start difference. First operand has 101 places, 127 transitions, 1231 flow. Second operand 5 states and 147 transitions. [2024-06-27 22:46:14,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 173 transitions, 1902 flow [2024-06-27 22:46:14,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 173 transitions, 1799 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-27 22:46:14,408 INFO L231 Difference]: Finished difference. Result has 103 places, 151 transitions, 1593 flow [2024-06-27 22:46:14,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1593, PETRI_PLACES=103, PETRI_TRANSITIONS=151} [2024-06-27 22:46:14,410 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 51 predicate places. [2024-06-27 22:46:14,410 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 151 transitions, 1593 flow [2024-06-27 22:46:14,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:14,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:14,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:14,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:46:14,411 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:14,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:14,411 INFO L85 PathProgramCache]: Analyzing trace with hash -2062040445, now seen corresponding path program 2 times [2024-06-27 22:46:14,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:14,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696895952] [2024-06-27 22:46:14,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:14,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:15,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:15,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696895952] [2024-06-27 22:46:15,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696895952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:15,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:15,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:46:15,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565867768] [2024-06-27 22:46:15,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:15,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:46:15,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:15,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:46:15,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:46:15,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:46:15,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 151 transitions, 1593 flow. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:15,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:15,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:46:15,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:15,618 INFO L124 PetriNetUnfolderBase]: 2450/4264 cut-off events. [2024-06-27 22:46:15,618 INFO L125 PetriNetUnfolderBase]: For 15215/15215 co-relation queries the response was YES. [2024-06-27 22:46:15,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16429 conditions, 4264 events. 2450/4264 cut-off events. For 15215/15215 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 28969 event pairs, 562 based on Foata normal form. 4/4025 useless extension candidates. Maximal degree in co-relation 16385. Up to 3107 conditions per place. [2024-06-27 22:46:15,645 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 129 selfloop transitions, 46 changer transitions 0/190 dead transitions. [2024-06-27 22:46:15,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 190 transitions, 2128 flow [2024-06-27 22:46:15,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:46:15,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:46:15,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2024-06-27 22:46:15,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6340579710144928 [2024-06-27 22:46:15,647 INFO L175 Difference]: Start difference. First operand has 103 places, 151 transitions, 1593 flow. Second operand 6 states and 175 transitions. [2024-06-27 22:46:15,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 190 transitions, 2128 flow [2024-06-27 22:46:15,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 190 transitions, 2122 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-06-27 22:46:15,769 INFO L231 Difference]: Finished difference. Result has 110 places, 160 transitions, 1789 flow [2024-06-27 22:46:15,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1587, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1789, PETRI_PLACES=110, PETRI_TRANSITIONS=160} [2024-06-27 22:46:15,770 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 58 predicate places. [2024-06-27 22:46:15,770 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 160 transitions, 1789 flow [2024-06-27 22:46:15,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:15,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:15,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:15,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:46:15,770 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:15,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:15,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2062046955, now seen corresponding path program 3 times [2024-06-27 22:46:15,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:15,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777439065] [2024-06-27 22:46:15,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:15,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:16,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:16,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777439065] [2024-06-27 22:46:16,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777439065] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:16,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:16,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:46:16,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798937951] [2024-06-27 22:46:16,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:16,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:46:16,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:16,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:46:16,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:46:16,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:46:16,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 160 transitions, 1789 flow. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:16,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:16,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:46:16,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:17,044 INFO L124 PetriNetUnfolderBase]: 2442/4248 cut-off events. [2024-06-27 22:46:17,045 INFO L125 PetriNetUnfolderBase]: For 19793/19793 co-relation queries the response was YES. [2024-06-27 22:46:17,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17291 conditions, 4248 events. 2442/4248 cut-off events. For 19793/19793 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 28737 event pairs, 650 based on Foata normal form. 4/4007 useless extension candidates. Maximal degree in co-relation 17243. Up to 3101 conditions per place. [2024-06-27 22:46:17,073 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 131 selfloop transitions, 41 changer transitions 0/187 dead transitions. [2024-06-27 22:46:17,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 187 transitions, 2210 flow [2024-06-27 22:46:17,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:46:17,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:46:17,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2024-06-27 22:46:17,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6268115942028986 [2024-06-27 22:46:17,075 INFO L175 Difference]: Start difference. First operand has 110 places, 160 transitions, 1789 flow. Second operand 6 states and 173 transitions. [2024-06-27 22:46:17,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 187 transitions, 2210 flow [2024-06-27 22:46:17,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 187 transitions, 2182 flow, removed 14 selfloop flow, removed 0 redundant places. [2024-06-27 22:46:17,113 INFO L231 Difference]: Finished difference. Result has 116 places, 160 transitions, 1851 flow [2024-06-27 22:46:17,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1761, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1851, PETRI_PLACES=116, PETRI_TRANSITIONS=160} [2024-06-27 22:46:17,114 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 64 predicate places. [2024-06-27 22:46:17,114 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 160 transitions, 1851 flow [2024-06-27 22:46:17,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:17,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:17,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:17,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:46:17,115 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:17,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:17,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1182142041, now seen corresponding path program 1 times [2024-06-27 22:46:17,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:17,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401943562] [2024-06-27 22:46:17,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:17,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:17,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:46:17,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:17,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401943562] [2024-06-27 22:46:17,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401943562] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:17,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:17,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:46:17,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702262023] [2024-06-27 22:46:17,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:17,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:46:17,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:17,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:46:17,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:46:17,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 46 [2024-06-27 22:46:17,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 160 transitions, 1851 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:17,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:17,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 46 [2024-06-27 22:46:17,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:17,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([340] L747-->L763: Formula: (let ((.cse6 (= (mod v_~x$r_buff1_thd1~0_46 256) 0)) (.cse9 (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse7 (and .cse9 (= (mod v_~x$w_buff1_used~0_63 256) 0))) (.cse11 (= (mod v_~x$w_buff0_used~0_68 256) 0)) (.cse8 (and .cse9 .cse6))) (let ((.cse1 (or .cse7 .cse11 .cse8)) (.cse2 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse4 (= (mod v_~x$w_buff1_used~0_62 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_67 256) 0))) (and (= v_~x$w_buff0_used~0_67 (ite .cse0 v_~x$w_buff0_used~0_68 (ite .cse1 v_~x$w_buff0_used~0_68 (ite .cse2 0 v_~x$w_buff0_used~0_68)))) (= v_~x$r_buff1_thd1~0_45 (ite .cse0 v_~x$r_buff1_thd1~0_46 (ite (let ((.cse5 (= (mod v_~x$r_buff0_thd1~0_43 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse5 .cse6))) v_~x$r_buff1_thd1~0_46 0))) (= v_~__unbuffered_p0_EBX~0_24 (ite .cse1 v_~x~0_59 (ite .cse2 v_~x$w_buff0~0_33 v_~x$w_buff1~0_38))) (= v_~x~0_58 (ite .cse0 v_~x$mem_tmp~0_26 v_~__unbuffered_p0_EBX~0_24)) (= v_~x$w_buff1~0_38 v_~x$w_buff1~0_37) (= v_~x$w_buff1_used~0_62 (ite .cse0 v_~x$w_buff1_used~0_63 (ite (or .cse7 .cse3 .cse8) v_~x$w_buff1_used~0_63 0))) (= (ite .cse0 v_~x$r_buff0_thd1~0_44 (ite (or (and .cse9 .cse4) .cse3 .cse8) v_~x$r_buff0_thd1~0_44 (ite (and .cse10 (not .cse3)) 0 v_~x$r_buff0_thd1~0_44))) v_~x$r_buff0_thd1~0_43) (or (= v_~weak$$choice2~0_34 0) (= v_~weak$$choice2~0_34 1)) (= v_~x~0_59 v_~x$mem_tmp~0_26) (= v_~x$w_buff0~0_33 v_~x$w_buff0~0_32) (or (= v_~weak$$choice0~0_5 1) (= v_~weak$$choice0~0_5 0)) (= v_~x$flush_delayed~0_33 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_63, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_46, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_68} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_24, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_62, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_45, ~x$mem_tmp~0=v_~x$mem_tmp~0_26, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_67, ~weak$$choice0~0=v_~weak$$choice0~0_5, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_58} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0][95], [Black: 65#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)), 24#L804true, 114#true, 164#true, Black: 72#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)), 86#true, Black: 137#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (= ~x~0 0) (= ~__unbuffered_p0_EBX~0 0)) (= |#ghost~multithreaded| 0)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 70#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 131#(and (= ~x$w_buff0~0 1) (or (= |#ghost~multithreaded| 0) (and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0))) (= 1 ~x$r_buff0_thd2~0)), Black: 71#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)), Black: 129#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 153#true, Black: 78#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 79#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 80#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 81#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 146#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 147#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 149#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 21#L794true, 68#true, Black: 91#(and (or (= |#ghost~multithreaded| 0) (and (= ~x~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0))) (= 0 ~x$w_buff0~0)), Black: 89#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= |#ghost~multithreaded| 0))), Black: 92#(and (= 0 ~x$w_buff1~0) (or (and (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)) (= |#ghost~multithreaded| 0))), Black: 161#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 157#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), 99#true, 62#true, Black: 174#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 103#(and (or (and (= ~x~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= 0 ~x$w_buff0~0)), Black: 105#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0~0 1) (or (and (= ~x~0 0) (<= ~x$r_buff1_thd2~0 0) (<= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 1 (+ ~x$r_buff1_thd2~0 ~x$w_buff0_used~0)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (= 1 ~x$r_buff0_thd2~0)), 4#L763true, 25#L847true, P2Thread1of1ForFork1InUse, 141#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, 76#true, Black: 117#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 118#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 121#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 176#true, Black: 60#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0))]) [2024-06-27 22:46:17,432 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-06-27 22:46:17,432 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 22:46:17,432 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 22:46:17,432 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-06-27 22:46:17,471 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([340] L747-->L763: Formula: (let ((.cse6 (= (mod v_~x$r_buff1_thd1~0_46 256) 0)) (.cse9 (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse7 (and .cse9 (= (mod v_~x$w_buff1_used~0_63 256) 0))) (.cse11 (= (mod v_~x$w_buff0_used~0_68 256) 0)) (.cse8 (and .cse9 .cse6))) (let ((.cse1 (or .cse7 .cse11 .cse8)) (.cse2 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse4 (= (mod v_~x$w_buff1_used~0_62 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_67 256) 0))) (and (= v_~x$w_buff0_used~0_67 (ite .cse0 v_~x$w_buff0_used~0_68 (ite .cse1 v_~x$w_buff0_used~0_68 (ite .cse2 0 v_~x$w_buff0_used~0_68)))) (= v_~x$r_buff1_thd1~0_45 (ite .cse0 v_~x$r_buff1_thd1~0_46 (ite (let ((.cse5 (= (mod v_~x$r_buff0_thd1~0_43 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse5 .cse6))) v_~x$r_buff1_thd1~0_46 0))) (= v_~__unbuffered_p0_EBX~0_24 (ite .cse1 v_~x~0_59 (ite .cse2 v_~x$w_buff0~0_33 v_~x$w_buff1~0_38))) (= v_~x~0_58 (ite .cse0 v_~x$mem_tmp~0_26 v_~__unbuffered_p0_EBX~0_24)) (= v_~x$w_buff1~0_38 v_~x$w_buff1~0_37) (= v_~x$w_buff1_used~0_62 (ite .cse0 v_~x$w_buff1_used~0_63 (ite (or .cse7 .cse3 .cse8) v_~x$w_buff1_used~0_63 0))) (= (ite .cse0 v_~x$r_buff0_thd1~0_44 (ite (or (and .cse9 .cse4) .cse3 .cse8) v_~x$r_buff0_thd1~0_44 (ite (and .cse10 (not .cse3)) 0 v_~x$r_buff0_thd1~0_44))) v_~x$r_buff0_thd1~0_43) (or (= v_~weak$$choice2~0_34 0) (= v_~weak$$choice2~0_34 1)) (= v_~x~0_59 v_~x$mem_tmp~0_26) (= v_~x$w_buff0~0_33 v_~x$w_buff0~0_32) (or (= v_~weak$$choice0~0_5 1) (= v_~weak$$choice0~0_5 0)) (= v_~x$flush_delayed~0_33 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_63, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_46, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_68} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_24, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_62, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_45, ~x$mem_tmp~0=v_~x$mem_tmp~0_26, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_67, ~weak$$choice0~0=v_~weak$$choice0~0_5, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_58} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0][95], [24#L804true, Black: 65#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)), 114#true, 164#true, 86#true, Black: 72#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)), Black: 137#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (= ~x~0 0) (= ~__unbuffered_p0_EBX~0 0)) (= |#ghost~multithreaded| 0)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 70#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 131#(and (= ~x$w_buff0~0 1) (or (= |#ghost~multithreaded| 0) (and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0))) (= 1 ~x$r_buff0_thd2~0)), Black: 71#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)), Black: 129#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 153#true, Black: 78#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 79#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 80#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 81#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 146#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 147#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 149#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 68#true, Black: 91#(and (or (= |#ghost~multithreaded| 0) (and (= ~x~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0))) (= 0 ~x$w_buff0~0)), Black: 89#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= |#ghost~multithreaded| 0))), Black: 92#(and (= 0 ~x$w_buff1~0) (or (and (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)) (= |#ghost~multithreaded| 0))), Black: 161#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 8#L841true, Black: 157#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), 99#true, 14#P1EXITtrue, 62#true, Black: 174#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 103#(and (or (and (= ~x~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= 0 ~x$w_buff0~0)), Black: 105#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0~0 1) (or (and (= ~x~0 0) (<= ~x$r_buff1_thd2~0 0) (<= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 1 (+ ~x$r_buff1_thd2~0 ~x$w_buff0_used~0)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (= 1 ~x$r_buff0_thd2~0)), 4#L763true, P2Thread1of1ForFork1InUse, 141#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, 76#true, Black: 117#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 118#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 121#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 176#true, Black: 60#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0))]) [2024-06-27 22:46:17,471 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-06-27 22:46:17,472 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 22:46:17,472 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 22:46:17,472 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 22:46:17,497 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([340] L747-->L763: Formula: (let ((.cse6 (= (mod v_~x$r_buff1_thd1~0_46 256) 0)) (.cse9 (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse7 (and .cse9 (= (mod v_~x$w_buff1_used~0_63 256) 0))) (.cse11 (= (mod v_~x$w_buff0_used~0_68 256) 0)) (.cse8 (and .cse9 .cse6))) (let ((.cse1 (or .cse7 .cse11 .cse8)) (.cse2 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse4 (= (mod v_~x$w_buff1_used~0_62 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_67 256) 0))) (and (= v_~x$w_buff0_used~0_67 (ite .cse0 v_~x$w_buff0_used~0_68 (ite .cse1 v_~x$w_buff0_used~0_68 (ite .cse2 0 v_~x$w_buff0_used~0_68)))) (= v_~x$r_buff1_thd1~0_45 (ite .cse0 v_~x$r_buff1_thd1~0_46 (ite (let ((.cse5 (= (mod v_~x$r_buff0_thd1~0_43 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse5 .cse6))) v_~x$r_buff1_thd1~0_46 0))) (= v_~__unbuffered_p0_EBX~0_24 (ite .cse1 v_~x~0_59 (ite .cse2 v_~x$w_buff0~0_33 v_~x$w_buff1~0_38))) (= v_~x~0_58 (ite .cse0 v_~x$mem_tmp~0_26 v_~__unbuffered_p0_EBX~0_24)) (= v_~x$w_buff1~0_38 v_~x$w_buff1~0_37) (= v_~x$w_buff1_used~0_62 (ite .cse0 v_~x$w_buff1_used~0_63 (ite (or .cse7 .cse3 .cse8) v_~x$w_buff1_used~0_63 0))) (= (ite .cse0 v_~x$r_buff0_thd1~0_44 (ite (or (and .cse9 .cse4) .cse3 .cse8) v_~x$r_buff0_thd1~0_44 (ite (and .cse10 (not .cse3)) 0 v_~x$r_buff0_thd1~0_44))) v_~x$r_buff0_thd1~0_43) (or (= v_~weak$$choice2~0_34 0) (= v_~weak$$choice2~0_34 1)) (= v_~x~0_59 v_~x$mem_tmp~0_26) (= v_~x$w_buff0~0_33 v_~x$w_buff0~0_32) (or (= v_~weak$$choice0~0_5 1) (= v_~weak$$choice0~0_5 0)) (= v_~x$flush_delayed~0_33 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_63, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_46, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_68} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_24, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_62, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_45, ~x$mem_tmp~0=v_~x$mem_tmp~0_26, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_67, ~weak$$choice0~0=v_~weak$$choice0~0_5, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_58} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0][95], [Black: 65#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)), 24#L804true, 114#true, 164#true, Black: 72#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)), 86#true, Black: 137#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (= ~x~0 0) (= ~__unbuffered_p0_EBX~0 0)) (= |#ghost~multithreaded| 0)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 70#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 131#(and (= ~x$w_buff0~0 1) (or (= |#ghost~multithreaded| 0) (and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0))) (= 1 ~x$r_buff0_thd2~0)), Black: 71#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)), 153#true, Black: 129#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 78#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 79#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 80#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 81#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 146#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 147#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 149#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 68#true, Black: 91#(and (or (= |#ghost~multithreaded| 0) (and (= ~x~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0))) (= 0 ~x$w_buff0~0)), Black: 89#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= |#ghost~multithreaded| 0))), Black: 92#(and (= 0 ~x$w_buff1~0) (or (and (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)) (= |#ghost~multithreaded| 0))), Black: 161#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 157#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), 99#true, 14#P1EXITtrue, 62#true, Black: 174#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 103#(and (or (and (= ~x~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= 0 ~x$w_buff0~0)), Black: 105#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0~0 1) (or (and (= ~x~0 0) (<= ~x$r_buff1_thd2~0 0) (<= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 1 (+ ~x$r_buff1_thd2~0 ~x$w_buff0_used~0)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (= 1 ~x$r_buff0_thd2~0)), 25#L847true, 4#L763true, P2Thread1of1ForFork1InUse, 141#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, 76#true, Black: 117#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 118#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 121#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 176#true, Black: 60#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0))]) [2024-06-27 22:46:17,497 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-06-27 22:46:17,498 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 22:46:17,498 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 22:46:17,498 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 22:46:17,499 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([340] L747-->L763: Formula: (let ((.cse6 (= (mod v_~x$r_buff1_thd1~0_46 256) 0)) (.cse9 (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse7 (and .cse9 (= (mod v_~x$w_buff1_used~0_63 256) 0))) (.cse11 (= (mod v_~x$w_buff0_used~0_68 256) 0)) (.cse8 (and .cse9 .cse6))) (let ((.cse1 (or .cse7 .cse11 .cse8)) (.cse2 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse4 (= (mod v_~x$w_buff1_used~0_62 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_67 256) 0))) (and (= v_~x$w_buff0_used~0_67 (ite .cse0 v_~x$w_buff0_used~0_68 (ite .cse1 v_~x$w_buff0_used~0_68 (ite .cse2 0 v_~x$w_buff0_used~0_68)))) (= v_~x$r_buff1_thd1~0_45 (ite .cse0 v_~x$r_buff1_thd1~0_46 (ite (let ((.cse5 (= (mod v_~x$r_buff0_thd1~0_43 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse5 .cse6))) v_~x$r_buff1_thd1~0_46 0))) (= v_~__unbuffered_p0_EBX~0_24 (ite .cse1 v_~x~0_59 (ite .cse2 v_~x$w_buff0~0_33 v_~x$w_buff1~0_38))) (= v_~x~0_58 (ite .cse0 v_~x$mem_tmp~0_26 v_~__unbuffered_p0_EBX~0_24)) (= v_~x$w_buff1~0_38 v_~x$w_buff1~0_37) (= v_~x$w_buff1_used~0_62 (ite .cse0 v_~x$w_buff1_used~0_63 (ite (or .cse7 .cse3 .cse8) v_~x$w_buff1_used~0_63 0))) (= (ite .cse0 v_~x$r_buff0_thd1~0_44 (ite (or (and .cse9 .cse4) .cse3 .cse8) v_~x$r_buff0_thd1~0_44 (ite (and .cse10 (not .cse3)) 0 v_~x$r_buff0_thd1~0_44))) v_~x$r_buff0_thd1~0_43) (or (= v_~weak$$choice2~0_34 0) (= v_~weak$$choice2~0_34 1)) (= v_~x~0_59 v_~x$mem_tmp~0_26) (= v_~x$w_buff0~0_33 v_~x$w_buff0~0_32) (or (= v_~weak$$choice0~0_5 1) (= v_~weak$$choice0~0_5 0)) (= v_~x$flush_delayed~0_33 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_63, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_46, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_68} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_24, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_62, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_45, ~x$mem_tmp~0=v_~x$mem_tmp~0_26, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_67, ~weak$$choice0~0=v_~weak$$choice0~0_5, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_58} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0][95], [Black: 65#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)), 24#L804true, 114#true, 164#true, Black: 72#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)), 86#true, Black: 137#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (= ~x~0 0) (= ~__unbuffered_p0_EBX~0 0)) (= |#ghost~multithreaded| 0)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 70#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 131#(and (= ~x$w_buff0~0 1) (or (= |#ghost~multithreaded| 0) (and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0))) (= 1 ~x$r_buff0_thd2~0)), Black: 71#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)), Black: 129#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 153#true, Black: 78#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 79#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 15#L19-1true, Black: 80#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 81#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 146#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 147#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 149#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 21#L794true, 68#true, Black: 91#(and (or (= |#ghost~multithreaded| 0) (and (= ~x~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0))) (= 0 ~x$w_buff0~0)), Black: 89#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= |#ghost~multithreaded| 0))), Black: 92#(and (= 0 ~x$w_buff1~0) (or (and (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)) (= |#ghost~multithreaded| 0))), Black: 161#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 157#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), 99#true, 62#true, Black: 174#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 103#(and (or (and (= ~x~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= 0 ~x$w_buff0~0)), Black: 105#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0~0 1) (or (and (= ~x~0 0) (<= ~x$r_buff1_thd2~0 0) (<= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 1 (+ ~x$r_buff1_thd2~0 ~x$w_buff0_used~0)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (= 1 ~x$r_buff0_thd2~0)), 4#L763true, P2Thread1of1ForFork1InUse, 141#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, 76#true, Black: 117#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 118#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), 176#true, Black: 121#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 60#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0))]) [2024-06-27 22:46:17,499 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-06-27 22:46:17,500 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 22:46:17,500 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 22:46:17,500 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 22:46:17,545 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([340] L747-->L763: Formula: (let ((.cse6 (= (mod v_~x$r_buff1_thd1~0_46 256) 0)) (.cse9 (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse7 (and .cse9 (= (mod v_~x$w_buff1_used~0_63 256) 0))) (.cse11 (= (mod v_~x$w_buff0_used~0_68 256) 0)) (.cse8 (and .cse9 .cse6))) (let ((.cse1 (or .cse7 .cse11 .cse8)) (.cse2 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse4 (= (mod v_~x$w_buff1_used~0_62 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_67 256) 0))) (and (= v_~x$w_buff0_used~0_67 (ite .cse0 v_~x$w_buff0_used~0_68 (ite .cse1 v_~x$w_buff0_used~0_68 (ite .cse2 0 v_~x$w_buff0_used~0_68)))) (= v_~x$r_buff1_thd1~0_45 (ite .cse0 v_~x$r_buff1_thd1~0_46 (ite (let ((.cse5 (= (mod v_~x$r_buff0_thd1~0_43 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse5 .cse6))) v_~x$r_buff1_thd1~0_46 0))) (= v_~__unbuffered_p0_EBX~0_24 (ite .cse1 v_~x~0_59 (ite .cse2 v_~x$w_buff0~0_33 v_~x$w_buff1~0_38))) (= v_~x~0_58 (ite .cse0 v_~x$mem_tmp~0_26 v_~__unbuffered_p0_EBX~0_24)) (= v_~x$w_buff1~0_38 v_~x$w_buff1~0_37) (= v_~x$w_buff1_used~0_62 (ite .cse0 v_~x$w_buff1_used~0_63 (ite (or .cse7 .cse3 .cse8) v_~x$w_buff1_used~0_63 0))) (= (ite .cse0 v_~x$r_buff0_thd1~0_44 (ite (or (and .cse9 .cse4) .cse3 .cse8) v_~x$r_buff0_thd1~0_44 (ite (and .cse10 (not .cse3)) 0 v_~x$r_buff0_thd1~0_44))) v_~x$r_buff0_thd1~0_43) (or (= v_~weak$$choice2~0_34 0) (= v_~weak$$choice2~0_34 1)) (= v_~x~0_59 v_~x$mem_tmp~0_26) (= v_~x$w_buff0~0_33 v_~x$w_buff0~0_32) (or (= v_~weak$$choice0~0_5 1) (= v_~weak$$choice0~0_5 0)) (= v_~x$flush_delayed~0_33 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_63, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_46, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_68} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_24, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_62, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_45, ~x$mem_tmp~0=v_~x$mem_tmp~0_26, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_67, ~weak$$choice0~0=v_~weak$$choice0~0_5, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_58} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0][95], [Black: 65#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)), 24#L804true, 114#true, 164#true, Black: 72#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)), 86#true, Black: 137#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (= ~x~0 0) (= ~__unbuffered_p0_EBX~0 0)) (= |#ghost~multithreaded| 0)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 70#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 131#(and (= ~x$w_buff0~0 1) (or (= |#ghost~multithreaded| 0) (and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0))) (= 1 ~x$r_buff0_thd2~0)), Black: 71#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)), Black: 129#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 153#true, Black: 78#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 79#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 15#L19-1true, Black: 80#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 81#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 146#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 147#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 149#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 68#true, Black: 91#(and (or (= |#ghost~multithreaded| 0) (and (= ~x~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0))) (= 0 ~x$w_buff0~0)), Black: 89#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= |#ghost~multithreaded| 0))), Black: 92#(and (= 0 ~x$w_buff1~0) (or (and (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)) (= |#ghost~multithreaded| 0))), Black: 161#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 157#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), 99#true, 14#P1EXITtrue, 62#true, Black: 174#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 103#(and (or (and (= ~x~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= 0 ~x$w_buff0~0)), Black: 105#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0~0 1) (or (and (= ~x~0 0) (<= ~x$r_buff1_thd2~0 0) (<= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 1 (+ ~x$r_buff1_thd2~0 ~x$w_buff0_used~0)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (= 1 ~x$r_buff0_thd2~0)), 4#L763true, P2Thread1of1ForFork1InUse, 141#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, 76#true, Black: 117#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 118#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 121#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 176#true, Black: 60#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0))]) [2024-06-27 22:46:17,546 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-06-27 22:46:17,546 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 22:46:17,546 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 22:46:17,546 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 22:46:17,547 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([340] L747-->L763: Formula: (let ((.cse6 (= (mod v_~x$r_buff1_thd1~0_46 256) 0)) (.cse9 (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse7 (and .cse9 (= (mod v_~x$w_buff1_used~0_63 256) 0))) (.cse11 (= (mod v_~x$w_buff0_used~0_68 256) 0)) (.cse8 (and .cse9 .cse6))) (let ((.cse1 (or .cse7 .cse11 .cse8)) (.cse2 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse4 (= (mod v_~x$w_buff1_used~0_62 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_67 256) 0))) (and (= v_~x$w_buff0_used~0_67 (ite .cse0 v_~x$w_buff0_used~0_68 (ite .cse1 v_~x$w_buff0_used~0_68 (ite .cse2 0 v_~x$w_buff0_used~0_68)))) (= v_~x$r_buff1_thd1~0_45 (ite .cse0 v_~x$r_buff1_thd1~0_46 (ite (let ((.cse5 (= (mod v_~x$r_buff0_thd1~0_43 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse5 .cse6))) v_~x$r_buff1_thd1~0_46 0))) (= v_~__unbuffered_p0_EBX~0_24 (ite .cse1 v_~x~0_59 (ite .cse2 v_~x$w_buff0~0_33 v_~x$w_buff1~0_38))) (= v_~x~0_58 (ite .cse0 v_~x$mem_tmp~0_26 v_~__unbuffered_p0_EBX~0_24)) (= v_~x$w_buff1~0_38 v_~x$w_buff1~0_37) (= v_~x$w_buff1_used~0_62 (ite .cse0 v_~x$w_buff1_used~0_63 (ite (or .cse7 .cse3 .cse8) v_~x$w_buff1_used~0_63 0))) (= (ite .cse0 v_~x$r_buff0_thd1~0_44 (ite (or (and .cse9 .cse4) .cse3 .cse8) v_~x$r_buff0_thd1~0_44 (ite (and .cse10 (not .cse3)) 0 v_~x$r_buff0_thd1~0_44))) v_~x$r_buff0_thd1~0_43) (or (= v_~weak$$choice2~0_34 0) (= v_~weak$$choice2~0_34 1)) (= v_~x~0_59 v_~x$mem_tmp~0_26) (= v_~x$w_buff0~0_33 v_~x$w_buff0~0_32) (or (= v_~weak$$choice0~0_5 1) (= v_~weak$$choice0~0_5 0)) (= v_~x$flush_delayed~0_33 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_63, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_46, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_68} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_24, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_62, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_45, ~x$mem_tmp~0=v_~x$mem_tmp~0_26, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_67, ~weak$$choice0~0=v_~weak$$choice0~0_5, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_58} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0][95], [Black: 65#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)), 24#L804true, 114#true, 164#true, Black: 72#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)), 86#true, Black: 137#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (= ~x~0 0) (= ~__unbuffered_p0_EBX~0 0)) (= |#ghost~multithreaded| 0)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 70#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 131#(and (= ~x$w_buff0~0 1) (or (= |#ghost~multithreaded| 0) (and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0))) (= 1 ~x$r_buff0_thd2~0)), Black: 71#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)), Black: 129#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 153#true, Black: 78#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 79#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 80#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 81#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 146#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 147#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 149#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 21#L794true, 68#true, Black: 91#(and (or (= |#ghost~multithreaded| 0) (and (= ~x~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0))) (= 0 ~x$w_buff0~0)), Black: 89#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= |#ghost~multithreaded| 0))), Black: 92#(and (= 0 ~x$w_buff1~0) (or (and (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)) (= |#ghost~multithreaded| 0))), Black: 161#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 157#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), 99#true, 3#ULTIMATE.startEXITtrue, 62#true, Black: 174#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 103#(and (or (and (= ~x~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= 0 ~x$w_buff0~0)), Black: 105#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0~0 1) (or (and (= ~x~0 0) (<= ~x$r_buff1_thd2~0 0) (<= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 1 (+ ~x$r_buff1_thd2~0 ~x$w_buff0_used~0)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (= 1 ~x$r_buff0_thd2~0)), 4#L763true, P2Thread1of1ForFork1InUse, 141#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, 76#true, Black: 117#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 118#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 121#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 176#true, Black: 60#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0))]) [2024-06-27 22:46:17,547 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-06-27 22:46:17,548 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 22:46:17,548 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 22:46:17,548 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 22:46:17,578 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([340] L747-->L763: Formula: (let ((.cse6 (= (mod v_~x$r_buff1_thd1~0_46 256) 0)) (.cse9 (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse7 (and .cse9 (= (mod v_~x$w_buff1_used~0_63 256) 0))) (.cse11 (= (mod v_~x$w_buff0_used~0_68 256) 0)) (.cse8 (and .cse9 .cse6))) (let ((.cse1 (or .cse7 .cse11 .cse8)) (.cse2 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse4 (= (mod v_~x$w_buff1_used~0_62 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_67 256) 0))) (and (= v_~x$w_buff0_used~0_67 (ite .cse0 v_~x$w_buff0_used~0_68 (ite .cse1 v_~x$w_buff0_used~0_68 (ite .cse2 0 v_~x$w_buff0_used~0_68)))) (= v_~x$r_buff1_thd1~0_45 (ite .cse0 v_~x$r_buff1_thd1~0_46 (ite (let ((.cse5 (= (mod v_~x$r_buff0_thd1~0_43 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse5 .cse6))) v_~x$r_buff1_thd1~0_46 0))) (= v_~__unbuffered_p0_EBX~0_24 (ite .cse1 v_~x~0_59 (ite .cse2 v_~x$w_buff0~0_33 v_~x$w_buff1~0_38))) (= v_~x~0_58 (ite .cse0 v_~x$mem_tmp~0_26 v_~__unbuffered_p0_EBX~0_24)) (= v_~x$w_buff1~0_38 v_~x$w_buff1~0_37) (= v_~x$w_buff1_used~0_62 (ite .cse0 v_~x$w_buff1_used~0_63 (ite (or .cse7 .cse3 .cse8) v_~x$w_buff1_used~0_63 0))) (= (ite .cse0 v_~x$r_buff0_thd1~0_44 (ite (or (and .cse9 .cse4) .cse3 .cse8) v_~x$r_buff0_thd1~0_44 (ite (and .cse10 (not .cse3)) 0 v_~x$r_buff0_thd1~0_44))) v_~x$r_buff0_thd1~0_43) (or (= v_~weak$$choice2~0_34 0) (= v_~weak$$choice2~0_34 1)) (= v_~x~0_59 v_~x$mem_tmp~0_26) (= v_~x$w_buff0~0_33 v_~x$w_buff0~0_32) (or (= v_~weak$$choice0~0_5 1) (= v_~weak$$choice0~0_5 0)) (= v_~x$flush_delayed~0_33 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_63, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_46, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_68} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_24, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_62, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_45, ~x$mem_tmp~0=v_~x$mem_tmp~0_26, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_67, ~weak$$choice0~0=v_~weak$$choice0~0_5, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_58} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0][95], [Black: 65#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)), 24#L804true, 114#true, 164#true, Black: 72#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)), 86#true, Black: 137#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (or (and (= ~x~0 0) (= ~__unbuffered_p0_EBX~0 0)) (= |#ghost~multithreaded| 0)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 70#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 131#(and (= ~x$w_buff0~0 1) (or (= |#ghost~multithreaded| 0) (and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0))) (= 1 ~x$r_buff0_thd2~0)), Black: 71#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)), Black: 129#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), 153#true, Black: 78#(and (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 79#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 80#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 81#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x~0 1) (<= 0 (div ~x$w_buff1_used~0 256)) (<= ~x$w_buff1_used~0 0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 146#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 147#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 149#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 68#true, Black: 91#(and (or (= |#ghost~multithreaded| 0) (and (= ~x~0 0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0))) (= 0 ~x$w_buff0~0)), Black: 89#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~y~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= |#ghost~multithreaded| 0))), Black: 92#(and (= 0 ~x$w_buff1~0) (or (and (= ~x~0 0) (<= ~x$w_buff0_used~0 1) (<= 0 (div ~x$w_buff0_used~0 256)) (= ~x$r_buff1_thd2~0 0) (= ~x$w_buff0~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)) (= |#ghost~multithreaded| 0))), Black: 161#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 157#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), 99#true, 14#P1EXITtrue, 3#ULTIMATE.startEXITtrue, 62#true, Black: 174#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0)), Black: 103#(and (or (and (= ~x~0 0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)) (= |#ghost~multithreaded| 0)) (= 0 ~x$w_buff0~0)), Black: 105#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff0~0 1) (or (and (= ~x~0 0) (<= ~x$r_buff1_thd2~0 0) (<= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (<= 1 (+ ~x$r_buff1_thd2~0 ~x$w_buff0_used~0)) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~x$w_buff1_used~0 1) (+ ~x$w_buff0_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (= ~x$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (= 1 ~x$r_buff0_thd2~0)), 4#L763true, P2Thread1of1ForFork1InUse, 141#true, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, 76#true, Black: 117#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~x$w_buff0_used~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 118#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$r_buff1_thd1~0 0)), Black: 121#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff0~0 1) (= ~x$w_buff0_used~0 1) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0) (= ~x$r_buff1_thd1~0 0)), 176#true, Black: 60#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p0_EAX~0 0) (= ~y~0 0) (= ~__unbuffered_p0_EBX~0 0) (= ~x$w_buff0_used~0 0) (= ~z~0 0) (= ~__unbuffered_p2_EAX~0 0) (= ~x$mem_tmp~0 0))]) [2024-06-27 22:46:17,579 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-06-27 22:46:17,579 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 22:46:17,579 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 22:46:17,579 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 22:46:17,601 INFO L124 PetriNetUnfolderBase]: 1611/3100 cut-off events. [2024-06-27 22:46:17,601 INFO L125 PetriNetUnfolderBase]: For 18252/18446 co-relation queries the response was YES. [2024-06-27 22:46:17,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13088 conditions, 3100 events. 1611/3100 cut-off events. For 18252/18446 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 22355 event pairs, 389 based on Foata normal form. 54/2958 useless extension candidates. Maximal degree in co-relation 13037. Up to 1771 conditions per place. [2024-06-27 22:46:17,627 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 80 selfloop transitions, 21 changer transitions 0/171 dead transitions. [2024-06-27 22:46:17,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 171 transitions, 2097 flow [2024-06-27 22:46:17,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:46:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:46:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-06-27 22:46:17,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7608695652173914 [2024-06-27 22:46:17,629 INFO L175 Difference]: Start difference. First operand has 116 places, 160 transitions, 1851 flow. Second operand 3 states and 105 transitions. [2024-06-27 22:46:17,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 171 transitions, 2097 flow [2024-06-27 22:46:17,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 171 transitions, 1967 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-27 22:46:17,671 INFO L231 Difference]: Finished difference. Result has 112 places, 159 transitions, 1759 flow [2024-06-27 22:46:17,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1717, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1759, PETRI_PLACES=112, PETRI_TRANSITIONS=159} [2024-06-27 22:46:17,673 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 60 predicate places. [2024-06-27 22:46:17,673 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 159 transitions, 1759 flow [2024-06-27 22:46:17,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:17,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:17,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:17,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:46:17,674 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:17,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:17,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1168258719, now seen corresponding path program 1 times [2024-06-27 22:46:17,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:17,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916438280] [2024-06-27 22:46:17,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:17,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:18,077 INFO 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:46:18,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:18,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916438280] [2024-06-27 22:46:18,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916438280] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:18,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:18,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:46:18,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303861649] [2024-06-27 22:46:18,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:18,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:46:18,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:18,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:46:18,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:46:18,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-06-27 22:46:18,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 159 transitions, 1759 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 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:46:18,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:18,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-06-27 22:46:18,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:18,709 INFO L124 PetriNetUnfolderBase]: 2458/4223 cut-off events. [2024-06-27 22:46:18,709 INFO L125 PetriNetUnfolderBase]: For 21773/21773 co-relation queries the response was YES. [2024-06-27 22:46:18,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17571 conditions, 4223 events. 2458/4223 cut-off events. For 21773/21773 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 27934 event pairs, 799 based on Foata normal form. 3/4094 useless extension candidates. Maximal degree in co-relation 17520. Up to 3529 conditions per place. [2024-06-27 22:46:18,735 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 165 selfloop transitions, 18 changer transitions 4/199 dead transitions. [2024-06-27 22:46:18,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 199 transitions, 2385 flow [2024-06-27 22:46:18,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:46:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:46:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2024-06-27 22:46:18,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5579710144927537 [2024-06-27 22:46:18,738 INFO L175 Difference]: Start difference. First operand has 112 places, 159 transitions, 1759 flow. Second operand 6 states and 154 transitions. [2024-06-27 22:46:18,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 199 transitions, 2385 flow [2024-06-27 22:46:18,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 199 transitions, 2333 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:46:18,779 INFO L231 Difference]: Finished difference. Result has 119 places, 173 transitions, 1936 flow [2024-06-27 22:46:18,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1717, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1936, PETRI_PLACES=119, PETRI_TRANSITIONS=173} [2024-06-27 22:46:18,780 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 67 predicate places. [2024-06-27 22:46:18,781 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 173 transitions, 1936 flow [2024-06-27 22:46:18,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 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:46:18,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:18,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:18,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:46:18,781 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:18,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:18,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2060491829, now seen corresponding path program 1 times [2024-06-27 22:46:18,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:18,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449501663] [2024-06-27 22:46:18,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:18,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:19,388 INFO 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:46:19,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:19,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449501663] [2024-06-27 22:46:19,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449501663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:19,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:19,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:46:19,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393295179] [2024-06-27 22:46:19,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:19,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:46:19,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:19,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:46:19,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:46:19,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-06-27 22:46:19,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 173 transitions, 1936 flow. Second operand has 8 states, 8 states have (on average 17.625) internal successors, (141), 8 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:19,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:19,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-06-27 22:46:19,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:20,008 INFO L124 PetriNetUnfolderBase]: 2036/3652 cut-off events. [2024-06-27 22:46:20,008 INFO L125 PetriNetUnfolderBase]: For 19710/19710 co-relation queries the response was YES. [2024-06-27 22:46:20,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15401 conditions, 3652 events. 2036/3652 cut-off events. For 19710/19710 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 24796 event pairs, 252 based on Foata normal form. 8/3516 useless extension candidates. Maximal degree in co-relation 15344. Up to 2375 conditions per place. [2024-06-27 22:46:20,075 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 147 selfloop transitions, 57 changer transitions 0/218 dead transitions. [2024-06-27 22:46:20,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 218 transitions, 2544 flow [2024-06-27 22:46:20,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:46:20,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:46:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2024-06-27 22:46:20,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6231884057971014 [2024-06-27 22:46:20,079 INFO L175 Difference]: Start difference. First operand has 119 places, 173 transitions, 1936 flow. Second operand 6 states and 172 transitions. [2024-06-27 22:46:20,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 218 transitions, 2544 flow [2024-06-27 22:46:20,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 218 transitions, 2538 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-06-27 22:46:20,112 INFO L231 Difference]: Finished difference. Result has 127 places, 186 transitions, 2259 flow [2024-06-27 22:46:20,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2259, PETRI_PLACES=127, PETRI_TRANSITIONS=186} [2024-06-27 22:46:20,113 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 75 predicate places. [2024-06-27 22:46:20,113 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 186 transitions, 2259 flow [2024-06-27 22:46:20,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.625) internal successors, (141), 8 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:20,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:20,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:20,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:46:20,114 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:20,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:20,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1053194789, now seen corresponding path program 2 times [2024-06-27 22:46:20,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:20,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073553782] [2024-06-27 22:46:20,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:20,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:20,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:46:20,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:20,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073553782] [2024-06-27 22:46:20,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073553782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:20,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:20,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:46:20,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94081715] [2024-06-27 22:46:20,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:20,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:46:20,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:20,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:46:20,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:46:20,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:46:20,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 186 transitions, 2259 flow. Second operand has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:20,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:20,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:46:20,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:21,390 INFO L124 PetriNetUnfolderBase]: 2112/3816 cut-off events. [2024-06-27 22:46:21,390 INFO L125 PetriNetUnfolderBase]: For 25192/25192 co-relation queries the response was YES. [2024-06-27 22:46:21,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17180 conditions, 3816 events. 2112/3816 cut-off events. For 25192/25192 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 26376 event pairs, 261 based on Foata normal form. 8/3682 useless extension candidates. Maximal degree in co-relation 17118. Up to 2207 conditions per place. [2024-06-27 22:46:21,419 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 148 selfloop transitions, 69 changer transitions 0/232 dead transitions. [2024-06-27 22:46:21,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 232 transitions, 2909 flow [2024-06-27 22:46:21,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:46:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:46:21,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 202 transitions. [2024-06-27 22:46:21,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6273291925465838 [2024-06-27 22:46:21,420 INFO L175 Difference]: Start difference. First operand has 127 places, 186 transitions, 2259 flow. Second operand 7 states and 202 transitions. [2024-06-27 22:46:21,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 232 transitions, 2909 flow [2024-06-27 22:46:21,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 232 transitions, 2887 flow, removed 11 selfloop flow, removed 0 redundant places. [2024-06-27 22:46:21,475 INFO L231 Difference]: Finished difference. Result has 136 places, 192 transitions, 2510 flow [2024-06-27 22:46:21,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2239, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2510, PETRI_PLACES=136, PETRI_TRANSITIONS=192} [2024-06-27 22:46:21,475 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 84 predicate places. [2024-06-27 22:46:21,475 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 192 transitions, 2510 flow [2024-06-27 22:46:21,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:21,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:21,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:21,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:46:21,476 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:21,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:21,477 INFO L85 PathProgramCache]: Analyzing trace with hash -199084867, now seen corresponding path program 3 times [2024-06-27 22:46:21,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:21,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388077857] [2024-06-27 22:46:21,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:21,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:22,134 INFO 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:46:22,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:22,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388077857] [2024-06-27 22:46:22,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388077857] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:22,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:22,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:46:22,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196132693] [2024-06-27 22:46:22,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:22,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:46:22,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:22,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:46:22,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:46:22,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:46:22,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 192 transitions, 2510 flow. Second operand has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:22,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:22,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:46:22,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:22,785 INFO L124 PetriNetUnfolderBase]: 2160/3926 cut-off events. [2024-06-27 22:46:22,785 INFO L125 PetriNetUnfolderBase]: For 29364/29364 co-relation queries the response was YES. [2024-06-27 22:46:22,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18439 conditions, 3926 events. 2160/3926 cut-off events. For 29364/29364 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 27555 event pairs, 382 based on Foata normal form. 8/3789 useless extension candidates. Maximal degree in co-relation 18372. Up to 2668 conditions per place. [2024-06-27 22:46:22,813 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 164 selfloop transitions, 49 changer transitions 0/228 dead transitions. [2024-06-27 22:46:22,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 228 transitions, 3058 flow [2024-06-27 22:46:22,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:46:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:46:22,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2024-06-27 22:46:22,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6149068322981367 [2024-06-27 22:46:22,814 INFO L175 Difference]: Start difference. First operand has 136 places, 192 transitions, 2510 flow. Second operand 7 states and 198 transitions. [2024-06-27 22:46:22,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 228 transitions, 3058 flow [2024-06-27 22:46:22,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 228 transitions, 3026 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-27 22:46:22,877 INFO L231 Difference]: Finished difference. Result has 142 places, 193 transitions, 2594 flow [2024-06-27 22:46:22,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2478, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2594, PETRI_PLACES=142, PETRI_TRANSITIONS=193} [2024-06-27 22:46:22,878 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 90 predicate places. [2024-06-27 22:46:22,878 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 193 transitions, 2594 flow [2024-06-27 22:46:22,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:22,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:22,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:22,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:46:22,879 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:22,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:22,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1053404039, now seen corresponding path program 4 times [2024-06-27 22:46:22,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:22,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444610301] [2024-06-27 22:46:22,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:22,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:23,612 INFO 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:46:23,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:23,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444610301] [2024-06-27 22:46:23,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444610301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:23,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:23,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:46:23,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948272254] [2024-06-27 22:46:23,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:23,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:46:23,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:23,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:46:23,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:46:23,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-06-27 22:46:23,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 193 transitions, 2594 flow. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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:46:23,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:23,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-06-27 22:46:23,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:24,340 INFO L124 PetriNetUnfolderBase]: 2313/4207 cut-off events. [2024-06-27 22:46:24,340 INFO L125 PetriNetUnfolderBase]: For 32249/32249 co-relation queries the response was YES. [2024-06-27 22:46:24,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20162 conditions, 4207 events. 2313/4207 cut-off events. For 32249/32249 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 29806 event pairs, 395 based on Foata normal form. 8/4075 useless extension candidates. Maximal degree in co-relation 20092. Up to 2934 conditions per place. [2024-06-27 22:46:24,370 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 190 selfloop transitions, 48 changer transitions 0/252 dead transitions. [2024-06-27 22:46:24,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 252 transitions, 3513 flow [2024-06-27 22:46:24,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:46:24,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:46:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 234 transitions. [2024-06-27 22:46:24,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2024-06-27 22:46:24,372 INFO L175 Difference]: Start difference. First operand has 142 places, 193 transitions, 2594 flow. Second operand 9 states and 234 transitions. [2024-06-27 22:46:24,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 252 transitions, 3513 flow [2024-06-27 22:46:24,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 252 transitions, 3380 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-27 22:46:24,439 INFO L231 Difference]: Finished difference. Result has 149 places, 211 transitions, 2923 flow [2024-06-27 22:46:24,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2494, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2923, PETRI_PLACES=149, PETRI_TRANSITIONS=211} [2024-06-27 22:46:24,440 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 97 predicate places. [2024-06-27 22:46:24,440 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 211 transitions, 2923 flow [2024-06-27 22:46:24,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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:46:24,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:24,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:46:24,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:46:24,441 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:24,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:24,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1487955769, now seen corresponding path program 5 times [2024-06-27 22:46:24,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:24,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806834489] [2024-06-27 22:46:24,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:24,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:25,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:25,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806834489] [2024-06-27 22:46:25,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806834489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:25,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:25,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:46:25,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769832179] [2024-06-27 22:46:25,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:25,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:46:25,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:25,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:46:25,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:46:25,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-06-27 22:46:25,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 211 transitions, 2923 flow. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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:46:25,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:25,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-06-27 22:46:25,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:25,997 INFO L124 PetriNetUnfolderBase]: 2298/4187 cut-off events. [2024-06-27 22:46:25,997 INFO L125 PetriNetUnfolderBase]: For 33958/33958 co-relation queries the response was YES. [2024-06-27 22:46:26,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20192 conditions, 4187 events. 2298/4187 cut-off events. For 33958/33958 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 29654 event pairs, 388 based on Foata normal form. 8/4039 useless extension candidates. Maximal degree in co-relation 20117. Up to 2806 conditions per place. [2024-06-27 22:46:26,032 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 175 selfloop transitions, 66 changer transitions 0/255 dead transitions. [2024-06-27 22:46:26,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 255 transitions, 3648 flow [2024-06-27 22:46:26,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:46:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:46:26,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 232 transitions. [2024-06-27 22:46:26,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5603864734299517 [2024-06-27 22:46:26,034 INFO L175 Difference]: Start difference. First operand has 149 places, 211 transitions, 2923 flow. Second operand 9 states and 232 transitions. [2024-06-27 22:46:26,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 255 transitions, 3648 flow [2024-06-27 22:46:26,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 255 transitions, 3564 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-27 22:46:26,110 INFO L231 Difference]: Finished difference. Result has 154 places, 218 transitions, 3133 flow [2024-06-27 22:46:26,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2809, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3133, PETRI_PLACES=154, PETRI_TRANSITIONS=218} [2024-06-27 22:46:26,110 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 102 predicate places. [2024-06-27 22:46:26,110 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 218 transitions, 3133 flow [2024-06-27 22:46:26,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 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:46:26,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:26,111 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:46:26,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:46:26,111 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:26,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:26,112 INFO L85 PathProgramCache]: Analyzing trace with hash 632231328, now seen corresponding path program 1 times [2024-06-27 22:46:26,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:26,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12788398] [2024-06-27 22:46:26,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:26,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:26,639 INFO 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:46:26,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:26,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12788398] [2024-06-27 22:46:26,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12788398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:26,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:26,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:46:26,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581399853] [2024-06-27 22:46:26,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:26,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:46:26,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:26,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:46:26,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:46:26,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-06-27 22:46:26,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 218 transitions, 3133 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:26,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:26,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-06-27 22:46:26,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:27,538 INFO L124 PetriNetUnfolderBase]: 2926/5306 cut-off events. [2024-06-27 22:46:27,538 INFO L125 PetriNetUnfolderBase]: For 41844/41844 co-relation queries the response was YES. [2024-06-27 22:46:27,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25483 conditions, 5306 events. 2926/5306 cut-off events. For 41844/41844 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 38739 event pairs, 565 based on Foata normal form. 9/5109 useless extension candidates. Maximal degree in co-relation 25407. Up to 3596 conditions per place. [2024-06-27 22:46:27,580 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 210 selfloop transitions, 75 changer transitions 0/297 dead transitions. [2024-06-27 22:46:27,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 297 transitions, 4319 flow [2024-06-27 22:46:27,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:46:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:46:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2024-06-27 22:46:27,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.538647342995169 [2024-06-27 22:46:27,582 INFO L175 Difference]: Start difference. First operand has 154 places, 218 transitions, 3133 flow. Second operand 9 states and 223 transitions. [2024-06-27 22:46:27,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 297 transitions, 4319 flow [2024-06-27 22:46:27,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 297 transitions, 4146 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-06-27 22:46:27,684 INFO L231 Difference]: Finished difference. Result has 157 places, 245 transitions, 3490 flow [2024-06-27 22:46:27,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2964, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3490, PETRI_PLACES=157, PETRI_TRANSITIONS=245} [2024-06-27 22:46:27,684 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 105 predicate places. [2024-06-27 22:46:27,685 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 245 transitions, 3490 flow [2024-06-27 22:46:27,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:27,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:27,685 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:46:27,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:46:27,685 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:27,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:27,686 INFO L85 PathProgramCache]: Analyzing trace with hash -2143259684, now seen corresponding path program 2 times [2024-06-27 22:46:27,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:27,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435823688] [2024-06-27 22:46:27,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:27,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:28,104 INFO 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:46:28,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:28,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435823688] [2024-06-27 22:46:28,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435823688] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:28,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:28,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:46:28,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253210509] [2024-06-27 22:46:28,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:28,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:46:28,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:28,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:46:28,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:46:28,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-06-27 22:46:28,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 245 transitions, 3490 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:28,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:28,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-06-27 22:46:28,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:29,097 INFO L124 PetriNetUnfolderBase]: 3043/5462 cut-off events. [2024-06-27 22:46:29,097 INFO L125 PetriNetUnfolderBase]: For 44240/44240 co-relation queries the response was YES. [2024-06-27 22:46:29,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26290 conditions, 5462 events. 3043/5462 cut-off events. For 44240/44240 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 39768 event pairs, 471 based on Foata normal form. 9/5274 useless extension candidates. Maximal degree in co-relation 26214. Up to 3419 conditions per place. [2024-06-27 22:46:29,145 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 187 selfloop transitions, 81 changer transitions 0/280 dead transitions. [2024-06-27 22:46:29,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 280 transitions, 4200 flow [2024-06-27 22:46:29,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:46:29,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:46:29,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2024-06-27 22:46:29,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5559006211180124 [2024-06-27 22:46:29,147 INFO L175 Difference]: Start difference. First operand has 157 places, 245 transitions, 3490 flow. Second operand 7 states and 179 transitions. [2024-06-27 22:46:29,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 280 transitions, 4200 flow [2024-06-27 22:46:29,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 280 transitions, 4144 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-27 22:46:29,267 INFO L231 Difference]: Finished difference. Result has 161 places, 246 transitions, 3610 flow [2024-06-27 22:46:29,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3434, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3610, PETRI_PLACES=161, PETRI_TRANSITIONS=246} [2024-06-27 22:46:29,268 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 109 predicate places. [2024-06-27 22:46:29,268 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 246 transitions, 3610 flow [2024-06-27 22:46:29,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:29,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:29,268 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:46:29,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:46:29,269 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:29,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:29,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1709756000, now seen corresponding path program 3 times [2024-06-27 22:46:29,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:29,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143834020] [2024-06-27 22:46:29,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:29,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:29,739 INFO 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:46:29,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:29,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143834020] [2024-06-27 22:46:29,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143834020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:29,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:29,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:46:29,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138638528] [2024-06-27 22:46:29,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:29,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:46:29,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:29,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:46:29,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:46:29,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-06-27 22:46:29,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 246 transitions, 3610 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:29,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:29,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-06-27 22:46:29,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:30,742 INFO L124 PetriNetUnfolderBase]: 3022/5476 cut-off events. [2024-06-27 22:46:30,742 INFO L125 PetriNetUnfolderBase]: For 46695/46695 co-relation queries the response was YES. [2024-06-27 22:46:30,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26589 conditions, 5476 events. 3022/5476 cut-off events. For 46695/46695 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 40243 event pairs, 547 based on Foata normal form. 9/5273 useless extension candidates. Maximal degree in co-relation 26511. Up to 3905 conditions per place. [2024-06-27 22:46:30,788 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 191 selfloop transitions, 78 changer transitions 0/281 dead transitions. [2024-06-27 22:46:30,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 281 transitions, 4309 flow [2024-06-27 22:46:30,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:46:30,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:46:30,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2024-06-27 22:46:30,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2024-06-27 22:46:30,790 INFO L175 Difference]: Start difference. First operand has 161 places, 246 transitions, 3610 flow. Second operand 8 states and 192 transitions. [2024-06-27 22:46:30,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 281 transitions, 4309 flow [2024-06-27 22:46:30,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 281 transitions, 4172 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-27 22:46:30,914 INFO L231 Difference]: Finished difference. Result has 164 places, 246 transitions, 3638 flow [2024-06-27 22:46:30,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3473, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3638, PETRI_PLACES=164, PETRI_TRANSITIONS=246} [2024-06-27 22:46:30,914 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 112 predicate places. [2024-06-27 22:46:30,914 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 246 transitions, 3638 flow [2024-06-27 22:46:30,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:30,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:30,915 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:46:30,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:46:30,915 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:30,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:30,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1360268610, now seen corresponding path program 4 times [2024-06-27 22:46:30,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:30,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210978990] [2024-06-27 22:46:30,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:30,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:31,292 INFO 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:46:31,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:31,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210978990] [2024-06-27 22:46:31,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210978990] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:31,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:31,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:46:31,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558790521] [2024-06-27 22:46:31,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:31,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:46:31,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:31,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:46:31,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:46:31,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-06-27 22:46:31,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 246 transitions, 3638 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:31,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:31,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-06-27 22:46:31,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:32,140 INFO L124 PetriNetUnfolderBase]: 3001/5423 cut-off events. [2024-06-27 22:46:32,141 INFO L125 PetriNetUnfolderBase]: For 46681/46681 co-relation queries the response was YES. [2024-06-27 22:46:32,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26035 conditions, 5423 events. 3001/5423 cut-off events. For 46681/46681 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 39595 event pairs, 465 based on Foata normal form. 9/5226 useless extension candidates. Maximal degree in co-relation 25958. Up to 3536 conditions per place. [2024-06-27 22:46:32,186 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 178 selfloop transitions, 80 changer transitions 0/270 dead transitions. [2024-06-27 22:46:32,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 270 transitions, 4240 flow [2024-06-27 22:46:32,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:46:32,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:46:32,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-06-27 22:46:32,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5248447204968945 [2024-06-27 22:46:32,187 INFO L175 Difference]: Start difference. First operand has 164 places, 246 transitions, 3638 flow. Second operand 7 states and 169 transitions. [2024-06-27 22:46:32,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 270 transitions, 4240 flow [2024-06-27 22:46:32,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 270 transitions, 4084 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-27 22:46:32,321 INFO L231 Difference]: Finished difference. Result has 165 places, 246 transitions, 3671 flow [2024-06-27 22:46:32,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3482, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3671, PETRI_PLACES=165, PETRI_TRANSITIONS=246} [2024-06-27 22:46:32,322 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 113 predicate places. [2024-06-27 22:46:32,322 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 246 transitions, 3671 flow [2024-06-27 22:46:32,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:32,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:32,322 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:46:32,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:46:32,323 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:32,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:32,323 INFO L85 PathProgramCache]: Analyzing trace with hash 159298503, now seen corresponding path program 1 times [2024-06-27 22:46:32,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:32,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177604221] [2024-06-27 22:46:32,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:32,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:32,704 INFO 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:46:32,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:32,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177604221] [2024-06-27 22:46:32,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177604221] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:32,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:32,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:46:32,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122085527] [2024-06-27 22:46:32,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:32,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:46:32,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:32,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:46:32,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:46:32,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-06-27 22:46:32,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 246 transitions, 3671 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:32,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:32,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-06-27 22:46:32,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:33,394 INFO L124 PetriNetUnfolderBase]: 2539/4799 cut-off events. [2024-06-27 22:46:33,394 INFO L125 PetriNetUnfolderBase]: For 46366/46470 co-relation queries the response was YES. [2024-06-27 22:46:33,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23092 conditions, 4799 events. 2539/4799 cut-off events. For 46366/46470 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 36472 event pairs, 797 based on Foata normal form. 95/4674 useless extension candidates. Maximal degree in co-relation 23015. Up to 3654 conditions per place. [2024-06-27 22:46:33,429 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 200 selfloop transitions, 51 changer transitions 0/274 dead transitions. [2024-06-27 22:46:33,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 274 transitions, 4363 flow [2024-06-27 22:46:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:46:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:46:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2024-06-27 22:46:33,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6231884057971014 [2024-06-27 22:46:33,431 INFO L175 Difference]: Start difference. First operand has 165 places, 246 transitions, 3671 flow. Second operand 6 states and 172 transitions. [2024-06-27 22:46:33,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 274 transitions, 4363 flow [2024-06-27 22:46:33,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 274 transitions, 4181 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-27 22:46:33,534 INFO L231 Difference]: Finished difference. Result has 163 places, 254 transitions, 3708 flow [2024-06-27 22:46:33,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3493, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3708, PETRI_PLACES=163, PETRI_TRANSITIONS=254} [2024-06-27 22:46:33,534 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 111 predicate places. [2024-06-27 22:46:33,535 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 254 transitions, 3708 flow [2024-06-27 22:46:33,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:33,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:33,535 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:46:33,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:46:33,535 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:33,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:33,536 INFO L85 PathProgramCache]: Analyzing trace with hash 159418473, now seen corresponding path program 2 times [2024-06-27 22:46:33,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:33,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587200033] [2024-06-27 22:46:33,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:33,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:33,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:46:33,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:33,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587200033] [2024-06-27 22:46:33,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587200033] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:33,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:33,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:46:33,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953711061] [2024-06-27 22:46:33,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:33,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:46:33,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:33,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:46:33,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:46:33,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-06-27 22:46:33,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 254 transitions, 3708 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:33,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:33,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-06-27 22:46:33,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:34,558 INFO L124 PetriNetUnfolderBase]: 2572/4844 cut-off events. [2024-06-27 22:46:34,558 INFO L125 PetriNetUnfolderBase]: For 44556/44663 co-relation queries the response was YES. [2024-06-27 22:46:34,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23369 conditions, 4844 events. 2572/4844 cut-off events. For 44556/44663 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 36711 event pairs, 797 based on Foata normal form. 95/4719 useless extension candidates. Maximal degree in co-relation 23294. Up to 3729 conditions per place. [2024-06-27 22:46:34,596 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 212 selfloop transitions, 43 changer transitions 0/278 dead transitions. [2024-06-27 22:46:34,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 278 transitions, 4371 flow [2024-06-27 22:46:34,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:46:34,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:46:34,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 167 transitions. [2024-06-27 22:46:34,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.605072463768116 [2024-06-27 22:46:34,615 INFO L175 Difference]: Start difference. First operand has 163 places, 254 transitions, 3708 flow. Second operand 6 states and 167 transitions. [2024-06-27 22:46:34,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 278 transitions, 4371 flow [2024-06-27 22:46:34,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 278 transitions, 4268 flow, removed 30 selfloop flow, removed 2 redundant places. [2024-06-27 22:46:34,733 INFO L231 Difference]: Finished difference. Result has 167 places, 262 transitions, 3817 flow [2024-06-27 22:46:34,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3619, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3817, PETRI_PLACES=167, PETRI_TRANSITIONS=262} [2024-06-27 22:46:34,734 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 115 predicate places. [2024-06-27 22:46:34,734 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 262 transitions, 3817 flow [2024-06-27 22:46:34,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:34,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:34,734 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:46:34,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:46:34,735 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:34,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:34,735 INFO L85 PathProgramCache]: Analyzing trace with hash 159418659, now seen corresponding path program 1 times [2024-06-27 22:46:34,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:34,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584069625] [2024-06-27 22:46:34,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:34,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:35,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:35,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:35,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584069625] [2024-06-27 22:46:35,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584069625] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:35,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:35,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:46:35,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137177823] [2024-06-27 22:46:35,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:35,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:46:35,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:35,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:46:35,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:46:35,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:46:35,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 262 transitions, 3817 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 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:46:35,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:35,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:46:35,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:35,782 INFO L124 PetriNetUnfolderBase]: 2744/5058 cut-off events. [2024-06-27 22:46:35,783 INFO L125 PetriNetUnfolderBase]: For 46791/46791 co-relation queries the response was YES. [2024-06-27 22:46:35,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24578 conditions, 5058 events. 2744/5058 cut-off events. For 46791/46791 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 37618 event pairs, 834 based on Foata normal form. 1/4854 useless extension candidates. Maximal degree in co-relation 24501. Up to 4007 conditions per place. [2024-06-27 22:46:35,825 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 256 selfloop transitions, 30 changer transitions 0/301 dead transitions. [2024-06-27 22:46:35,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 301 transitions, 4752 flow [2024-06-27 22:46:35,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:46:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:46:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-06-27 22:46:35,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5978260869565217 [2024-06-27 22:46:35,827 INFO L175 Difference]: Start difference. First operand has 167 places, 262 transitions, 3817 flow. Second operand 6 states and 165 transitions. [2024-06-27 22:46:35,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 301 transitions, 4752 flow [2024-06-27 22:46:35,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 301 transitions, 4622 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-27 22:46:35,953 INFO L231 Difference]: Finished difference. Result has 173 places, 283 transitions, 4080 flow [2024-06-27 22:46:35,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3706, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4080, PETRI_PLACES=173, PETRI_TRANSITIONS=283} [2024-06-27 22:46:35,954 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 121 predicate places. [2024-06-27 22:46:35,954 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 283 transitions, 4080 flow [2024-06-27 22:46:35,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 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:46:35,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:35,954 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:46:35,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:46:35,955 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:35,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:35,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2143253701, now seen corresponding path program 2 times [2024-06-27 22:46:35,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:35,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504855700] [2024-06-27 22:46:35,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:35,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:36,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:46:36,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:36,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504855700] [2024-06-27 22:46:36,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504855700] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:36,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:36,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:46:36,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325109310] [2024-06-27 22:46:36,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:36,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:46:36,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:36,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:46:36,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:46:36,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:46:36,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 283 transitions, 4080 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 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:46:36,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:36,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:46:36,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:36,913 INFO L124 PetriNetUnfolderBase]: 2753/5073 cut-off events. [2024-06-27 22:46:36,914 INFO L125 PetriNetUnfolderBase]: For 49258/49258 co-relation queries the response was YES. [2024-06-27 22:46:36,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25216 conditions, 5073 events. 2753/5073 cut-off events. For 49258/49258 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 37838 event pairs, 837 based on Foata normal form. 1/4868 useless extension candidates. Maximal degree in co-relation 25135. Up to 4049 conditions per place. [2024-06-27 22:46:36,957 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 266 selfloop transitions, 17 changer transitions 0/298 dead transitions. [2024-06-27 22:46:36,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 298 transitions, 4730 flow [2024-06-27 22:46:36,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:46:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:46:36,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-06-27 22:46:36,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5869565217391305 [2024-06-27 22:46:36,959 INFO L175 Difference]: Start difference. First operand has 173 places, 283 transitions, 4080 flow. Second operand 5 states and 135 transitions. [2024-06-27 22:46:36,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 298 transitions, 4730 flow [2024-06-27 22:46:37,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 298 transitions, 4666 flow, removed 32 selfloop flow, removed 0 redundant places. [2024-06-27 22:46:37,085 INFO L231 Difference]: Finished difference. Result has 178 places, 287 transitions, 4121 flow [2024-06-27 22:46:37,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4020, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4121, PETRI_PLACES=178, PETRI_TRANSITIONS=287} [2024-06-27 22:46:37,086 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 126 predicate places. [2024-06-27 22:46:37,086 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 287 transitions, 4121 flow [2024-06-27 22:46:37,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 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:46:37,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:37,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:46:37,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:46:37,087 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:37,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:37,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2143519867, now seen corresponding path program 3 times [2024-06-27 22:46:37,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:37,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984378057] [2024-06-27 22:46:37,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:37,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:37,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:37,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:37,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984378057] [2024-06-27 22:46:37,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984378057] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:37,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:37,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:46:37,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833455888] [2024-06-27 22:46:37,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:37,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:46:37,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:37,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:46:37,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:46:37,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-06-27 22:46:37,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 287 transitions, 4121 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:37,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:37,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-06-27 22:46:37,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:38,188 INFO L124 PetriNetUnfolderBase]: 2638/4930 cut-off events. [2024-06-27 22:46:38,189 INFO L125 PetriNetUnfolderBase]: For 50529/50577 co-relation queries the response was YES. [2024-06-27 22:46:38,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24409 conditions, 4930 events. 2638/4930 cut-off events. For 50529/50577 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 37063 event pairs, 784 based on Foata normal form. 33/4750 useless extension candidates. Maximal degree in co-relation 24325. Up to 3750 conditions per place. [2024-06-27 22:46:38,232 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 221 selfloop transitions, 54 changer transitions 0/304 dead transitions. [2024-06-27 22:46:38,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 304 transitions, 4719 flow [2024-06-27 22:46:38,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:46:38,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:46:38,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2024-06-27 22:46:38,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6391304347826087 [2024-06-27 22:46:38,234 INFO L175 Difference]: Start difference. First operand has 178 places, 287 transitions, 4121 flow. Second operand 5 states and 147 transitions. [2024-06-27 22:46:38,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 304 transitions, 4719 flow [2024-06-27 22:46:38,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 304 transitions, 4640 flow, removed 26 selfloop flow, removed 2 redundant places. [2024-06-27 22:46:38,366 INFO L231 Difference]: Finished difference. Result has 181 places, 287 transitions, 4171 flow [2024-06-27 22:46:38,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4042, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4171, PETRI_PLACES=181, PETRI_TRANSITIONS=287} [2024-06-27 22:46:38,367 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 129 predicate places. [2024-06-27 22:46:38,367 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 287 transitions, 4171 flow [2024-06-27 22:46:38,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:38,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:38,368 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:46:38,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:46:38,368 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:38,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:38,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2136369841, now seen corresponding path program 3 times [2024-06-27 22:46:38,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:38,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440535372] [2024-06-27 22:46:38,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:38,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:38,704 INFO 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:46:38,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:38,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440535372] [2024-06-27 22:46:38,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440535372] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:38,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:38,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:46:38,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209075589] [2024-06-27 22:46:38,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:38,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:46:38,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:38,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:46:38,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:46:38,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:46:38,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 287 transitions, 4171 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 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:46:38,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:38,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:46:38,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:39,416 INFO L124 PetriNetUnfolderBase]: 2744/5061 cut-off events. [2024-06-27 22:46:39,417 INFO L125 PetriNetUnfolderBase]: For 52345/52345 co-relation queries the response was YES. [2024-06-27 22:46:39,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25357 conditions, 5061 events. 2744/5061 cut-off events. For 52345/52345 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 37734 event pairs, 840 based on Foata normal form. 1/4857 useless extension candidates. Maximal degree in co-relation 25272. Up to 4006 conditions per place. [2024-06-27 22:46:39,455 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 253 selfloop transitions, 35 changer transitions 0/303 dead transitions. [2024-06-27 22:46:39,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 303 transitions, 4807 flow [2024-06-27 22:46:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:46:39,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:46:39,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2024-06-27 22:46:39,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6130434782608696 [2024-06-27 22:46:39,458 INFO L175 Difference]: Start difference. First operand has 181 places, 287 transitions, 4171 flow. Second operand 5 states and 141 transitions. [2024-06-27 22:46:39,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 303 transitions, 4807 flow [2024-06-27 22:46:39,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 303 transitions, 4671 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-27 22:46:39,584 INFO L231 Difference]: Finished difference. Result has 183 places, 289 transitions, 4159 flow [2024-06-27 22:46:39,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4037, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4159, PETRI_PLACES=183, PETRI_TRANSITIONS=289} [2024-06-27 22:46:39,585 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 131 predicate places. [2024-06-27 22:46:39,585 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 289 transitions, 4159 flow [2024-06-27 22:46:39,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 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:46:39,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:39,586 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:46:39,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:46:39,586 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:39,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:39,586 INFO L85 PathProgramCache]: Analyzing trace with hash -617925461, now seen corresponding path program 1 times [2024-06-27 22:46:39,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:39,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848604796] [2024-06-27 22:46:39,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:39,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:40,073 INFO 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:46:40,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:40,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848604796] [2024-06-27 22:46:40,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848604796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:40,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:40,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:46:40,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581542161] [2024-06-27 22:46:40,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:40,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:46:40,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:40,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:46:40,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:46:40,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-06-27 22:46:40,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 289 transitions, 4159 flow. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:40,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:40,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-06-27 22:46:40,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:40,882 INFO L124 PetriNetUnfolderBase]: 2706/5101 cut-off events. [2024-06-27 22:46:40,882 INFO L125 PetriNetUnfolderBase]: For 54637/54665 co-relation queries the response was YES. [2024-06-27 22:46:40,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25223 conditions, 5101 events. 2706/5101 cut-off events. For 54637/54665 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 38915 event pairs, 712 based on Foata normal form. 27/4905 useless extension candidates. Maximal degree in co-relation 25136. Up to 3572 conditions per place. [2024-06-27 22:46:40,932 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 215 selfloop transitions, 89 changer transitions 0/334 dead transitions. [2024-06-27 22:46:40,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 334 transitions, 5070 flow [2024-06-27 22:46:40,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:46:40,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:46:40,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 205 transitions. [2024-06-27 22:46:40,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6366459627329193 [2024-06-27 22:46:40,934 INFO L175 Difference]: Start difference. First operand has 183 places, 289 transitions, 4159 flow. Second operand 7 states and 205 transitions. [2024-06-27 22:46:40,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 334 transitions, 5070 flow [2024-06-27 22:46:41,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 334 transitions, 4991 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-27 22:46:41,100 INFO L231 Difference]: Finished difference. Result has 189 places, 299 transitions, 4471 flow [2024-06-27 22:46:41,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4082, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4471, PETRI_PLACES=189, PETRI_TRANSITIONS=299} [2024-06-27 22:46:41,101 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 137 predicate places. [2024-06-27 22:46:41,101 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 299 transitions, 4471 flow [2024-06-27 22:46:41,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:41,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:41,101 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:46:41,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:46:41,102 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:41,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:41,102 INFO L85 PathProgramCache]: Analyzing trace with hash -617835251, now seen corresponding path program 2 times [2024-06-27 22:46:41,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:41,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987382512] [2024-06-27 22:46:41,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:41,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:41,650 INFO 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:46:41,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:41,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987382512] [2024-06-27 22:46:41,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987382512] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:41,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:41,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:46:41,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653300120] [2024-06-27 22:46:41,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:41,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:46:41,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:41,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:46:41,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:46:41,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:46:41,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 299 transitions, 4471 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:41,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:41,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:46:41,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:42,468 INFO L124 PetriNetUnfolderBase]: 2798/5228 cut-off events. [2024-06-27 22:46:42,468 INFO L125 PetriNetUnfolderBase]: For 61136/61158 co-relation queries the response was YES. [2024-06-27 22:46:42,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27056 conditions, 5228 events. 2798/5228 cut-off events. For 61136/61158 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 39781 event pairs, 541 based on Foata normal form. 27/5034 useless extension candidates. Maximal degree in co-relation 26966. Up to 3285 conditions per place. [2024-06-27 22:46:42,516 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 179 selfloop transitions, 128 changer transitions 0/336 dead transitions. [2024-06-27 22:46:42,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 336 transitions, 5411 flow [2024-06-27 22:46:42,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:46:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:46:42,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-06-27 22:46:42,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5706521739130435 [2024-06-27 22:46:42,517 INFO L175 Difference]: Start difference. First operand has 189 places, 299 transitions, 4471 flow. Second operand 8 states and 210 transitions. [2024-06-27 22:46:42,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 336 transitions, 5411 flow [2024-06-27 22:46:42,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 336 transitions, 5326 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-06-27 22:46:42,704 INFO L231 Difference]: Finished difference. Result has 195 places, 309 transitions, 4824 flow [2024-06-27 22:46:42,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4388, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4824, PETRI_PLACES=195, PETRI_TRANSITIONS=309} [2024-06-27 22:46:42,705 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 143 predicate places. [2024-06-27 22:46:42,705 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 309 transitions, 4824 flow [2024-06-27 22:46:42,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:42,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:42,706 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:46:42,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:46:42,706 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:42,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:42,706 INFO L85 PathProgramCache]: Analyzing trace with hash 643287910, now seen corresponding path program 1 times [2024-06-27 22:46:42,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:42,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533066985] [2024-06-27 22:46:42,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:42,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:43,105 INFO 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:46:43,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:43,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533066985] [2024-06-27 22:46:43,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533066985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:43,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:43,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:46:43,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432803046] [2024-06-27 22:46:43,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:43,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:46:43,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:43,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:46:43,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:46:43,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:46:43,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 309 transitions, 4824 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:46:43,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:43,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:46:43,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:43,918 INFO L124 PetriNetUnfolderBase]: 2946/5412 cut-off events. [2024-06-27 22:46:43,918 INFO L125 PetriNetUnfolderBase]: For 66417/66417 co-relation queries the response was YES. [2024-06-27 22:46:43,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28832 conditions, 5412 events. 2946/5412 cut-off events. For 66417/66417 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 40716 event pairs, 864 based on Foata normal form. 1/5199 useless extension candidates. Maximal degree in co-relation 28741. Up to 4248 conditions per place. [2024-06-27 22:46:43,966 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 281 selfloop transitions, 53 changer transitions 0/349 dead transitions. [2024-06-27 22:46:43,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 349 transitions, 5823 flow [2024-06-27 22:46:43,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:46:43,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:46:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 193 transitions. [2024-06-27 22:46:43,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5993788819875776 [2024-06-27 22:46:43,968 INFO L175 Difference]: Start difference. First operand has 195 places, 309 transitions, 4824 flow. Second operand 7 states and 193 transitions. [2024-06-27 22:46:43,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 349 transitions, 5823 flow [2024-06-27 22:46:44,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 349 transitions, 5647 flow, removed 32 selfloop flow, removed 3 redundant places. [2024-06-27 22:46:44,138 INFO L231 Difference]: Finished difference. Result has 201 places, 325 transitions, 5009 flow [2024-06-27 22:46:44,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4648, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5009, PETRI_PLACES=201, PETRI_TRANSITIONS=325} [2024-06-27 22:46:44,139 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 149 predicate places. [2024-06-27 22:46:44,139 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 325 transitions, 5009 flow [2024-06-27 22:46:44,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:46:44,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:44,139 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:46:44,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:46:44,140 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:44,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:44,140 INFO L85 PathProgramCache]: Analyzing trace with hash 647006825, now seen corresponding path program 3 times [2024-06-27 22:46:44,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:44,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20321994] [2024-06-27 22:46:44,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:44,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:44,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:44,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20321994] [2024-06-27 22:46:44,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20321994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:44,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:44,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:46:44,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829194039] [2024-06-27 22:46:44,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:44,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:46:44,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:44,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:46:44,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:46:44,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-06-27 22:46:44,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 325 transitions, 5009 flow. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:44,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:44,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-06-27 22:46:44,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:45,610 INFO L124 PetriNetUnfolderBase]: 3018/5582 cut-off events. [2024-06-27 22:46:45,611 INFO L125 PetriNetUnfolderBase]: For 71126/71168 co-relation queries the response was YES. [2024-06-27 22:46:45,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30127 conditions, 5582 events. 3018/5582 cut-off events. For 71126/71168 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 42785 event pairs, 536 based on Foata normal form. 35/5393 useless extension candidates. Maximal degree in co-relation 30033. Up to 3672 conditions per place. [2024-06-27 22:46:45,658 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 216 selfloop transitions, 122 changer transitions 0/371 dead transitions. [2024-06-27 22:46:45,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 371 transitions, 6137 flow [2024-06-27 22:46:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:46:45,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:46:45,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 195 transitions. [2024-06-27 22:46:45,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6055900621118012 [2024-06-27 22:46:45,660 INFO L175 Difference]: Start difference. First operand has 201 places, 325 transitions, 5009 flow. Second operand 7 states and 195 transitions. [2024-06-27 22:46:45,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 371 transitions, 6137 flow [2024-06-27 22:46:45,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 371 transitions, 6002 flow, removed 38 selfloop flow, removed 3 redundant places. [2024-06-27 22:46:45,846 INFO L231 Difference]: Finished difference. Result has 206 places, 346 transitions, 5472 flow [2024-06-27 22:46:45,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4874, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5472, PETRI_PLACES=206, PETRI_TRANSITIONS=346} [2024-06-27 22:46:45,847 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 154 predicate places. [2024-06-27 22:46:45,847 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 346 transitions, 5472 flow [2024-06-27 22:46:45,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:45,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:45,847 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:46:45,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:46:45,848 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:45,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:45,848 INFO L85 PathProgramCache]: Analyzing trace with hash 647006980, now seen corresponding path program 2 times [2024-06-27 22:46:45,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:45,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611184680] [2024-06-27 22:46:45,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:45,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:46,228 INFO 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:46:46,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:46,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611184680] [2024-06-27 22:46:46,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611184680] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:46,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:46,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:46:46,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116254859] [2024-06-27 22:46:46,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:46,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:46:46,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:46,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:46:46,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:46:46,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:46:46,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 346 transitions, 5472 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:46:46,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:46,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:46:46,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:47,147 INFO L124 PetriNetUnfolderBase]: 3164/5775 cut-off events. [2024-06-27 22:46:47,147 INFO L125 PetriNetUnfolderBase]: For 72502/72502 co-relation queries the response was YES. [2024-06-27 22:46:47,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32060 conditions, 5775 events. 3164/5775 cut-off events. For 72502/72502 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 43783 event pairs, 920 based on Foata normal form. 1/5547 useless extension candidates. Maximal degree in co-relation 31964. Up to 4596 conditions per place. [2024-06-27 22:46:47,204 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 314 selfloop transitions, 45 changer transitions 0/374 dead transitions. [2024-06-27 22:46:47,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 374 transitions, 6409 flow [2024-06-27 22:46:47,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:46:47,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:46:47,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 190 transitions. [2024-06-27 22:46:47,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5900621118012422 [2024-06-27 22:46:47,206 INFO L175 Difference]: Start difference. First operand has 206 places, 346 transitions, 5472 flow. Second operand 7 states and 190 transitions. [2024-06-27 22:46:47,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 374 transitions, 6409 flow [2024-06-27 22:46:47,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 374 transitions, 6146 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-06-27 22:46:47,432 INFO L231 Difference]: Finished difference. Result has 211 places, 355 transitions, 5442 flow [2024-06-27 22:46:47,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5210, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5442, PETRI_PLACES=211, PETRI_TRANSITIONS=355} [2024-06-27 22:46:47,433 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 159 predicate places. [2024-06-27 22:46:47,433 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 355 transitions, 5442 flow [2024-06-27 22:46:47,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:46:47,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:47,433 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:46:47,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:46:47,434 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:47,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:47,434 INFO L85 PathProgramCache]: Analyzing trace with hash -614110446, now seen corresponding path program 3 times [2024-06-27 22:46:47,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:47,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458278434] [2024-06-27 22:46:47,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:47,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:47,840 INFO 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:46:47,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:47,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458278434] [2024-06-27 22:46:47,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458278434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:47,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:47,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:46:47,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350490151] [2024-06-27 22:46:47,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:47,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:46:47,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:47,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:46:47,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:46:47,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:46:47,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 355 transitions, 5442 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:46:47,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:47,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:46:47,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:48,832 INFO L124 PetriNetUnfolderBase]: 3161/5774 cut-off events. [2024-06-27 22:46:48,833 INFO L125 PetriNetUnfolderBase]: For 70465/70465 co-relation queries the response was YES. [2024-06-27 22:46:48,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31474 conditions, 5774 events. 3161/5774 cut-off events. For 70465/70465 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 43852 event pairs, 915 based on Foata normal form. 1/5547 useless extension candidates. Maximal degree in co-relation 31376. Up to 4593 conditions per place. [2024-06-27 22:46:48,890 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 316 selfloop transitions, 47 changer transitions 0/378 dead transitions. [2024-06-27 22:46:48,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 378 transitions, 6232 flow [2024-06-27 22:46:48,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:46:48,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:46:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 233 transitions. [2024-06-27 22:46:48,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5628019323671497 [2024-06-27 22:46:48,892 INFO L175 Difference]: Start difference. First operand has 211 places, 355 transitions, 5442 flow. Second operand 9 states and 233 transitions. [2024-06-27 22:46:48,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 378 transitions, 6232 flow [2024-06-27 22:46:49,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 378 transitions, 6138 flow, removed 28 selfloop flow, removed 3 redundant places. [2024-06-27 22:46:49,085 INFO L231 Difference]: Finished difference. Result has 217 places, 356 transitions, 5459 flow [2024-06-27 22:46:49,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5350, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5459, PETRI_PLACES=217, PETRI_TRANSITIONS=356} [2024-06-27 22:46:49,086 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 165 predicate places. [2024-06-27 22:46:49,086 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 356 transitions, 5459 flow [2024-06-27 22:46:49,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:46:49,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:49,086 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:46:49,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:46:49,087 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:49,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:49,087 INFO L85 PathProgramCache]: Analyzing trace with hash -614110229, now seen corresponding path program 1 times [2024-06-27 22:46:49,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:49,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428009964] [2024-06-27 22:46:49,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:49,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:49,589 INFO 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:46:49,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:49,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428009964] [2024-06-27 22:46:49,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428009964] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:49,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:49,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:46:49,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007647840] [2024-06-27 22:46:49,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:49,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:46:49,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:49,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:46:49,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:46:49,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:46:49,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 356 transitions, 5459 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:46:49,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:49,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:46:49,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:50,529 INFO L124 PetriNetUnfolderBase]: 3196/5815 cut-off events. [2024-06-27 22:46:50,529 INFO L125 PetriNetUnfolderBase]: For 74875/74875 co-relation queries the response was YES. [2024-06-27 22:46:50,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31982 conditions, 5815 events. 3196/5815 cut-off events. For 74875/74875 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 43859 event pairs, 1097 based on Foata normal form. 2/5591 useless extension candidates. Maximal degree in co-relation 31882. Up to 4631 conditions per place. [2024-06-27 22:46:50,583 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 328 selfloop transitions, 38 changer transitions 0/381 dead transitions. [2024-06-27 22:46:50,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 381 transitions, 6409 flow [2024-06-27 22:46:50,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:46:50,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:46:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 167 transitions. [2024-06-27 22:46:50,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.605072463768116 [2024-06-27 22:46:50,584 INFO L175 Difference]: Start difference. First operand has 217 places, 356 transitions, 5459 flow. Second operand 6 states and 167 transitions. [2024-06-27 22:46:50,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 381 transitions, 6409 flow [2024-06-27 22:46:50,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 381 transitions, 6305 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-27 22:46:50,781 INFO L231 Difference]: Finished difference. Result has 216 places, 362 transitions, 5558 flow [2024-06-27 22:46:50,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5355, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5558, PETRI_PLACES=216, PETRI_TRANSITIONS=362} [2024-06-27 22:46:50,782 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 164 predicate places. [2024-06-27 22:46:50,782 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 362 transitions, 5558 flow [2024-06-27 22:46:50,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:46:50,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:50,783 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:46:50,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:46:50,783 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:50,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:50,783 INFO L85 PathProgramCache]: Analyzing trace with hash -2016353647, now seen corresponding path program 2 times [2024-06-27 22:46:50,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:50,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007826709] [2024-06-27 22:46:50,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:50,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:51,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:51,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007826709] [2024-06-27 22:46:51,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007826709] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:51,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:51,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:46:51,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765905111] [2024-06-27 22:46:51,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:51,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:46:51,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:51,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:46:51,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:46:51,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:46:51,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 362 transitions, 5558 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:46:51,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:51,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:46:51,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:52,126 INFO L124 PetriNetUnfolderBase]: 3211/5850 cut-off events. [2024-06-27 22:46:52,127 INFO L125 PetriNetUnfolderBase]: For 79497/79497 co-relation queries the response was YES. [2024-06-27 22:46:52,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32577 conditions, 5850 events. 3211/5850 cut-off events. For 79497/79497 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 44382 event pairs, 917 based on Foata normal form. 2/5623 useless extension candidates. Maximal degree in co-relation 32476. Up to 4699 conditions per place. [2024-06-27 22:46:52,185 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 343 selfloop transitions, 19 changer transitions 0/377 dead transitions. [2024-06-27 22:46:52,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 377 transitions, 6374 flow [2024-06-27 22:46:52,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:46:52,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:46:52,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-06-27 22:46:52,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.591304347826087 [2024-06-27 22:46:52,186 INFO L175 Difference]: Start difference. First operand has 216 places, 362 transitions, 5558 flow. Second operand 5 states and 136 transitions. [2024-06-27 22:46:52,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 377 transitions, 6374 flow [2024-06-27 22:46:52,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 377 transitions, 6309 flow, removed 24 selfloop flow, removed 2 redundant places. [2024-06-27 22:46:52,424 INFO L231 Difference]: Finished difference. Result has 219 places, 365 transitions, 5608 flow [2024-06-27 22:46:52,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5497, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5608, PETRI_PLACES=219, PETRI_TRANSITIONS=365} [2024-06-27 22:46:52,425 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 167 predicate places. [2024-06-27 22:46:52,425 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 365 transitions, 5608 flow [2024-06-27 22:46:52,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:46:52,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:52,425 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:46:52,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:46:52,425 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:52,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:52,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1232403652, now seen corresponding path program 4 times [2024-06-27 22:46:52,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:52,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937980562] [2024-06-27 22:46:52,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:52,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:52,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:52,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937980562] [2024-06-27 22:46:52,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937980562] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:52,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:52,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:46:52,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169798487] [2024-06-27 22:46:52,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:52,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:46:52,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:52,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:46:52,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:46:52,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:46:52,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 365 transitions, 5608 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:46:52,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:52,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:46:52,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:53,809 INFO L124 PetriNetUnfolderBase]: 3220/5851 cut-off events. [2024-06-27 22:46:53,809 INFO L125 PetriNetUnfolderBase]: For 82234/82234 co-relation queries the response was YES. [2024-06-27 22:46:53,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32704 conditions, 5851 events. 3220/5851 cut-off events. For 82234/82234 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 44083 event pairs, 1096 based on Foata normal form. 1/5627 useless extension candidates. Maximal degree in co-relation 32601. Up to 4670 conditions per place. [2024-06-27 22:46:53,874 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 333 selfloop transitions, 42 changer transitions 0/390 dead transitions. [2024-06-27 22:46:53,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 390 transitions, 6544 flow [2024-06-27 22:46:53,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:46:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:46:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-06-27 22:46:53,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6159420289855072 [2024-06-27 22:46:53,876 INFO L175 Difference]: Start difference. First operand has 219 places, 365 transitions, 5608 flow. Second operand 6 states and 170 transitions. [2024-06-27 22:46:53,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 390 transitions, 6544 flow [2024-06-27 22:46:54,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 390 transitions, 6477 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-27 22:46:54,136 INFO L231 Difference]: Finished difference. Result has 223 places, 370 transitions, 5719 flow [2024-06-27 22:46:54,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5541, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5719, PETRI_PLACES=223, PETRI_TRANSITIONS=370} [2024-06-27 22:46:54,137 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 171 predicate places. [2024-06-27 22:46:54,137 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 370 transitions, 5719 flow [2024-06-27 22:46:54,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:46:54,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:54,138 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:46:54,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:46:54,138 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:54,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:54,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1232403497, now seen corresponding path program 4 times [2024-06-27 22:46:54,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:54,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529978909] [2024-06-27 22:46:54,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:54,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:54,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:54,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529978909] [2024-06-27 22:46:54,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529978909] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:54,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:54,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:46:54,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406604956] [2024-06-27 22:46:54,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:54,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:46:54,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:54,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:46:54,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:46:54,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:46:54,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 370 transitions, 5719 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:54,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:54,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:46:54,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:55,736 INFO L124 PetriNetUnfolderBase]: 3120/5743 cut-off events. [2024-06-27 22:46:55,736 INFO L125 PetriNetUnfolderBase]: For 80987/81004 co-relation queries the response was YES. [2024-06-27 22:46:55,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31833 conditions, 5743 events. 3120/5743 cut-off events. For 80987/81004 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 43945 event pairs, 515 based on Foata normal form. 22/5534 useless extension candidates. Maximal degree in co-relation 31727. Up to 4072 conditions per place. [2024-06-27 22:46:55,791 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 268 selfloop transitions, 87 changer transitions 0/394 dead transitions. [2024-06-27 22:46:55,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 394 transitions, 6617 flow [2024-06-27 22:46:55,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:46:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:46:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2024-06-27 22:46:55,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5434782608695652 [2024-06-27 22:46:55,794 INFO L175 Difference]: Start difference. First operand has 223 places, 370 transitions, 5719 flow. Second operand 8 states and 200 transitions. [2024-06-27 22:46:55,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 394 transitions, 6617 flow [2024-06-27 22:46:56,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 394 transitions, 6445 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-06-27 22:46:56,049 INFO L231 Difference]: Finished difference. Result has 227 places, 374 transitions, 5818 flow [2024-06-27 22:46:56,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5551, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5818, PETRI_PLACES=227, PETRI_TRANSITIONS=374} [2024-06-27 22:46:56,050 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 175 predicate places. [2024-06-27 22:46:56,050 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 374 transitions, 5818 flow [2024-06-27 22:46:56,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:46:56,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:56,051 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:46:56,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:46:56,051 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:56,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:56,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1476824918, now seen corresponding path program 5 times [2024-06-27 22:46:56,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:56,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979011409] [2024-06-27 22:46:56,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:56,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:56,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:56,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979011409] [2024-06-27 22:46:56,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979011409] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:56,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:56,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:46:56,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713197318] [2024-06-27 22:46:56,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:56,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:46:56,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:56,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:46:56,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:46:56,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:46:56,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 374 transitions, 5818 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:46:56,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:56,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:46:56,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:57,310 INFO L124 PetriNetUnfolderBase]: 3255/5921 cut-off events. [2024-06-27 22:46:57,310 INFO L125 PetriNetUnfolderBase]: For 88203/88203 co-relation queries the response was YES. [2024-06-27 22:46:57,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33475 conditions, 5921 events. 3255/5921 cut-off events. For 88203/88203 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 44980 event pairs, 1122 based on Foata normal form. 1/5694 useless extension candidates. Maximal degree in co-relation 33369. Up to 4770 conditions per place. [2024-06-27 22:46:57,372 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 355 selfloop transitions, 21 changer transitions 0/391 dead transitions. [2024-06-27 22:46:57,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 391 transitions, 6658 flow [2024-06-27 22:46:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:46:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:46:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2024-06-27 22:46:57,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.572463768115942 [2024-06-27 22:46:57,374 INFO L175 Difference]: Start difference. First operand has 227 places, 374 transitions, 5818 flow. Second operand 6 states and 158 transitions. [2024-06-27 22:46:57,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 391 transitions, 6658 flow [2024-06-27 22:46:57,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 391 transitions, 6197 flow, removed 68 selfloop flow, removed 10 redundant places. [2024-06-27 22:46:57,687 INFO L231 Difference]: Finished difference. Result has 223 places, 378 transitions, 5470 flow [2024-06-27 22:46:57,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5357, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5470, PETRI_PLACES=223, PETRI_TRANSITIONS=378} [2024-06-27 22:46:57,689 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 171 predicate places. [2024-06-27 22:46:57,689 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 378 transitions, 5470 flow [2024-06-27 22:46:57,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:46:57,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:57,689 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:46:57,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 22:46:57,689 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:57,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:57,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2016057907, now seen corresponding path program 3 times [2024-06-27 22:46:57,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:57,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913276168] [2024-06-27 22:46:57,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:57,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:58,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:46:58,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:58,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913276168] [2024-06-27 22:46:58,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913276168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:58,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:58,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:46:58,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395263504] [2024-06-27 22:46:58,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:58,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:46:58,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:58,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:46:58,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:46:58,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-06-27 22:46:58,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 378 transitions, 5470 flow. Second operand has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 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:46:58,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:58,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-06-27 22:46:58,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:46:59,209 INFO L124 PetriNetUnfolderBase]: 3694/6552 cut-off events. [2024-06-27 22:46:59,210 INFO L125 PetriNetUnfolderBase]: For 84535/84535 co-relation queries the response was YES. [2024-06-27 22:46:59,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35746 conditions, 6552 events. 3694/6552 cut-off events. For 84535/84535 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 48715 event pairs, 981 based on Foata normal form. 2/6338 useless extension candidates. Maximal degree in co-relation 35644. Up to 5334 conditions per place. [2024-06-27 22:46:59,270 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 366 selfloop transitions, 32 changer transitions 0/410 dead transitions. [2024-06-27 22:46:59,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 410 transitions, 6440 flow [2024-06-27 22:46:59,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:46:59,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:46:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 231 transitions. [2024-06-27 22:46:59,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5021739130434782 [2024-06-27 22:46:59,271 INFO L175 Difference]: Start difference. First operand has 223 places, 378 transitions, 5470 flow. Second operand 10 states and 231 transitions. [2024-06-27 22:46:59,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 410 transitions, 6440 flow [2024-06-27 22:46:59,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 410 transitions, 6361 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-06-27 22:46:59,568 INFO L231 Difference]: Finished difference. Result has 229 places, 382 transitions, 5545 flow [2024-06-27 22:46:59,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5393, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5545, PETRI_PLACES=229, PETRI_TRANSITIONS=382} [2024-06-27 22:46:59,568 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 177 predicate places. [2024-06-27 22:46:59,568 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 382 transitions, 5545 flow [2024-06-27 22:46:59,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 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:46:59,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:46:59,569 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:46:59,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 22:46:59,569 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:46:59,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:46:59,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1468579538, now seen corresponding path program 6 times [2024-06-27 22:46:59,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:46:59,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373223632] [2024-06-27 22:46:59,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:46:59,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:46:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:46:59,935 INFO 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:46:59,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:46:59,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373223632] [2024-06-27 22:46:59,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373223632] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:46:59,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:46:59,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:46:59,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399013715] [2024-06-27 22:46:59,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:46:59,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:46:59,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:46:59,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:46:59,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:46:59,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:46:59,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 382 transitions, 5545 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:46:59,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:46:59,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:46:59,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:00,908 INFO L124 PetriNetUnfolderBase]: 3260/5931 cut-off events. [2024-06-27 22:47:00,908 INFO L125 PetriNetUnfolderBase]: For 83074/83074 co-relation queries the response was YES. [2024-06-27 22:47:00,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32632 conditions, 5931 events. 3260/5931 cut-off events. For 83074/83074 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 45113 event pairs, 936 based on Foata normal form. 1/5703 useless extension candidates. Maximal degree in co-relation 32529. Up to 4731 conditions per place. [2024-06-27 22:47:00,959 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 339 selfloop transitions, 45 changer transitions 0/399 dead transitions. [2024-06-27 22:47:00,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 399 transitions, 6365 flow [2024-06-27 22:47:00,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:47:00,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:47:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2024-06-27 22:47:00,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6014492753623188 [2024-06-27 22:47:00,960 INFO L175 Difference]: Start difference. First operand has 229 places, 382 transitions, 5545 flow. Second operand 6 states and 166 transitions. [2024-06-27 22:47:00,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 399 transitions, 6365 flow [2024-06-27 22:47:01,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 399 transitions, 6237 flow, removed 30 selfloop flow, removed 8 redundant places. [2024-06-27 22:47:01,216 INFO L231 Difference]: Finished difference. Result has 227 places, 383 transitions, 5524 flow [2024-06-27 22:47:01,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5417, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5524, PETRI_PLACES=227, PETRI_TRANSITIONS=383} [2024-06-27 22:47:01,217 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 175 predicate places. [2024-06-27 22:47:01,217 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 383 transitions, 5524 flow [2024-06-27 22:47:01,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:01,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:01,218 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:47:01,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 22:47:01,218 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:01,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:01,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2024599027, now seen corresponding path program 4 times [2024-06-27 22:47:01,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:01,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476193309] [2024-06-27 22:47:01,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:01,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:01,697 INFO 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:47:01,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:01,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476193309] [2024-06-27 22:47:01,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476193309] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:01,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:01,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:47:01,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319362788] [2024-06-27 22:47:01,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:01,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:47:01,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:01,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:47:01,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:47:01,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:47:01,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 383 transitions, 5524 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:01,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:01,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:47:01,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:02,583 INFO L124 PetriNetUnfolderBase]: 3255/5922 cut-off events. [2024-06-27 22:47:02,584 INFO L125 PetriNetUnfolderBase]: For 82656/82656 co-relation queries the response was YES. [2024-06-27 22:47:02,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32441 conditions, 5922 events. 3255/5922 cut-off events. For 82656/82656 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 45049 event pairs, 935 based on Foata normal form. 2/5695 useless extension candidates. Maximal degree in co-relation 32341. Up to 4715 conditions per place. [2024-06-27 22:47:02,639 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 343 selfloop transitions, 41 changer transitions 0/399 dead transitions. [2024-06-27 22:47:02,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 399 transitions, 6334 flow [2024-06-27 22:47:02,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:47:02,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:47:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2024-06-27 22:47:02,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6217391304347826 [2024-06-27 22:47:02,641 INFO L175 Difference]: Start difference. First operand has 227 places, 383 transitions, 5524 flow. Second operand 5 states and 143 transitions. [2024-06-27 22:47:02,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 399 transitions, 6334 flow [2024-06-27 22:47:02,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 399 transitions, 6237 flow, removed 23 selfloop flow, removed 2 redundant places. [2024-06-27 22:47:02,913 INFO L231 Difference]: Finished difference. Result has 230 places, 383 transitions, 5525 flow [2024-06-27 22:47:02,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5427, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5525, PETRI_PLACES=230, PETRI_TRANSITIONS=383} [2024-06-27 22:47:02,914 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 178 predicate places. [2024-06-27 22:47:02,914 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 383 transitions, 5525 flow [2024-06-27 22:47:02,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:02,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:02,915 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:47:02,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 22:47:02,915 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:02,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:02,915 INFO L85 PathProgramCache]: Analyzing trace with hash -276686078, now seen corresponding path program 1 times [2024-06-27 22:47:02,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:02,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706058866] [2024-06-27 22:47:02,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:02,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:03,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:47:03,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:03,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706058866] [2024-06-27 22:47:03,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706058866] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:03,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:03,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:47:03,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835642537] [2024-06-27 22:47:03,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:03,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:47:03,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:03,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:47:03,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:47:03,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:47:03,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 383 transitions, 5525 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:03,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:03,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:47:03,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:04,284 INFO L124 PetriNetUnfolderBase]: 3330/5997 cut-off events. [2024-06-27 22:47:04,284 INFO L125 PetriNetUnfolderBase]: For 88417/88417 co-relation queries the response was YES. [2024-06-27 22:47:04,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33396 conditions, 5997 events. 3330/5997 cut-off events. For 88417/88417 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 45088 event pairs, 534 based on Foata normal form. 3/5789 useless extension candidates. Maximal degree in co-relation 33295. Up to 4063 conditions per place. [2024-06-27 22:47:04,343 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 281 selfloop transitions, 132 changer transitions 0/428 dead transitions. [2024-06-27 22:47:04,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 428 transitions, 6868 flow [2024-06-27 22:47:04,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:47:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:47:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions. [2024-06-27 22:47:04,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6024844720496895 [2024-06-27 22:47:04,345 INFO L175 Difference]: Start difference. First operand has 230 places, 383 transitions, 5525 flow. Second operand 7 states and 194 transitions. [2024-06-27 22:47:04,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 428 transitions, 6868 flow [2024-06-27 22:47:04,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 428 transitions, 6747 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-27 22:47:04,635 INFO L231 Difference]: Finished difference. Result has 235 places, 404 transitions, 6199 flow [2024-06-27 22:47:04,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5408, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6199, PETRI_PLACES=235, PETRI_TRANSITIONS=404} [2024-06-27 22:47:04,636 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 183 predicate places. [2024-06-27 22:47:04,636 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 404 transitions, 6199 flow [2024-06-27 22:47:04,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:04,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:04,637 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:47:04,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 22:47:04,637 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:04,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:04,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1669154914, now seen corresponding path program 2 times [2024-06-27 22:47:04,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:04,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747935670] [2024-06-27 22:47:04,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:04,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:04,958 INFO 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:47:04,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:04,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747935670] [2024-06-27 22:47:04,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747935670] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:04,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:04,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:47:04,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538227147] [2024-06-27 22:47:04,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:04,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:47:04,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:04,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:47:04,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:47:05,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:47:05,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 404 transitions, 6199 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:05,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:05,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:47:05,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:06,008 INFO L124 PetriNetUnfolderBase]: 3334/5974 cut-off events. [2024-06-27 22:47:06,008 INFO L125 PetriNetUnfolderBase]: For 95252/95264 co-relation queries the response was YES. [2024-06-27 22:47:06,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35035 conditions, 5974 events. 3334/5974 cut-off events. For 95252/95264 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 44730 event pairs, 876 based on Foata normal form. 9/5753 useless extension candidates. Maximal degree in co-relation 34932. Up to 4743 conditions per place. [2024-06-27 22:47:06,061 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 344 selfloop transitions, 79 changer transitions 0/438 dead transitions. [2024-06-27 22:47:06,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 438 transitions, 7494 flow [2024-06-27 22:47:06,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:47:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:47:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2024-06-27 22:47:06,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2024-06-27 22:47:06,063 INFO L175 Difference]: Start difference. First operand has 235 places, 404 transitions, 6199 flow. Second operand 6 states and 168 transitions. [2024-06-27 22:47:06,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 438 transitions, 7494 flow [2024-06-27 22:47:06,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 438 transitions, 7277 flow, removed 71 selfloop flow, removed 2 redundant places. [2024-06-27 22:47:06,363 INFO L231 Difference]: Finished difference. Result has 241 places, 421 transitions, 6576 flow [2024-06-27 22:47:06,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6042, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6576, PETRI_PLACES=241, PETRI_TRANSITIONS=421} [2024-06-27 22:47:06,364 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 189 predicate places. [2024-06-27 22:47:06,364 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 421 transitions, 6576 flow [2024-06-27 22:47:06,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:06,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:06,364 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:47:06,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 22:47:06,364 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:06,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:06,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1869500932, now seen corresponding path program 3 times [2024-06-27 22:47:06,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:06,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274091416] [2024-06-27 22:47:06,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:06,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:06,653 INFO 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:47:06,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:06,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274091416] [2024-06-27 22:47:06,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274091416] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:06,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:06,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:47:06,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403313361] [2024-06-27 22:47:06,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:06,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:47:06,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:06,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:47:06,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:47:06,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:47:06,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 421 transitions, 6576 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:06,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:06,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:47:06,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:07,654 INFO L124 PetriNetUnfolderBase]: 3331/5962 cut-off events. [2024-06-27 22:47:07,654 INFO L125 PetriNetUnfolderBase]: For 97006/97018 co-relation queries the response was YES. [2024-06-27 22:47:07,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35350 conditions, 5962 events. 3331/5962 cut-off events. For 97006/97018 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 44487 event pairs, 1076 based on Foata normal form. 9/5747 useless extension candidates. Maximal degree in co-relation 35243. Up to 4814 conditions per place. [2024-06-27 22:47:07,715 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 376 selfloop transitions, 41 changer transitions 0/432 dead transitions. [2024-06-27 22:47:07,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 432 transitions, 7438 flow [2024-06-27 22:47:07,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:47:07,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:47:07,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-06-27 22:47:07,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-27 22:47:07,717 INFO L175 Difference]: Start difference. First operand has 241 places, 421 transitions, 6576 flow. Second operand 5 states and 138 transitions. [2024-06-27 22:47:07,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 432 transitions, 7438 flow [2024-06-27 22:47:08,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 432 transitions, 7327 flow, removed 44 selfloop flow, removed 1 redundant places. [2024-06-27 22:47:08,099 INFO L231 Difference]: Finished difference. Result has 245 places, 421 transitions, 6561 flow [2024-06-27 22:47:08,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6465, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6561, PETRI_PLACES=245, PETRI_TRANSITIONS=421} [2024-06-27 22:47:08,100 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 193 predicate places. [2024-06-27 22:47:08,100 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 421 transitions, 6561 flow [2024-06-27 22:47:08,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:08,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:08,101 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:47:08,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 22:47:08,101 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:08,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:08,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1870894592, now seen corresponding path program 4 times [2024-06-27 22:47:08,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:08,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387604791] [2024-06-27 22:47:08,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:08,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:08,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:47:08,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:08,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387604791] [2024-06-27 22:47:08,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387604791] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:08,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:08,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:47:08,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394065957] [2024-06-27 22:47:08,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:08,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:47:08,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:08,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:47:08,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:47:08,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:47:08,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 421 transitions, 6561 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:08,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:08,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:47:08,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:09,697 INFO L124 PetriNetUnfolderBase]: 3361/6016 cut-off events. [2024-06-27 22:47:09,697 INFO L125 PetriNetUnfolderBase]: For 97549/97561 co-relation queries the response was YES. [2024-06-27 22:47:09,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35849 conditions, 6016 events. 3361/6016 cut-off events. For 97549/97561 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 45035 event pairs, 874 based on Foata normal form. 9/5796 useless extension candidates. Maximal degree in co-relation 35740. Up to 4796 conditions per place. [2024-06-27 22:47:09,758 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 373 selfloop transitions, 69 changer transitions 0/457 dead transitions. [2024-06-27 22:47:09,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 457 transitions, 7818 flow [2024-06-27 22:47:09,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:47:09,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:47:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 215 transitions. [2024-06-27 22:47:09,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5842391304347826 [2024-06-27 22:47:09,759 INFO L175 Difference]: Start difference. First operand has 245 places, 421 transitions, 6561 flow. Second operand 8 states and 215 transitions. [2024-06-27 22:47:09,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 457 transitions, 7818 flow [2024-06-27 22:47:10,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 457 transitions, 7714 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-27 22:47:10,165 INFO L231 Difference]: Finished difference. Result has 250 places, 433 transitions, 6845 flow [2024-06-27 22:47:10,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6457, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6845, PETRI_PLACES=250, PETRI_TRANSITIONS=433} [2024-06-27 22:47:10,166 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 198 predicate places. [2024-06-27 22:47:10,166 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 433 transitions, 6845 flow [2024-06-27 22:47:10,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:10,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:10,166 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:47:10,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 22:47:10,167 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:10,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:10,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1858007582, now seen corresponding path program 5 times [2024-06-27 22:47:10,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:10,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481966126] [2024-06-27 22:47:10,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:10,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:10,581 INFO 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:47:10,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:10,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481966126] [2024-06-27 22:47:10,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481966126] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:10,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:10,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:47:10,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249993128] [2024-06-27 22:47:10,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:10,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:47:10,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:10,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:47:10,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:47:10,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:47:10,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 433 transitions, 6845 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:10,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:10,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:47:10,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:11,671 INFO L124 PetriNetUnfolderBase]: 3370/6025 cut-off events. [2024-06-27 22:47:11,671 INFO L125 PetriNetUnfolderBase]: For 103274/103286 co-relation queries the response was YES. [2024-06-27 22:47:11,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36520 conditions, 6025 events. 3370/6025 cut-off events. For 103274/103286 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 45077 event pairs, 869 based on Foata normal form. 9/5805 useless extension candidates. Maximal degree in co-relation 36410. Up to 4817 conditions per place. [2024-06-27 22:47:11,732 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 375 selfloop transitions, 65 changer transitions 0/455 dead transitions. [2024-06-27 22:47:11,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 455 transitions, 7863 flow [2024-06-27 22:47:11,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:47:11,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:47:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2024-06-27 22:47:11,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5838509316770186 [2024-06-27 22:47:11,733 INFO L175 Difference]: Start difference. First operand has 250 places, 433 transitions, 6845 flow. Second operand 7 states and 188 transitions. [2024-06-27 22:47:11,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 455 transitions, 7863 flow [2024-06-27 22:47:12,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 455 transitions, 7528 flow, removed 102 selfloop flow, removed 4 redundant places. [2024-06-27 22:47:12,231 INFO L231 Difference]: Finished difference. Result has 253 places, 437 transitions, 6747 flow [2024-06-27 22:47:12,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6560, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6747, PETRI_PLACES=253, PETRI_TRANSITIONS=437} [2024-06-27 22:47:12,232 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 201 predicate places. [2024-06-27 22:47:12,232 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 437 transitions, 6747 flow [2024-06-27 22:47:12,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:12,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:12,232 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:47:12,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 22:47:12,233 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:12,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:12,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1872665442, now seen corresponding path program 6 times [2024-06-27 22:47:12,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:12,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004043670] [2024-06-27 22:47:12,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:12,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:12,620 INFO 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:47:12,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:12,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004043670] [2024-06-27 22:47:12,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004043670] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:12,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:12,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:47:12,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057546075] [2024-06-27 22:47:12,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:12,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:47:12,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:12,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:47:12,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:47:12,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:47:12,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 437 transitions, 6747 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:12,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:12,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:47:12,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:13,620 INFO L124 PetriNetUnfolderBase]: 3379/6079 cut-off events. [2024-06-27 22:47:13,620 INFO L125 PetriNetUnfolderBase]: For 106828/106840 co-relation queries the response was YES. [2024-06-27 22:47:13,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36481 conditions, 6079 events. 3379/6079 cut-off events. For 106828/106840 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 45784 event pairs, 883 based on Foata normal form. 9/5853 useless extension candidates. Maximal degree in co-relation 36371. Up to 4740 conditions per place. [2024-06-27 22:47:13,689 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 345 selfloop transitions, 108 changer transitions 0/468 dead transitions. [2024-06-27 22:47:13,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 468 transitions, 8043 flow [2024-06-27 22:47:13,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:47:13,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:47:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2024-06-27 22:47:13,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5962732919254659 [2024-06-27 22:47:13,690 INFO L175 Difference]: Start difference. First operand has 253 places, 437 transitions, 6747 flow. Second operand 7 states and 192 transitions. [2024-06-27 22:47:13,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 468 transitions, 8043 flow [2024-06-27 22:47:14,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 468 transitions, 7885 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-27 22:47:14,110 INFO L231 Difference]: Finished difference. Result has 256 places, 449 transitions, 7118 flow [2024-06-27 22:47:14,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6591, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7118, PETRI_PLACES=256, PETRI_TRANSITIONS=449} [2024-06-27 22:47:14,111 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 204 predicate places. [2024-06-27 22:47:14,111 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 449 transitions, 7118 flow [2024-06-27 22:47:14,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:14,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:14,111 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:47:14,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 22:47:14,111 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:14,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:14,112 INFO L85 PathProgramCache]: Analyzing trace with hash -798959382, now seen corresponding path program 7 times [2024-06-27 22:47:14,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:14,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146190304] [2024-06-27 22:47:14,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:14,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:47:14,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:14,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146190304] [2024-06-27 22:47:14,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146190304] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:14,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:14,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:47:14,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068673937] [2024-06-27 22:47:14,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:14,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:47:14,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:14,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:47:14,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:47:14,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:47:14,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 449 transitions, 7118 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:14,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:14,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:47:14,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:15,588 INFO L124 PetriNetUnfolderBase]: 3376/6075 cut-off events. [2024-06-27 22:47:15,588 INFO L125 PetriNetUnfolderBase]: For 109483/109495 co-relation queries the response was YES. [2024-06-27 22:47:15,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37110 conditions, 6075 events. 3376/6075 cut-off events. For 109483/109495 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 45730 event pairs, 869 based on Foata normal form. 9/5852 useless extension candidates. Maximal degree in co-relation 36999. Up to 4815 conditions per place. [2024-06-27 22:47:15,648 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 381 selfloop transitions, 72 changer transitions 0/468 dead transitions. [2024-06-27 22:47:15,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 468 transitions, 8076 flow [2024-06-27 22:47:15,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:47:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:47:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2024-06-27 22:47:15,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2024-06-27 22:47:15,649 INFO L175 Difference]: Start difference. First operand has 256 places, 449 transitions, 7118 flow. Second operand 6 states and 168 transitions. [2024-06-27 22:47:15,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 468 transitions, 8076 flow [2024-06-27 22:47:16,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 468 transitions, 7916 flow, removed 71 selfloop flow, removed 1 redundant places. [2024-06-27 22:47:16,038 INFO L231 Difference]: Finished difference. Result has 261 places, 449 transitions, 7119 flow [2024-06-27 22:47:16,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6958, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7119, PETRI_PLACES=261, PETRI_TRANSITIONS=449} [2024-06-27 22:47:16,038 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 209 predicate places. [2024-06-27 22:47:16,038 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 449 transitions, 7119 flow [2024-06-27 22:47:16,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:16,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:16,039 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:47:16,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 22:47:16,039 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:16,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:16,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1917532186, now seen corresponding path program 8 times [2024-06-27 22:47:16,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:16,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993435199] [2024-06-27 22:47:16,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:16,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:47:16,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:16,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993435199] [2024-06-27 22:47:16,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993435199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:16,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:16,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:47:16,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166477143] [2024-06-27 22:47:16,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:16,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:47:16,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:16,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:47:16,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:47:16,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:47:16,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 449 transitions, 7119 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:16,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:16,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:47:16,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:17,399 INFO L124 PetriNetUnfolderBase]: 3397/6090 cut-off events. [2024-06-27 22:47:17,399 INFO L125 PetriNetUnfolderBase]: For 111725/111737 co-relation queries the response was YES. [2024-06-27 22:47:17,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37148 conditions, 6090 events. 3397/6090 cut-off events. For 111725/111737 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 45557 event pairs, 1078 based on Foata normal form. 9/5873 useless extension candidates. Maximal degree in co-relation 37034. Up to 4886 conditions per place. [2024-06-27 22:47:17,464 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 404 selfloop transitions, 52 changer transitions 0/471 dead transitions. [2024-06-27 22:47:17,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 471 transitions, 8343 flow [2024-06-27 22:47:17,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:47:17,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:47:17,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2024-06-27 22:47:17,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5869565217391305 [2024-06-27 22:47:17,466 INFO L175 Difference]: Start difference. First operand has 261 places, 449 transitions, 7119 flow. Second operand 6 states and 162 transitions. [2024-06-27 22:47:17,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 471 transitions, 8343 flow [2024-06-27 22:47:17,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 471 transitions, 8215 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-27 22:47:17,857 INFO L231 Difference]: Finished difference. Result has 262 places, 457 transitions, 7310 flow [2024-06-27 22:47:17,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6995, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7310, PETRI_PLACES=262, PETRI_TRANSITIONS=457} [2024-06-27 22:47:17,858 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 210 predicate places. [2024-06-27 22:47:17,858 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 457 transitions, 7310 flow [2024-06-27 22:47:17,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:17,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:17,858 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:47:17,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 22:47:17,858 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:17,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:17,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1661925406, now seen corresponding path program 9 times [2024-06-27 22:47:17,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:17,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464052016] [2024-06-27 22:47:17,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:17,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:18,213 INFO 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:47:18,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:18,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464052016] [2024-06-27 22:47:18,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464052016] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:18,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:18,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:47:18,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25216764] [2024-06-27 22:47:18,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:18,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:47:18,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:18,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:47:18,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:47:18,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:47:18,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 457 transitions, 7310 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:18,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:18,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:47:18,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:19,276 INFO L124 PetriNetUnfolderBase]: 3394/6099 cut-off events. [2024-06-27 22:47:19,277 INFO L125 PetriNetUnfolderBase]: For 105754/105766 co-relation queries the response was YES. [2024-06-27 22:47:19,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37018 conditions, 6099 events. 3394/6099 cut-off events. For 105754/105766 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 45922 event pairs, 877 based on Foata normal form. 9/5873 useless extension candidates. Maximal degree in co-relation 36904. Up to 4757 conditions per place. [2024-06-27 22:47:19,340 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 342 selfloop transitions, 117 changer transitions 0/474 dead transitions. [2024-06-27 22:47:19,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 474 transitions, 8352 flow [2024-06-27 22:47:19,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:47:19,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:47:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2024-06-27 22:47:19,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2024-06-27 22:47:19,341 INFO L175 Difference]: Start difference. First operand has 262 places, 457 transitions, 7310 flow. Second operand 6 states and 168 transitions. [2024-06-27 22:47:19,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 474 transitions, 8352 flow [2024-06-27 22:47:19,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 474 transitions, 8142 flow, removed 75 selfloop flow, removed 3 redundant places. [2024-06-27 22:47:19,755 INFO L231 Difference]: Finished difference. Result has 265 places, 457 transitions, 7346 flow [2024-06-27 22:47:19,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7100, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7346, PETRI_PLACES=265, PETRI_TRANSITIONS=457} [2024-06-27 22:47:19,756 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 213 predicate places. [2024-06-27 22:47:19,756 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 457 transitions, 7346 flow [2024-06-27 22:47:19,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:19,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:19,757 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:47:19,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 22:47:19,757 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:19,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:19,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1911788506, now seen corresponding path program 10 times [2024-06-27 22:47:19,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:19,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999690302] [2024-06-27 22:47:19,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:19,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:47:20,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:20,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999690302] [2024-06-27 22:47:20,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999690302] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:20,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:20,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:47:20,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860263885] [2024-06-27 22:47:20,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:20,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:47:20,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:20,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:47:20,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:47:20,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:47:20,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 457 transitions, 7346 flow. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:20,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:20,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:47:20,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:21,058 INFO L124 PetriNetUnfolderBase]: 3391/6083 cut-off events. [2024-06-27 22:47:21,058 INFO L125 PetriNetUnfolderBase]: For 109299/109311 co-relation queries the response was YES. [2024-06-27 22:47:21,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37168 conditions, 6083 events. 3391/6083 cut-off events. For 109299/109311 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 45544 event pairs, 1081 based on Foata normal form. 9/5866 useless extension candidates. Maximal degree in co-relation 37054. Up to 4900 conditions per place. [2024-06-27 22:47:21,124 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 414 selfloop transitions, 41 changer transitions 0/470 dead transitions. [2024-06-27 22:47:21,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 470 transitions, 8288 flow [2024-06-27 22:47:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:47:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:47:21,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions. [2024-06-27 22:47:21,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5797101449275363 [2024-06-27 22:47:21,126 INFO L175 Difference]: Start difference. First operand has 265 places, 457 transitions, 7346 flow. Second operand 6 states and 160 transitions. [2024-06-27 22:47:21,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 470 transitions, 8288 flow [2024-06-27 22:47:21,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 470 transitions, 7846 flow, removed 56 selfloop flow, removed 7 redundant places. [2024-06-27 22:47:21,605 INFO L231 Difference]: Finished difference. Result has 264 places, 457 transitions, 6993 flow [2024-06-27 22:47:21,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6904, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6993, PETRI_PLACES=264, PETRI_TRANSITIONS=457} [2024-06-27 22:47:21,606 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 212 predicate places. [2024-06-27 22:47:21,606 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 457 transitions, 6993 flow [2024-06-27 22:47:21,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 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:47:21,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:21,606 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:47:21,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 22:47:21,607 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:21,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:21,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1422207262, now seen corresponding path program 1 times [2024-06-27 22:47:21,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:21,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360142699] [2024-06-27 22:47:21,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:21,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:22,120 INFO 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:47:22,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:22,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360142699] [2024-06-27 22:47:22,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360142699] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:22,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:22,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:47:22,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869145419] [2024-06-27 22:47:22,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:22,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:47:22,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:22,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:47:22,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:47:22,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:47:22,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 457 transitions, 6993 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:22,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:22,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:47:22,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:23,279 INFO L124 PetriNetUnfolderBase]: 3549/6334 cut-off events. [2024-06-27 22:47:23,280 INFO L125 PetriNetUnfolderBase]: For 118327/118327 co-relation queries the response was YES. [2024-06-27 22:47:23,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38273 conditions, 6334 events. 3549/6334 cut-off events. For 118327/118327 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 47808 event pairs, 889 based on Foata normal form. 6/6124 useless extension candidates. Maximal degree in co-relation 38161. Up to 4700 conditions per place. [2024-06-27 22:47:23,347 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 427 selfloop transitions, 92 changer transitions 0/534 dead transitions. [2024-06-27 22:47:23,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 534 transitions, 8871 flow [2024-06-27 22:47:23,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:47:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:47:23,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 233 transitions. [2024-06-27 22:47:23,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6331521739130435 [2024-06-27 22:47:23,360 INFO L175 Difference]: Start difference. First operand has 264 places, 457 transitions, 6993 flow. Second operand 8 states and 233 transitions. [2024-06-27 22:47:23,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 534 transitions, 8871 flow [2024-06-27 22:47:23,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 534 transitions, 8717 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-27 22:47:23,839 INFO L231 Difference]: Finished difference. Result has 271 places, 474 transitions, 7448 flow [2024-06-27 22:47:23,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6839, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7448, PETRI_PLACES=271, PETRI_TRANSITIONS=474} [2024-06-27 22:47:23,840 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 219 predicate places. [2024-06-27 22:47:23,840 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 474 transitions, 7448 flow [2024-06-27 22:47:23,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:23,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:23,840 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:47:23,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 22:47:23,841 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:23,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:23,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1532914462, now seen corresponding path program 2 times [2024-06-27 22:47:23,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:23,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790175902] [2024-06-27 22:47:23,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:23,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:47:24,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:24,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790175902] [2024-06-27 22:47:24,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790175902] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:24,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:24,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:47:24,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763441006] [2024-06-27 22:47:24,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:24,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:47:24,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:24,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:47:24,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:47:24,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-06-27 22:47:24,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 474 transitions, 7448 flow. Second operand has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:24,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:24,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-06-27 22:47:24,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:25,672 INFO L124 PetriNetUnfolderBase]: 3688/6653 cut-off events. [2024-06-27 22:47:25,672 INFO L125 PetriNetUnfolderBase]: For 137412/137412 co-relation queries the response was YES. [2024-06-27 22:47:25,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41406 conditions, 6653 events. 3688/6653 cut-off events. For 137412/137412 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 51098 event pairs, 1005 based on Foata normal form. 6/6415 useless extension candidates. Maximal degree in co-relation 41288. Up to 5157 conditions per place. [2024-06-27 22:47:25,739 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 424 selfloop transitions, 75 changer transitions 0/513 dead transitions. [2024-06-27 22:47:25,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 513 transitions, 8780 flow [2024-06-27 22:47:25,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:47:25,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:47:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions. [2024-06-27 22:47:25,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5579710144927537 [2024-06-27 22:47:25,741 INFO L175 Difference]: Start difference. First operand has 271 places, 474 transitions, 7448 flow. Second operand 9 states and 231 transitions. [2024-06-27 22:47:25,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 513 transitions, 8780 flow [2024-06-27 22:47:26,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 513 transitions, 8688 flow, removed 32 selfloop flow, removed 2 redundant places. [2024-06-27 22:47:26,221 INFO L231 Difference]: Finished difference. Result has 279 places, 478 transitions, 7583 flow [2024-06-27 22:47:26,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7368, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7583, PETRI_PLACES=279, PETRI_TRANSITIONS=478} [2024-06-27 22:47:26,222 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 227 predicate places. [2024-06-27 22:47:26,222 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 478 transitions, 7583 flow [2024-06-27 22:47:26,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:26,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:26,222 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:47:26,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 22:47:26,223 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:26,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:26,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1973017148, now seen corresponding path program 1 times [2024-06-27 22:47:26,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:26,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433925679] [2024-06-27 22:47:26,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:26,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:26,754 INFO 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:47:26,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:26,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433925679] [2024-06-27 22:47:26,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433925679] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:26,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:26,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:47:26,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549850778] [2024-06-27 22:47:26,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:26,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:47:26,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:26,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:47:26,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:47:26,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:47:26,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 478 transitions, 7583 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:26,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:26,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:47:26,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:27,922 INFO L124 PetriNetUnfolderBase]: 3703/6670 cut-off events. [2024-06-27 22:47:27,923 INFO L125 PetriNetUnfolderBase]: For 133687/133687 co-relation queries the response was YES. [2024-06-27 22:47:27,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41293 conditions, 6670 events. 3703/6670 cut-off events. For 133687/133687 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 51128 event pairs, 1011 based on Foata normal form. 2/6429 useless extension candidates. Maximal degree in co-relation 41173. Up to 5255 conditions per place. [2024-06-27 22:47:28,001 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 417 selfloop transitions, 77 changer transitions 0/509 dead transitions. [2024-06-27 22:47:28,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 509 transitions, 8869 flow [2024-06-27 22:47:28,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:47:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:47:28,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2024-06-27 22:47:28,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2024-06-27 22:47:28,002 INFO L175 Difference]: Start difference. First operand has 279 places, 478 transitions, 7583 flow. Second operand 7 states and 196 transitions. [2024-06-27 22:47:28,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 509 transitions, 8869 flow [2024-06-27 22:47:28,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 509 transitions, 8787 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-27 22:47:28,622 INFO L231 Difference]: Finished difference. Result has 281 places, 484 transitions, 7818 flow [2024-06-27 22:47:28,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7501, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7818, PETRI_PLACES=281, PETRI_TRANSITIONS=484} [2024-06-27 22:47:28,622 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 229 predicate places. [2024-06-27 22:47:28,622 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 484 transitions, 7818 flow [2024-06-27 22:47:28,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:28,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:28,623 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:47:28,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 22:47:28,623 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:28,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:28,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1973017334, now seen corresponding path program 3 times [2024-06-27 22:47:28,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:28,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214523609] [2024-06-27 22:47:28,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:28,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:29,143 INFO 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:47:29,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:29,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214523609] [2024-06-27 22:47:29,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214523609] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:29,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:29,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:47:29,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431729290] [2024-06-27 22:47:29,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:29,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:47:29,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:29,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:47:29,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:47:29,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:47:29,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 484 transitions, 7818 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:29,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:29,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:47:29,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:30,374 INFO L124 PetriNetUnfolderBase]: 3720/6707 cut-off events. [2024-06-27 22:47:30,374 INFO L125 PetriNetUnfolderBase]: For 140125/140125 co-relation queries the response was YES. [2024-06-27 22:47:30,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41774 conditions, 6707 events. 3720/6707 cut-off events. For 140125/140125 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 51521 event pairs, 1137 based on Foata normal form. 6/6470 useless extension candidates. Maximal degree in co-relation 41653. Up to 5175 conditions per place. [2024-06-27 22:47:30,451 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 423 selfloop transitions, 97 changer transitions 0/535 dead transitions. [2024-06-27 22:47:30,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 535 transitions, 9296 flow [2024-06-27 22:47:30,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:47:30,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:47:30,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 226 transitions. [2024-06-27 22:47:30,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6141304347826086 [2024-06-27 22:47:30,452 INFO L175 Difference]: Start difference. First operand has 281 places, 484 transitions, 7818 flow. Second operand 8 states and 226 transitions. [2024-06-27 22:47:30,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 535 transitions, 9296 flow [2024-06-27 22:47:30,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 535 transitions, 9164 flow, removed 40 selfloop flow, removed 4 redundant places. [2024-06-27 22:47:30,985 INFO L231 Difference]: Finished difference. Result has 287 places, 493 transitions, 8075 flow [2024-06-27 22:47:30,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7688, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8075, PETRI_PLACES=287, PETRI_TRANSITIONS=493} [2024-06-27 22:47:30,986 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 235 predicate places. [2024-06-27 22:47:30,986 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 493 transitions, 8075 flow [2024-06-27 22:47:30,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:30,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:30,986 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:47:30,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 22:47:30,986 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:30,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:30,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1857726164, now seen corresponding path program 4 times [2024-06-27 22:47:30,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:30,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046442991] [2024-06-27 22:47:30,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:30,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:31,633 INFO 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:47:31,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:31,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046442991] [2024-06-27 22:47:31,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046442991] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:31,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:31,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:47:31,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742946908] [2024-06-27 22:47:31,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:31,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:47:31,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:31,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:47:31,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:47:31,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-06-27 22:47:31,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 493 transitions, 8075 flow. Second operand has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:31,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:31,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-06-27 22:47:31,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:32,946 INFO L124 PetriNetUnfolderBase]: 3779/6813 cut-off events. [2024-06-27 22:47:32,946 INFO L125 PetriNetUnfolderBase]: For 141163/141163 co-relation queries the response was YES. [2024-06-27 22:47:32,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42854 conditions, 6813 events. 3779/6813 cut-off events. For 141163/141163 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 52298 event pairs, 1255 based on Foata normal form. 6/6571 useless extension candidates. Maximal degree in co-relation 42729. Up to 5433 conditions per place. [2024-06-27 22:47:33,024 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 457 selfloop transitions, 48 changer transitions 0/519 dead transitions. [2024-06-27 22:47:33,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 519 transitions, 9214 flow [2024-06-27 22:47:33,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:47:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:47:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2024-06-27 22:47:33,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.538647342995169 [2024-06-27 22:47:33,026 INFO L175 Difference]: Start difference. First operand has 287 places, 493 transitions, 8075 flow. Second operand 9 states and 223 transitions. [2024-06-27 22:47:33,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 519 transitions, 9214 flow [2024-06-27 22:47:33,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 519 transitions, 9000 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-27 22:47:33,615 INFO L231 Difference]: Finished difference. Result has 292 places, 494 transitions, 7980 flow [2024-06-27 22:47:33,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7861, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7980, PETRI_PLACES=292, PETRI_TRANSITIONS=494} [2024-06-27 22:47:33,616 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 240 predicate places. [2024-06-27 22:47:33,616 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 494 transitions, 7980 flow [2024-06-27 22:47:33,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:33,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:33,616 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:47:33,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 22:47:33,617 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:33,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:33,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1857725978, now seen corresponding path program 2 times [2024-06-27 22:47:33,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:33,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565582274] [2024-06-27 22:47:33,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:33,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:34,184 INFO 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:47:34,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:34,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565582274] [2024-06-27 22:47:34,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565582274] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:34,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:34,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:47:34,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082797800] [2024-06-27 22:47:34,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:34,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:47:34,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:34,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:47:34,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:47:34,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:47:34,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 494 transitions, 7980 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:34,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:34,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:47:34,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:35,526 INFO L124 PetriNetUnfolderBase]: 3814/6874 cut-off events. [2024-06-27 22:47:35,526 INFO L125 PetriNetUnfolderBase]: For 143163/143163 co-relation queries the response was YES. [2024-06-27 22:47:35,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43268 conditions, 6874 events. 3814/6874 cut-off events. For 143163/143163 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 52963 event pairs, 1051 based on Foata normal form. 2/6627 useless extension candidates. Maximal degree in co-relation 43142. Up to 5485 conditions per place. [2024-06-27 22:47:35,599 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 452 selfloop transitions, 56 changer transitions 0/523 dead transitions. [2024-06-27 22:47:35,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 523 transitions, 9266 flow [2024-06-27 22:47:35,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:47:35,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:47:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions. [2024-06-27 22:47:35,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6024844720496895 [2024-06-27 22:47:35,601 INFO L175 Difference]: Start difference. First operand has 292 places, 494 transitions, 7980 flow. Second operand 7 states and 194 transitions. [2024-06-27 22:47:35,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 523 transitions, 9266 flow [2024-06-27 22:47:36,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 523 transitions, 9186 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-27 22:47:36,179 INFO L231 Difference]: Finished difference. Result has 293 places, 500 transitions, 8151 flow [2024-06-27 22:47:36,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7900, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8151, PETRI_PLACES=293, PETRI_TRANSITIONS=500} [2024-06-27 22:47:36,180 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 241 predicate places. [2024-06-27 22:47:36,180 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 500 transitions, 8151 flow [2024-06-27 22:47:36,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:36,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:36,180 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:47:36,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 22:47:36,181 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:36,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:36,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1417623292, now seen corresponding path program 5 times [2024-06-27 22:47:36,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:36,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935203737] [2024-06-27 22:47:36,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:36,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:47:36,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:36,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935203737] [2024-06-27 22:47:36,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935203737] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:36,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:36,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:47:36,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397275836] [2024-06-27 22:47:36,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:36,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:47:36,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:36,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:47:36,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:47:36,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-06-27 22:47:36,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 500 transitions, 8151 flow. Second operand has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:36,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:36,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-06-27 22:47:36,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:38,407 INFO L124 PetriNetUnfolderBase]: 3945/7106 cut-off events. [2024-06-27 22:47:38,407 INFO L125 PetriNetUnfolderBase]: For 162189/162189 co-relation queries the response was YES. [2024-06-27 22:47:38,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45038 conditions, 7106 events. 3945/7106 cut-off events. For 162189/162189 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 55058 event pairs, 1286 based on Foata normal form. 6/6858 useless extension candidates. Maximal degree in co-relation 44911. Up to 5519 conditions per place. [2024-06-27 22:47:38,477 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 470 selfloop transitions, 50 changer transitions 0/534 dead transitions. [2024-06-27 22:47:38,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 534 transitions, 9509 flow [2024-06-27 22:47:38,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:47:38,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:47:38,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 227 transitions. [2024-06-27 22:47:38,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5483091787439613 [2024-06-27 22:47:38,482 INFO L175 Difference]: Start difference. First operand has 293 places, 500 transitions, 8151 flow. Second operand 9 states and 227 transitions. [2024-06-27 22:47:38,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 534 transitions, 9509 flow [2024-06-27 22:47:39,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 534 transitions, 9410 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-27 22:47:39,111 INFO L231 Difference]: Finished difference. Result has 299 places, 503 transitions, 8218 flow [2024-06-27 22:47:39,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=8054, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8218, PETRI_PLACES=299, PETRI_TRANSITIONS=503} [2024-06-27 22:47:39,112 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 247 predicate places. [2024-06-27 22:47:39,112 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 503 transitions, 8218 flow [2024-06-27 22:47:39,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:39,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:39,112 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:47:39,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 22:47:39,112 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:39,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:39,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1857546488, now seen corresponding path program 3 times [2024-06-27 22:47:39,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:39,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70787580] [2024-06-27 22:47:39,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:39,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:39,639 INFO 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:47:39,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:39,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70787580] [2024-06-27 22:47:39,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70787580] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:39,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:39,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:47:39,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666129587] [2024-06-27 22:47:39,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:39,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:47:39,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:39,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:47:39,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:47:39,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:47:39,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 503 transitions, 8218 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:39,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:39,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:47:39,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:41,073 INFO L124 PetriNetUnfolderBase]: 3940/7122 cut-off events. [2024-06-27 22:47:41,073 INFO L125 PetriNetUnfolderBase]: For 157228/157228 co-relation queries the response was YES. [2024-06-27 22:47:41,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45232 conditions, 7122 events. 3940/7122 cut-off events. For 157228/157228 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 55252 event pairs, 1320 based on Foata normal form. 2/6865 useless extension candidates. Maximal degree in co-relation 45103. Up to 5678 conditions per place. [2024-06-27 22:47:41,159 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 457 selfloop transitions, 57 changer transitions 0/529 dead transitions. [2024-06-27 22:47:41,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 529 transitions, 9308 flow [2024-06-27 22:47:41,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:47:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:47:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 237 transitions. [2024-06-27 22:47:41,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.572463768115942 [2024-06-27 22:47:41,161 INFO L175 Difference]: Start difference. First operand has 299 places, 503 transitions, 8218 flow. Second operand 9 states and 237 transitions. [2024-06-27 22:47:41,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 529 transitions, 9308 flow [2024-06-27 22:47:41,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 529 transitions, 9227 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-27 22:47:41,744 INFO L231 Difference]: Finished difference. Result has 303 places, 503 transitions, 8261 flow [2024-06-27 22:47:41,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=8137, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8261, PETRI_PLACES=303, PETRI_TRANSITIONS=503} [2024-06-27 22:47:41,745 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 251 predicate places. [2024-06-27 22:47:41,745 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 503 transitions, 8261 flow [2024-06-27 22:47:41,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:41,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:41,746 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:47:41,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 22:47:41,746 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:41,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:41,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1857553184, now seen corresponding path program 6 times [2024-06-27 22:47:41,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:41,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894964025] [2024-06-27 22:47:41,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:41,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:42,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:47:42,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:42,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894964025] [2024-06-27 22:47:42,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894964025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:42,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:42,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:47:42,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125219849] [2024-06-27 22:47:42,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:42,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:47:42,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:42,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:47:42,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:47:42,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:47:42,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 503 transitions, 8261 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:42,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:42,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:47:42,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:43,750 INFO L124 PetriNetUnfolderBase]: 3927/7100 cut-off events. [2024-06-27 22:47:43,750 INFO L125 PetriNetUnfolderBase]: For 156695/156695 co-relation queries the response was YES. [2024-06-27 22:47:43,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44918 conditions, 7100 events. 3927/7100 cut-off events. For 156695/156695 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 55107 event pairs, 1313 based on Foata normal form. 6/6846 useless extension candidates. Maximal degree in co-relation 44788. Up to 5653 conditions per place. [2024-06-27 22:47:43,832 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 470 selfloop transitions, 48 changer transitions 0/533 dead transitions. [2024-06-27 22:47:43,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 533 transitions, 9437 flow [2024-06-27 22:47:43,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:47:43,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:47:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 258 transitions. [2024-06-27 22:47:43,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5608695652173913 [2024-06-27 22:47:43,833 INFO L175 Difference]: Start difference. First operand has 303 places, 503 transitions, 8261 flow. Second operand 10 states and 258 transitions. [2024-06-27 22:47:43,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 533 transitions, 9437 flow [2024-06-27 22:47:44,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 533 transitions, 9297 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-27 22:47:44,441 INFO L231 Difference]: Finished difference. Result has 304 places, 504 transitions, 8243 flow [2024-06-27 22:47:44,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=8123, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8243, PETRI_PLACES=304, PETRI_TRANSITIONS=504} [2024-06-27 22:47:44,441 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 252 predicate places. [2024-06-27 22:47:44,442 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 504 transitions, 8243 flow [2024-06-27 22:47:44,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:44,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:44,442 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:47:44,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-27 22:47:44,442 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:44,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:44,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1917547810, now seen corresponding path program 4 times [2024-06-27 22:47:44,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:44,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839555310] [2024-06-27 22:47:44,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:44,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:47:44,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:44,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839555310] [2024-06-27 22:47:44,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839555310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:44,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:44,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:47:44,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132896621] [2024-06-27 22:47:44,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:44,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:47:44,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:44,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:47:44,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:47:44,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:47:44,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 504 transitions, 8243 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:44,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:44,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:47:44,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:46,318 INFO L124 PetriNetUnfolderBase]: 3942/7134 cut-off events. [2024-06-27 22:47:46,318 INFO L125 PetriNetUnfolderBase]: For 150926/150926 co-relation queries the response was YES. [2024-06-27 22:47:46,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45043 conditions, 7134 events. 3942/7134 cut-off events. For 150926/150926 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 55533 event pairs, 1337 based on Foata normal form. 2/6874 useless extension candidates. Maximal degree in co-relation 44913. Up to 5751 conditions per place. [2024-06-27 22:47:46,403 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 482 selfloop transitions, 25 changer transitions 0/522 dead transitions. [2024-06-27 22:47:46,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 522 transitions, 9361 flow [2024-06-27 22:47:46,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:47:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:47:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions. [2024-06-27 22:47:46,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5797101449275363 [2024-06-27 22:47:46,405 INFO L175 Difference]: Start difference. First operand has 304 places, 504 transitions, 8243 flow. Second operand 6 states and 160 transitions. [2024-06-27 22:47:46,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 522 transitions, 9361 flow [2024-06-27 22:47:47,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 522 transitions, 9270 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-27 22:47:47,038 INFO L231 Difference]: Finished difference. Result has 303 places, 507 transitions, 8286 flow [2024-06-27 22:47:47,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=8152, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8286, PETRI_PLACES=303, PETRI_TRANSITIONS=507} [2024-06-27 22:47:47,038 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 251 predicate places. [2024-06-27 22:47:47,039 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 507 transitions, 8286 flow [2024-06-27 22:47:47,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:47,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:47,039 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:47:47,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-27 22:47:47,040 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:47,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:47,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1917541114, now seen corresponding path program 7 times [2024-06-27 22:47:47,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:47,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632386482] [2024-06-27 22:47:47,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:47,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:47,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:47:47,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:47,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632386482] [2024-06-27 22:47:47,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632386482] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:47,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:47,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:47:47,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161900196] [2024-06-27 22:47:47,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:47,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:47:47,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:47,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:47:47,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:47:47,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-06-27 22:47:47,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 507 transitions, 8286 flow. Second operand has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:47,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:47,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-06-27 22:47:47,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:49,103 INFO L124 PetriNetUnfolderBase]: 4010/7254 cut-off events. [2024-06-27 22:47:49,104 INFO L125 PetriNetUnfolderBase]: For 161127/161127 co-relation queries the response was YES. [2024-06-27 22:47:49,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45836 conditions, 7254 events. 4010/7254 cut-off events. For 161127/161127 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 56626 event pairs, 1276 based on Foata normal form. 6/7000 useless extension candidates. Maximal degree in co-relation 45704. Up to 5738 conditions per place. [2024-06-27 22:47:49,179 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 492 selfloop transitions, 38 changer transitions 0/544 dead transitions. [2024-06-27 22:47:49,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 544 transitions, 9684 flow [2024-06-27 22:47:49,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:47:49,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:47:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2024-06-27 22:47:49,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.538647342995169 [2024-06-27 22:47:49,181 INFO L175 Difference]: Start difference. First operand has 303 places, 507 transitions, 8286 flow. Second operand 9 states and 223 transitions. [2024-06-27 22:47:49,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 544 transitions, 9684 flow [2024-06-27 22:47:49,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 544 transitions, 9598 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-27 22:47:49,774 INFO L231 Difference]: Finished difference. Result has 309 places, 513 transitions, 8427 flow [2024-06-27 22:47:49,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=8200, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8427, PETRI_PLACES=309, PETRI_TRANSITIONS=513} [2024-06-27 22:47:49,775 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 257 predicate places. [2024-06-27 22:47:49,775 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 513 transitions, 8427 flow [2024-06-27 22:47:49,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:49,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:49,775 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:47:49,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-27 22:47:49,776 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:49,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:49,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1453891704, now seen corresponding path program 5 times [2024-06-27 22:47:49,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:49,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102414150] [2024-06-27 22:47:49,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:49,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:50,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:47:50,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:50,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102414150] [2024-06-27 22:47:50,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102414150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:50,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:50,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:47:50,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179205461] [2024-06-27 22:47:50,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:50,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:47:50,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:50,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:47:50,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:47:50,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:47:50,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 513 transitions, 8427 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:50,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:50,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:47:50,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:51,655 INFO L124 PetriNetUnfolderBase]: 4001/7246 cut-off events. [2024-06-27 22:47:51,655 INFO L125 PetriNetUnfolderBase]: For 158197/158197 co-relation queries the response was YES. [2024-06-27 22:47:51,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46230 conditions, 7246 events. 4001/7246 cut-off events. For 158197/158197 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 56705 event pairs, 1063 based on Foata normal form. 2/6985 useless extension candidates. Maximal degree in co-relation 46096. Up to 5830 conditions per place. [2024-06-27 22:47:51,744 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 492 selfloop transitions, 29 changer transitions 0/536 dead transitions. [2024-06-27 22:47:51,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 536 transitions, 9645 flow [2024-06-27 22:47:51,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:47:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:47:51,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-06-27 22:47:51,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-06-27 22:47:51,745 INFO L175 Difference]: Start difference. First operand has 309 places, 513 transitions, 8427 flow. Second operand 6 states and 161 transitions. [2024-06-27 22:47:51,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 536 transitions, 9645 flow [2024-06-27 22:47:52,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 536 transitions, 9446 flow, removed 65 selfloop flow, removed 6 redundant places. [2024-06-27 22:47:52,591 INFO L231 Difference]: Finished difference. Result has 311 places, 520 transitions, 8465 flow [2024-06-27 22:47:52,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=8254, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8465, PETRI_PLACES=311, PETRI_TRANSITIONS=520} [2024-06-27 22:47:52,592 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 259 predicate places. [2024-06-27 22:47:52,592 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 520 transitions, 8465 flow [2024-06-27 22:47:52,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:52,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:52,592 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:47:52,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-27 22:47:52,593 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:52,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:52,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1661934334, now seen corresponding path program 8 times [2024-06-27 22:47:52,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:52,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982683711] [2024-06-27 22:47:52,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:52,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:53,143 INFO 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:47:53,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:53,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982683711] [2024-06-27 22:47:53,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982683711] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:53,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:53,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:47:53,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97974744] [2024-06-27 22:47:53,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:53,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:47:53,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:53,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:47:53,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:47:53,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-06-27 22:47:53,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 520 transitions, 8465 flow. Second operand has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:53,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:53,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-06-27 22:47:53,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:54,648 INFO L124 PetriNetUnfolderBase]: 4060/7354 cut-off events. [2024-06-27 22:47:54,648 INFO L125 PetriNetUnfolderBase]: For 169806/169806 co-relation queries the response was YES. [2024-06-27 22:47:54,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46640 conditions, 7354 events. 4060/7354 cut-off events. For 169806/169806 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 57613 event pairs, 1378 based on Foata normal form. 6/7094 useless extension candidates. Maximal degree in co-relation 46503. Up to 5868 conditions per place. [2024-06-27 22:47:54,736 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 488 selfloop transitions, 41 changer transitions 0/543 dead transitions. [2024-06-27 22:47:54,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 543 transitions, 9654 flow [2024-06-27 22:47:54,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:47:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:47:54,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 218 transitions. [2024-06-27 22:47:54,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5265700483091788 [2024-06-27 22:47:54,737 INFO L175 Difference]: Start difference. First operand has 311 places, 520 transitions, 8465 flow. Second operand 9 states and 218 transitions. [2024-06-27 22:47:54,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 543 transitions, 9654 flow [2024-06-27 22:47:55,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 543 transitions, 9593 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-06-27 22:47:55,568 INFO L231 Difference]: Finished difference. Result has 318 places, 521 transitions, 8515 flow [2024-06-27 22:47:55,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=8404, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8515, PETRI_PLACES=318, PETRI_TRANSITIONS=521} [2024-06-27 22:47:55,569 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 266 predicate places. [2024-06-27 22:47:55,570 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 521 transitions, 8515 flow [2024-06-27 22:47:55,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:55,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:55,570 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:47:55,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-27 22:47:55,570 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:55,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:55,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1718672934, now seen corresponding path program 6 times [2024-06-27 22:47:55,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:55,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893008214] [2024-06-27 22:47:55,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:55,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:56,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:47:56,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:56,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893008214] [2024-06-27 22:47:56,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893008214] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:56,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:56,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:47:56,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120711381] [2024-06-27 22:47:56,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:56,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:47:56,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:56,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:47:56,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:47:56,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:47:56,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 521 transitions, 8515 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:56,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:56,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:47:56,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:47:57,518 INFO L124 PetriNetUnfolderBase]: 4075/7369 cut-off events. [2024-06-27 22:47:57,518 INFO L125 PetriNetUnfolderBase]: For 168815/168815 co-relation queries the response was YES. [2024-06-27 22:47:57,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47007 conditions, 7369 events. 4075/7369 cut-off events. For 168815/168815 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 57602 event pairs, 1373 based on Foata normal form. 2/7105 useless extension candidates. Maximal degree in co-relation 46869. Up to 5864 conditions per place. [2024-06-27 22:47:57,616 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 475 selfloop transitions, 54 changer transitions 0/544 dead transitions. [2024-06-27 22:47:57,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 544 transitions, 9799 flow [2024-06-27 22:47:57,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:47:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:47:57,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-06-27 22:47:57,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6159420289855072 [2024-06-27 22:47:57,618 INFO L175 Difference]: Start difference. First operand has 318 places, 521 transitions, 8515 flow. Second operand 6 states and 170 transitions. [2024-06-27 22:47:57,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 544 transitions, 9799 flow [2024-06-27 22:47:58,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 544 transitions, 9715 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 22:47:58,539 INFO L231 Difference]: Finished difference. Result has 318 places, 524 transitions, 8623 flow [2024-06-27 22:47:58,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=8431, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8623, PETRI_PLACES=318, PETRI_TRANSITIONS=524} [2024-06-27 22:47:58,540 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 266 predicate places. [2024-06-27 22:47:58,540 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 524 transitions, 8623 flow [2024-06-27 22:47:58,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:58,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:47:58,540 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:47:58,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-27 22:47:58,540 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:47:58,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:47:58,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1661756704, now seen corresponding path program 9 times [2024-06-27 22:47:58,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:47:58,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871435378] [2024-06-27 22:47:58,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:47:58,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:47:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:47:59,021 INFO 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:47:59,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:47:59,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871435378] [2024-06-27 22:47:59,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871435378] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:47:59,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:47:59,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:47:59,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411350712] [2024-06-27 22:47:59,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:47:59,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:47:59,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:47:59,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:47:59,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:47:59,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:47:59,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 524 transitions, 8623 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:47:59,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:47:59,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:47:59,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:00,542 INFO L124 PetriNetUnfolderBase]: 4182/7585 cut-off events. [2024-06-27 22:48:00,543 INFO L125 PetriNetUnfolderBase]: For 182339/182339 co-relation queries the response was YES. [2024-06-27 22:48:00,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48389 conditions, 7585 events. 4182/7585 cut-off events. For 182339/182339 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 59891 event pairs, 1071 based on Foata normal form. 6/7316 useless extension candidates. Maximal degree in co-relation 48251. Up to 5660 conditions per place. [2024-06-27 22:48:00,651 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 486 selfloop transitions, 82 changer transitions 0/583 dead transitions. [2024-06-27 22:48:00,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 583 transitions, 10364 flow [2024-06-27 22:48:00,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:48:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:48:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 208 transitions. [2024-06-27 22:48:00,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6459627329192547 [2024-06-27 22:48:00,653 INFO L175 Difference]: Start difference. First operand has 318 places, 524 transitions, 8623 flow. Second operand 7 states and 208 transitions. [2024-06-27 22:48:00,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 583 transitions, 10364 flow [2024-06-27 22:48:01,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 583 transitions, 10201 flow, removed 36 selfloop flow, removed 4 redundant places. [2024-06-27 22:48:01,649 INFO L231 Difference]: Finished difference. Result has 324 places, 537 transitions, 8978 flow [2024-06-27 22:48:01,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=8462, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8978, PETRI_PLACES=324, PETRI_TRANSITIONS=537} [2024-06-27 22:48:01,649 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 272 predicate places. [2024-06-27 22:48:01,649 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 537 transitions, 8978 flow [2024-06-27 22:48:01,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:01,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:01,650 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:48:01,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-27 22:48:01,650 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:48:01,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:01,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1661761354, now seen corresponding path program 10 times [2024-06-27 22:48:01,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:01,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766270721] [2024-06-27 22:48:01,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:01,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:02,283 INFO 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:48:02,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:02,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766270721] [2024-06-27 22:48:02,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766270721] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:02,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:02,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:48:02,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454872553] [2024-06-27 22:48:02,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:02,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:48:02,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:02,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:48:02,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:48:02,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-06-27 22:48:02,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 537 transitions, 8978 flow. Second operand has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:02,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:02,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-06-27 22:48:02,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:03,911 INFO L124 PetriNetUnfolderBase]: 4221/7669 cut-off events. [2024-06-27 22:48:03,911 INFO L125 PetriNetUnfolderBase]: For 183059/183059 co-relation queries the response was YES. [2024-06-27 22:48:03,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49353 conditions, 7669 events. 4221/7669 cut-off events. For 183059/183059 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 60560 event pairs, 1437 based on Foata normal form. 6/7397 useless extension candidates. Maximal degree in co-relation 49211. Up to 6111 conditions per place. [2024-06-27 22:48:04,008 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 504 selfloop transitions, 42 changer transitions 0/560 dead transitions. [2024-06-27 22:48:04,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 560 transitions, 10206 flow [2024-06-27 22:48:04,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:48:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:48:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 217 transitions. [2024-06-27 22:48:04,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5241545893719807 [2024-06-27 22:48:04,009 INFO L175 Difference]: Start difference. First operand has 324 places, 537 transitions, 8978 flow. Second operand 9 states and 217 transitions. [2024-06-27 22:48:04,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 560 transitions, 10206 flow [2024-06-27 22:48:04,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 560 transitions, 10164 flow, removed 13 selfloop flow, removed 1 redundant places. [2024-06-27 22:48:04,845 INFO L231 Difference]: Finished difference. Result has 332 places, 538 transitions, 9054 flow [2024-06-27 22:48:04,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=8940, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9054, PETRI_PLACES=332, PETRI_TRANSITIONS=538} [2024-06-27 22:48:04,846 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 280 predicate places. [2024-06-27 22:48:04,846 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 538 transitions, 9054 flow [2024-06-27 22:48:04,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:04,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:04,846 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:48:04,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-27 22:48:04,847 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:48:04,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:04,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1718845914, now seen corresponding path program 7 times [2024-06-27 22:48:04,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:04,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898169513] [2024-06-27 22:48:04,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:04,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:05,316 INFO 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:48:05,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:05,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898169513] [2024-06-27 22:48:05,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898169513] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:05,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:05,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:48:05,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949708482] [2024-06-27 22:48:05,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:05,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:48:05,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:05,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:48:05,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:48:05,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:48:05,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 538 transitions, 9054 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:05,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:05,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:48:05,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:06,904 INFO L124 PetriNetUnfolderBase]: 4216/7648 cut-off events. [2024-06-27 22:48:06,904 INFO L125 PetriNetUnfolderBase]: For 175439/175439 co-relation queries the response was YES. [2024-06-27 22:48:06,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49138 conditions, 7648 events. 4216/7648 cut-off events. For 175439/175439 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 60269 event pairs, 1427 based on Foata normal form. 2/7376 useless extension candidates. Maximal degree in co-relation 48994. Up to 6082 conditions per place. [2024-06-27 22:48:06,998 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 488 selfloop transitions, 57 changer transitions 0/560 dead transitions. [2024-06-27 22:48:06,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 560 transitions, 10202 flow [2024-06-27 22:48:06,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:48:06,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:48:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2024-06-27 22:48:06,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6231884057971014 [2024-06-27 22:48:06,999 INFO L175 Difference]: Start difference. First operand has 332 places, 538 transitions, 9054 flow. Second operand 6 states and 172 transitions. [2024-06-27 22:48:06,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 560 transitions, 10202 flow [2024-06-27 22:48:07,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 560 transitions, 10098 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-27 22:48:07,865 INFO L231 Difference]: Finished difference. Result has 332 places, 538 transitions, 9073 flow [2024-06-27 22:48:07,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=8950, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9073, PETRI_PLACES=332, PETRI_TRANSITIONS=538} [2024-06-27 22:48:07,865 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 280 predicate places. [2024-06-27 22:48:07,866 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 538 transitions, 9073 flow [2024-06-27 22:48:07,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:07,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:07,866 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:48:07,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-27 22:48:07,866 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:48:07,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:07,866 INFO L85 PathProgramCache]: Analyzing trace with hash 399617197, now seen corresponding path program 1 times [2024-06-27 22:48:07,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:07,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870811735] [2024-06-27 22:48:07,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:07,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:07,934 INFO 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:48:07,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:07,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870811735] [2024-06-27 22:48:07,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870811735] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:07,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:07,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:48:07,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656822722] [2024-06-27 22:48:07,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:07,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:48:07,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:07,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:48:07,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:48:07,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-06-27 22:48:07,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 538 transitions, 9073 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:07,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:07,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-06-27 22:48:07,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:10,394 INFO L124 PetriNetUnfolderBase]: 6689/11309 cut-off events. [2024-06-27 22:48:10,394 INFO L125 PetriNetUnfolderBase]: For 207910/208195 co-relation queries the response was YES. [2024-06-27 22:48:10,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69835 conditions, 11309 events. 6689/11309 cut-off events. For 207910/208195 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 88177 event pairs, 1685 based on Foata normal form. 109/10997 useless extension candidates. Maximal degree in co-relation 69691. Up to 6669 conditions per place. [2024-06-27 22:48:10,552 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 476 selfloop transitions, 25 changer transitions 206/848 dead transitions. [2024-06-27 22:48:10,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 848 transitions, 14799 flow [2024-06-27 22:48:10,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:48:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:48:10,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 234 transitions. [2024-06-27 22:48:10,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6358695652173914 [2024-06-27 22:48:10,553 INFO L175 Difference]: Start difference. First operand has 332 places, 538 transitions, 9073 flow. Second operand 8 states and 234 transitions. [2024-06-27 22:48:10,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 848 transitions, 14799 flow [2024-06-27 22:48:11,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 848 transitions, 14582 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-27 22:48:11,677 INFO L231 Difference]: Finished difference. Result has 337 places, 550 transitions, 9108 flow [2024-06-27 22:48:11,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=8856, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9108, PETRI_PLACES=337, PETRI_TRANSITIONS=550} [2024-06-27 22:48:11,678 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 285 predicate places. [2024-06-27 22:48:11,678 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 550 transitions, 9108 flow [2024-06-27 22:48:11,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:11,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:11,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:48:11,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-27 22:48:11,679 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:48:11,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:11,679 INFO L85 PathProgramCache]: Analyzing trace with hash 417663644, now seen corresponding path program 1 times [2024-06-27 22:48:11,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:11,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765863630] [2024-06-27 22:48:11,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:11,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:12,177 INFO 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:48:12,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:12,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765863630] [2024-06-27 22:48:12,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765863630] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:12,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:12,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:48:12,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865572498] [2024-06-27 22:48:12,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:12,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:48:12,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:12,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:48:12,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:48:12,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-06-27 22:48:12,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 550 transitions, 9108 flow. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:12,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:12,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-06-27 22:48:12,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:14,301 INFO L124 PetriNetUnfolderBase]: 5271/9255 cut-off events. [2024-06-27 22:48:14,301 INFO L125 PetriNetUnfolderBase]: For 205014/205055 co-relation queries the response was YES. [2024-06-27 22:48:14,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61650 conditions, 9255 events. 5271/9255 cut-off events. For 205014/205055 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 71473 event pairs, 1263 based on Foata normal form. 12/9187 useless extension candidates. Maximal degree in co-relation 61502. Up to 7317 conditions per place. [2024-06-27 22:48:14,411 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 518 selfloop transitions, 70 changer transitions 5/606 dead transitions. [2024-06-27 22:48:14,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 606 transitions, 10733 flow [2024-06-27 22:48:14,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:48:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:48:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 248 transitions. [2024-06-27 22:48:14,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5391304347826087 [2024-06-27 22:48:14,412 INFO L175 Difference]: Start difference. First operand has 337 places, 550 transitions, 9108 flow. Second operand 10 states and 248 transitions. [2024-06-27 22:48:14,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 606 transitions, 10733 flow [2024-06-27 22:48:15,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 606 transitions, 10721 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-27 22:48:15,419 INFO L231 Difference]: Finished difference. Result has 348 places, 557 transitions, 9428 flow [2024-06-27 22:48:15,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=9096, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9428, PETRI_PLACES=348, PETRI_TRANSITIONS=557} [2024-06-27 22:48:15,421 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 296 predicate places. [2024-06-27 22:48:15,421 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 557 transitions, 9428 flow [2024-06-27 22:48:15,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:15,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:15,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:48:15,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-27 22:48:15,422 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:48:15,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:15,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1077000622, now seen corresponding path program 2 times [2024-06-27 22:48:15,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:15,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604885206] [2024-06-27 22:48:15,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:15,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:48:15,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:15,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604885206] [2024-06-27 22:48:15,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604885206] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:15,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:15,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:48:15,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089592778] [2024-06-27 22:48:15,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:15,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:48:15,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:15,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:48:15,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:48:16,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:48:16,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 557 transitions, 9428 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:16,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:16,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:48:16,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:17,709 INFO L124 PetriNetUnfolderBase]: 4418/7926 cut-off events. [2024-06-27 22:48:17,709 INFO L125 PetriNetUnfolderBase]: For 189288/189325 co-relation queries the response was YES. [2024-06-27 22:48:17,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53308 conditions, 7926 events. 4418/7926 cut-off events. For 189288/189325 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 62201 event pairs, 787 based on Foata normal form. 10/7841 useless extension candidates. Maximal degree in co-relation 53156. Up to 5544 conditions per place. [2024-06-27 22:48:17,812 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 398 selfloop transitions, 182 changer transitions 0/596 dead transitions. [2024-06-27 22:48:17,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 596 transitions, 10928 flow [2024-06-27 22:48:17,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:48:17,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:48:17,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2024-06-27 22:48:17,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6195652173913043 [2024-06-27 22:48:17,814 INFO L175 Difference]: Start difference. First operand has 348 places, 557 transitions, 9428 flow. Second operand 6 states and 171 transitions. [2024-06-27 22:48:17,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 596 transitions, 10928 flow [2024-06-27 22:48:18,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 596 transitions, 10718 flow, removed 48 selfloop flow, removed 7 redundant places. [2024-06-27 22:48:18,878 INFO L231 Difference]: Finished difference. Result has 344 places, 571 transitions, 9855 flow [2024-06-27 22:48:18,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=9218, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9855, PETRI_PLACES=344, PETRI_TRANSITIONS=571} [2024-06-27 22:48:18,879 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 292 predicate places. [2024-06-27 22:48:18,879 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 571 transitions, 9855 flow [2024-06-27 22:48:18,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:18,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:18,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:48:18,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-27 22:48:18,880 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:48:18,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:18,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2024652280, now seen corresponding path program 3 times [2024-06-27 22:48:18,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:18,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309466120] [2024-06-27 22:48:18,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:18,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:19,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:48:19,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:19,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309466120] [2024-06-27 22:48:19,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309466120] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:19,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:19,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:48:19,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117242171] [2024-06-27 22:48:19,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:19,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:48:19,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:19,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:48:19,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:48:19,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-06-27 22:48:19,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 571 transitions, 9855 flow. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:19,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:19,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-06-27 22:48:19,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:21,498 INFO L124 PetriNetUnfolderBase]: 5137/8986 cut-off events. [2024-06-27 22:48:21,498 INFO L125 PetriNetUnfolderBase]: For 206317/206360 co-relation queries the response was YES. [2024-06-27 22:48:21,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60615 conditions, 8986 events. 5137/8986 cut-off events. For 206317/206360 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 69063 event pairs, 1182 based on Foata normal form. 12/8915 useless extension candidates. Maximal degree in co-relation 60464. Up to 7269 conditions per place. [2024-06-27 22:48:21,602 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 552 selfloop transitions, 58 changer transitions 0/623 dead transitions. [2024-06-27 22:48:21,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 623 transitions, 11461 flow [2024-06-27 22:48:21,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:48:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:48:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 239 transitions. [2024-06-27 22:48:21,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5195652173913043 [2024-06-27 22:48:21,604 INFO L175 Difference]: Start difference. First operand has 344 places, 571 transitions, 9855 flow. Second operand 10 states and 239 transitions. [2024-06-27 22:48:21,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 623 transitions, 11461 flow [2024-06-27 22:48:22,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 623 transitions, 11313 flow, removed 36 selfloop flow, removed 2 redundant places. [2024-06-27 22:48:22,790 INFO L231 Difference]: Finished difference. Result has 353 places, 586 transitions, 10128 flow [2024-06-27 22:48:22,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=9711, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10128, PETRI_PLACES=353, PETRI_TRANSITIONS=586} [2024-06-27 22:48:22,791 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 301 predicate places. [2024-06-27 22:48:22,791 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 586 transitions, 10128 flow [2024-06-27 22:48:22,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:22,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:22,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:48:22,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-27 22:48:22,791 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:48:22,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash -11800380, now seen corresponding path program 1 times [2024-06-27 22:48:22,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:22,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741715347] [2024-06-27 22:48:22,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:22,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:48:23,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:23,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741715347] [2024-06-27 22:48:23,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741715347] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:23,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:23,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:48:23,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600974256] [2024-06-27 22:48:23,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:23,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:48:23,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:23,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:48:23,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:48:23,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-06-27 22:48:23,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 586 transitions, 10128 flow. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:23,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:23,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-06-27 22:48:23,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:25,347 INFO L124 PetriNetUnfolderBase]: 5202/9059 cut-off events. [2024-06-27 22:48:25,348 INFO L125 PetriNetUnfolderBase]: For 209191/209234 co-relation queries the response was YES. [2024-06-27 22:48:25,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61634 conditions, 9059 events. 5202/9059 cut-off events. For 209191/209234 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 69422 event pairs, 1182 based on Foata normal form. 12/8983 useless extension candidates. Maximal degree in co-relation 61480. Up to 7247 conditions per place. [2024-06-27 22:48:25,470 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 561 selfloop transitions, 67 changer transitions 0/641 dead transitions. [2024-06-27 22:48:25,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 641 transitions, 11865 flow [2024-06-27 22:48:25,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:48:25,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:48:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 265 transitions. [2024-06-27 22:48:25,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5237154150197628 [2024-06-27 22:48:25,472 INFO L175 Difference]: Start difference. First operand has 353 places, 586 transitions, 10128 flow. Second operand 11 states and 265 transitions. [2024-06-27 22:48:25,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 641 transitions, 11865 flow [2024-06-27 22:48:26,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 641 transitions, 11720 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-27 22:48:26,743 INFO L231 Difference]: Finished difference. Result has 358 places, 600 transitions, 10394 flow [2024-06-27 22:48:26,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=9983, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10394, PETRI_PLACES=358, PETRI_TRANSITIONS=600} [2024-06-27 22:48:26,744 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 306 predicate places. [2024-06-27 22:48:26,744 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 600 transitions, 10394 flow [2024-06-27 22:48:26,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:26,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:26,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:48:26,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-27 22:48:26,745 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:48:26,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:26,745 INFO L85 PathProgramCache]: Analyzing trace with hash -11534400, now seen corresponding path program 2 times [2024-06-27 22:48:26,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:26,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497009580] [2024-06-27 22:48:26,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:26,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:27,148 INFO 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:48:27,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:27,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497009580] [2024-06-27 22:48:27,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497009580] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:27,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:27,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:48:27,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869364058] [2024-06-27 22:48:27,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:27,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:48:27,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:27,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:48:27,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:48:27,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:48:27,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 600 transitions, 10394 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:27,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:27,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:48:27,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:29,022 INFO L124 PetriNetUnfolderBase]: 4575/8148 cut-off events. [2024-06-27 22:48:29,023 INFO L125 PetriNetUnfolderBase]: For 206603/206640 co-relation queries the response was YES. [2024-06-27 22:48:29,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55647 conditions, 8148 events. 4575/8148 cut-off events. For 206603/206640 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 63715 event pairs, 1098 based on Foata normal form. 10/8062 useless extension candidates. Maximal degree in co-relation 55492. Up to 6260 conditions per place. [2024-06-27 22:48:29,135 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 513 selfloop transitions, 86 changer transitions 0/615 dead transitions. [2024-06-27 22:48:29,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 615 transitions, 11701 flow [2024-06-27 22:48:29,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:48:29,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:48:29,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-06-27 22:48:29,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-27 22:48:29,137 INFO L175 Difference]: Start difference. First operand has 358 places, 600 transitions, 10394 flow. Second operand 5 states and 138 transitions. [2024-06-27 22:48:29,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 615 transitions, 11701 flow [2024-06-27 22:48:30,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 615 transitions, 11514 flow, removed 77 selfloop flow, removed 4 redundant places. [2024-06-27 22:48:30,166 INFO L231 Difference]: Finished difference. Result has 359 places, 603 transitions, 10490 flow [2024-06-27 22:48:30,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=10207, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10490, PETRI_PLACES=359, PETRI_TRANSITIONS=603} [2024-06-27 22:48:30,167 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 307 predicate places. [2024-06-27 22:48:30,167 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 603 transitions, 10490 flow [2024-06-27 22:48:30,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:30,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:30,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:48:30,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-27 22:48:30,168 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:48:30,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:30,168 INFO L85 PathProgramCache]: Analyzing trace with hash -721762542, now seen corresponding path program 4 times [2024-06-27 22:48:30,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:30,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195526978] [2024-06-27 22:48:30,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:30,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:30,734 INFO 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:48:30,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:30,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195526978] [2024-06-27 22:48:30,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195526978] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:30,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:30,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:48:30,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91422503] [2024-06-27 22:48:30,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:30,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:48:30,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:30,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:48:30,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:48:30,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:48:30,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 603 transitions, 10490 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:30,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:30,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:48:30,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:32,512 INFO L124 PetriNetUnfolderBase]: 4610/8181 cut-off events. [2024-06-27 22:48:32,513 INFO L125 PetriNetUnfolderBase]: For 207287/207356 co-relation queries the response was YES. [2024-06-27 22:48:32,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56361 conditions, 8181 events. 4610/8181 cut-off events. For 207287/207356 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 63841 event pairs, 764 based on Foata normal form. 8/8093 useless extension candidates. Maximal degree in co-relation 56205. Up to 5500 conditions per place. [2024-06-27 22:48:32,628 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 421 selfloop transitions, 204 changer transitions 0/641 dead transitions. [2024-06-27 22:48:32,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 641 transitions, 12312 flow [2024-06-27 22:48:32,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:48:32,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:48:32,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2024-06-27 22:48:32,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6149068322981367 [2024-06-27 22:48:32,629 INFO L175 Difference]: Start difference. First operand has 359 places, 603 transitions, 10490 flow. Second operand 7 states and 198 transitions. [2024-06-27 22:48:32,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 641 transitions, 12312 flow [2024-06-27 22:48:33,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 641 transitions, 12100 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-27 22:48:33,820 INFO L231 Difference]: Finished difference. Result has 362 places, 612 transitions, 10973 flow [2024-06-27 22:48:33,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=10282, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10973, PETRI_PLACES=362, PETRI_TRANSITIONS=612} [2024-06-27 22:48:33,820 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 310 predicate places. [2024-06-27 22:48:33,821 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 612 transitions, 10973 flow [2024-06-27 22:48:33,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:33,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:33,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:48:33,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-27 22:48:33,821 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:48:33,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:33,822 INFO L85 PathProgramCache]: Analyzing trace with hash -954989804, now seen corresponding path program 5 times [2024-06-27 22:48:33,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:33,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898794578] [2024-06-27 22:48:33,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:33,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:48:34,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:34,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898794578] [2024-06-27 22:48:34,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898794578] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:34,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:34,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:48:34,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628370344] [2024-06-27 22:48:34,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:34,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:48:34,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:34,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:48:34,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:48:34,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:48:34,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 612 transitions, 10973 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:34,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:34,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:48:34,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:36,135 INFO L124 PetriNetUnfolderBase]: 4644/8250 cut-off events. [2024-06-27 22:48:36,135 INFO L125 PetriNetUnfolderBase]: For 218080/218117 co-relation queries the response was YES. [2024-06-27 22:48:36,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57837 conditions, 8250 events. 4644/8250 cut-off events. For 218080/218117 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 64534 event pairs, 758 based on Foata normal form. 8/8176 useless extension candidates. Maximal degree in co-relation 57681. Up to 5530 conditions per place. [2024-06-27 22:48:36,254 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 415 selfloop transitions, 213 changer transitions 0/644 dead transitions. [2024-06-27 22:48:36,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 644 transitions, 12713 flow [2024-06-27 22:48:36,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:48:36,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:48:36,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2024-06-27 22:48:36,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2024-06-27 22:48:36,256 INFO L175 Difference]: Start difference. First operand has 362 places, 612 transitions, 10973 flow. Second operand 7 states and 196 transitions. [2024-06-27 22:48:36,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 644 transitions, 12713 flow [2024-06-27 22:48:37,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 644 transitions, 12353 flow, removed 104 selfloop flow, removed 2 redundant places. [2024-06-27 22:48:37,600 INFO L231 Difference]: Finished difference. Result has 367 places, 618 transitions, 11237 flow [2024-06-27 22:48:37,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=10675, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=207, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11237, PETRI_PLACES=367, PETRI_TRANSITIONS=618} [2024-06-27 22:48:37,601 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 315 predicate places. [2024-06-27 22:48:37,601 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 618 transitions, 11237 flow [2024-06-27 22:48:37,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:37,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:37,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:48:37,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-27 22:48:37,602 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:48:37,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:37,602 INFO L85 PathProgramCache]: Analyzing trace with hash -636416795, now seen corresponding path program 1 times [2024-06-27 22:48:37,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:37,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975711220] [2024-06-27 22:48:37,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:37,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:38,023 INFO 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:48:38,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:38,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975711220] [2024-06-27 22:48:38,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975711220] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:38,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:38,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:48:38,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376002242] [2024-06-27 22:48:38,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:38,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:48:38,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:38,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:48:38,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:48:38,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:48:38,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 618 transitions, 11237 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:38,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:38,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:48:38,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:40,015 INFO L124 PetriNetUnfolderBase]: 4697/8321 cut-off events. [2024-06-27 22:48:40,015 INFO L125 PetriNetUnfolderBase]: For 225727/225808 co-relation queries the response was YES. [2024-06-27 22:48:40,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59115 conditions, 8321 events. 4697/8321 cut-off events. For 225727/225808 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 65016 event pairs, 1214 based on Foata normal form. 15/8197 useless extension candidates. Maximal degree in co-relation 58957. Up to 6604 conditions per place. [2024-06-27 22:48:40,120 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 508 selfloop transitions, 138 changer transitions 0/662 dead transitions. [2024-06-27 22:48:40,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 662 transitions, 13133 flow [2024-06-27 22:48:40,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:48:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:48:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 221 transitions. [2024-06-27 22:48:40,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6005434782608695 [2024-06-27 22:48:40,121 INFO L175 Difference]: Start difference. First operand has 367 places, 618 transitions, 11237 flow. Second operand 8 states and 221 transitions. [2024-06-27 22:48:40,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 662 transitions, 13133 flow [2024-06-27 22:48:41,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 662 transitions, 12774 flow, removed 23 selfloop flow, removed 3 redundant places. [2024-06-27 22:48:41,511 INFO L231 Difference]: Finished difference. Result has 374 places, 636 transitions, 11654 flow [2024-06-27 22:48:41,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=10887, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11654, PETRI_PLACES=374, PETRI_TRANSITIONS=636} [2024-06-27 22:48:41,515 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 322 predicate places. [2024-06-27 22:48:41,515 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 636 transitions, 11654 flow [2024-06-27 22:48:41,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:41,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:41,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:48:41,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-27 22:48:41,516 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:48:41,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:41,516 INFO L85 PathProgramCache]: Analyzing trace with hash -961574204, now seen corresponding path program 6 times [2024-06-27 22:48:41,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:41,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247424638] [2024-06-27 22:48:41,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:41,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:42,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:48:42,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:42,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247424638] [2024-06-27 22:48:42,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247424638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:42,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:42,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:48:42,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000698221] [2024-06-27 22:48:42,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:42,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:48:42,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:42,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:48:42,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:48:42,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:48:42,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 636 transitions, 11654 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:42,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:42,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:48:42,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:44,016 INFO L124 PetriNetUnfolderBase]: 4695/8298 cut-off events. [2024-06-27 22:48:44,016 INFO L125 PetriNetUnfolderBase]: For 231013/231082 co-relation queries the response was YES. [2024-06-27 22:48:44,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59312 conditions, 8298 events. 4695/8298 cut-off events. For 231013/231082 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 64675 event pairs, 804 based on Foata normal form. 8/8208 useless extension candidates. Maximal degree in co-relation 59151. Up to 5587 conditions per place. [2024-06-27 22:48:44,144 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 450 selfloop transitions, 200 changer transitions 0/666 dead transitions. [2024-06-27 22:48:44,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 666 transitions, 13384 flow [2024-06-27 22:48:44,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:48:44,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:48:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 199 transitions. [2024-06-27 22:48:44,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6180124223602484 [2024-06-27 22:48:44,145 INFO L175 Difference]: Start difference. First operand has 374 places, 636 transitions, 11654 flow. Second operand 7 states and 199 transitions. [2024-06-27 22:48:44,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 666 transitions, 13384 flow [2024-06-27 22:48:45,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 666 transitions, 13161 flow, removed 65 selfloop flow, removed 3 redundant places. [2024-06-27 22:48:45,617 INFO L231 Difference]: Finished difference. Result has 378 places, 636 transitions, 11838 flow [2024-06-27 22:48:45,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=11431, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11838, PETRI_PLACES=378, PETRI_TRANSITIONS=636} [2024-06-27 22:48:45,618 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 326 predicate places. [2024-06-27 22:48:45,618 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 636 transitions, 11838 flow [2024-06-27 22:48:45,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:45,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:45,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:48:45,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-27 22:48:45,618 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:48:45,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:45,619 INFO L85 PathProgramCache]: Analyzing trace with hash -951623204, now seen corresponding path program 7 times [2024-06-27 22:48:45,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:45,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022670] [2024-06-27 22:48:45,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:45,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:46,176 INFO 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:48:46,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:46,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022670] [2024-06-27 22:48:46,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022670] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:46,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:46,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:48:46,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057880470] [2024-06-27 22:48:46,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:46,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:48:46,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:46,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:48:46,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:48:46,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:48:46,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 636 transitions, 11838 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:46,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:46,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:48:46,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:48,062 INFO L124 PetriNetUnfolderBase]: 4725/8364 cut-off events. [2024-06-27 22:48:48,062 INFO L125 PetriNetUnfolderBase]: For 238968/239005 co-relation queries the response was YES. [2024-06-27 22:48:48,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60460 conditions, 8364 events. 4725/8364 cut-off events. For 238968/239005 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 65319 event pairs, 819 based on Foata normal form. 8/8281 useless extension candidates. Maximal degree in co-relation 60297. Up to 6161 conditions per place. [2024-06-27 22:48:48,188 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 504 selfloop transitions, 146 changer transitions 0/666 dead transitions. [2024-06-27 22:48:48,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 666 transitions, 13316 flow [2024-06-27 22:48:48,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:48:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:48:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 190 transitions. [2024-06-27 22:48:48,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5900621118012422 [2024-06-27 22:48:48,189 INFO L175 Difference]: Start difference. First operand has 378 places, 636 transitions, 11838 flow. Second operand 7 states and 190 transitions. [2024-06-27 22:48:48,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 666 transitions, 13316 flow [2024-06-27 22:48:49,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 666 transitions, 12665 flow, removed 60 selfloop flow, removed 6 redundant places. [2024-06-27 22:48:49,782 INFO L231 Difference]: Finished difference. Result has 379 places, 642 transitions, 11609 flow [2024-06-27 22:48:49,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=11229, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11609, PETRI_PLACES=379, PETRI_TRANSITIONS=642} [2024-06-27 22:48:49,783 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 327 predicate places. [2024-06-27 22:48:49,783 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 642 transitions, 11609 flow [2024-06-27 22:48:49,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:49,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:49,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:48:49,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-27 22:48:49,784 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:48:49,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:49,784 INFO L85 PathProgramCache]: Analyzing trace with hash -727898496, now seen corresponding path program 3 times [2024-06-27 22:48:49,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:49,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242634372] [2024-06-27 22:48:49,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:49,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:48:50,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:50,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242634372] [2024-06-27 22:48:50,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242634372] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:50,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:50,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:48:50,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609249274] [2024-06-27 22:48:50,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:50,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:48:50,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:50,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:48:50,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:48:50,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:48:50,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 642 transitions, 11609 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:50,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:50,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:48:50,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:52,490 INFO L124 PetriNetUnfolderBase]: 4790/8455 cut-off events. [2024-06-27 22:48:52,490 INFO L125 PetriNetUnfolderBase]: For 246837/246906 co-relation queries the response was YES. [2024-06-27 22:48:52,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60642 conditions, 8455 events. 4790/8455 cut-off events. For 246837/246906 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 65989 event pairs, 838 based on Foata normal form. 8/8362 useless extension candidates. Maximal degree in co-relation 60478. Up to 5977 conditions per place. [2024-06-27 22:48:52,603 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 490 selfloop transitions, 177 changer transitions 0/683 dead transitions. [2024-06-27 22:48:52,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 683 transitions, 13508 flow [2024-06-27 22:48:52,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:48:52,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:48:52,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2024-06-27 22:48:52,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.595108695652174 [2024-06-27 22:48:52,604 INFO L175 Difference]: Start difference. First operand has 379 places, 642 transitions, 11609 flow. Second operand 8 states and 219 transitions. [2024-06-27 22:48:52,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 683 transitions, 13508 flow [2024-06-27 22:48:54,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 683 transitions, 13167 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-27 22:48:54,115 INFO L231 Difference]: Finished difference. Result has 385 places, 653 transitions, 11907 flow [2024-06-27 22:48:54,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=11283, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11907, PETRI_PLACES=385, PETRI_TRANSITIONS=653} [2024-06-27 22:48:54,116 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 333 predicate places. [2024-06-27 22:48:54,116 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 653 transitions, 11907 flow [2024-06-27 22:48:54,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:54,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:54,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:48:54,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-27 22:48:54,117 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:48:54,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:54,117 INFO L85 PathProgramCache]: Analyzing trace with hash -951270734, now seen corresponding path program 8 times [2024-06-27 22:48:54,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:54,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114513842] [2024-06-27 22:48:54,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:54,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:54,680 INFO 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:48:54,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:54,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114513842] [2024-06-27 22:48:54,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114513842] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:54,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:54,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:48:54,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803148855] [2024-06-27 22:48:54,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:54,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:48:54,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:54,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:48:54,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:48:54,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:48:54,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 653 transitions, 11907 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:54,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:54,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:48:54,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:48:56,714 INFO L124 PetriNetUnfolderBase]: 4856/8583 cut-off events. [2024-06-27 22:48:56,714 INFO L125 PetriNetUnfolderBase]: For 258987/259024 co-relation queries the response was YES. [2024-06-27 22:48:56,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61991 conditions, 8583 events. 4856/8583 cut-off events. For 258987/259024 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 67241 event pairs, 774 based on Foata normal form. 8/8499 useless extension candidates. Maximal degree in co-relation 61824. Up to 6201 conditions per place. [2024-06-27 22:48:56,845 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 495 selfloop transitions, 175 changer transitions 0/686 dead transitions. [2024-06-27 22:48:56,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 686 transitions, 13585 flow [2024-06-27 22:48:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:48:56,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:48:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 191 transitions. [2024-06-27 22:48:56,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.593167701863354 [2024-06-27 22:48:56,847 INFO L175 Difference]: Start difference. First operand has 385 places, 653 transitions, 11907 flow. Second operand 7 states and 191 transitions. [2024-06-27 22:48:56,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 686 transitions, 13585 flow [2024-06-27 22:48:58,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 686 transitions, 13236 flow, removed 72 selfloop flow, removed 3 redundant places. [2024-06-27 22:48:58,635 INFO L231 Difference]: Finished difference. Result has 390 places, 664 transitions, 12124 flow [2024-06-27 22:48:58,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=11558, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12124, PETRI_PLACES=390, PETRI_TRANSITIONS=664} [2024-06-27 22:48:58,636 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 338 predicate places. [2024-06-27 22:48:58,636 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 664 transitions, 12124 flow [2024-06-27 22:48:58,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:58,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:48:58,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:48:58,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-27 22:48:58,637 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:48:58,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:48:58,637 INFO L85 PathProgramCache]: Analyzing trace with hash -717709199, now seen corresponding path program 2 times [2024-06-27 22:48:58,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:48:58,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294816624] [2024-06-27 22:48:58,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:48:58,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:48:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:48:59,063 INFO 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:48:59,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:48:59,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294816624] [2024-06-27 22:48:59,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294816624] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:48:59,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:48:59,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:48:59,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987844836] [2024-06-27 22:48:59,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:48:59,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:48:59,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:48:59,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:48:59,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:48:59,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:48:59,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 664 transitions, 12124 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:48:59,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:48:59,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:48:59,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:01,143 INFO L124 PetriNetUnfolderBase]: 4871/8603 cut-off events. [2024-06-27 22:49:01,144 INFO L125 PetriNetUnfolderBase]: For 257560/257609 co-relation queries the response was YES. [2024-06-27 22:49:01,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62750 conditions, 8603 events. 4871/8603 cut-off events. For 257560/257609 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 67411 event pairs, 1226 based on Foata normal form. 15/8480 useless extension candidates. Maximal degree in co-relation 62580. Up to 6919 conditions per place. [2024-06-27 22:49:01,277 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 576 selfloop transitions, 106 changer transitions 0/698 dead transitions. [2024-06-27 22:49:01,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 698 transitions, 13877 flow [2024-06-27 22:49:01,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:49:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:49:01,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 264 transitions. [2024-06-27 22:49:01,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5739130434782609 [2024-06-27 22:49:01,279 INFO L175 Difference]: Start difference. First operand has 390 places, 664 transitions, 12124 flow. Second operand 10 states and 264 transitions. [2024-06-27 22:49:01,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 698 transitions, 13877 flow [2024-06-27 22:49:03,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 698 transitions, 13640 flow, removed 26 selfloop flow, removed 2 redundant places. [2024-06-27 22:49:03,101 INFO L231 Difference]: Finished difference. Result has 399 places, 673 transitions, 12334 flow [2024-06-27 22:49:03,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=11888, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12334, PETRI_PLACES=399, PETRI_TRANSITIONS=673} [2024-06-27 22:49:03,102 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 347 predicate places. [2024-06-27 22:49:03,102 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 673 transitions, 12334 flow [2024-06-27 22:49:03,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:03,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:03,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:49:03,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-27 22:49:03,103 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:49:03,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:03,103 INFO L85 PathProgramCache]: Analyzing trace with hash -717721692, now seen corresponding path program 9 times [2024-06-27 22:49:03,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:03,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234674478] [2024-06-27 22:49:03,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:03,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:03,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:49:03,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:03,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234674478] [2024-06-27 22:49:03,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234674478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:03,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:03,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:49:03,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017255263] [2024-06-27 22:49:03,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:03,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:49:03,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:03,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:49:03,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:49:03,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:49:03,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 673 transitions, 12334 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:03,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:03,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:49:03,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:05,766 INFO L124 PetriNetUnfolderBase]: 4872/8607 cut-off events. [2024-06-27 22:49:05,766 INFO L125 PetriNetUnfolderBase]: For 261683/261720 co-relation queries the response was YES. [2024-06-27 22:49:05,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62392 conditions, 8607 events. 4872/8607 cut-off events. For 261683/261720 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 67384 event pairs, 777 based on Foata normal form. 8/8524 useless extension candidates. Maximal degree in co-relation 62220. Up to 6225 conditions per place. [2024-06-27 22:49:05,891 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 505 selfloop transitions, 179 changer transitions 0/700 dead transitions. [2024-06-27 22:49:05,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 700 transitions, 13764 flow [2024-06-27 22:49:05,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:49:05,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:49:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 236 transitions. [2024-06-27 22:49:05,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5700483091787439 [2024-06-27 22:49:05,893 INFO L175 Difference]: Start difference. First operand has 399 places, 673 transitions, 12334 flow. Second operand 9 states and 236 transitions. [2024-06-27 22:49:05,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 700 transitions, 13764 flow [2024-06-27 22:49:07,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 700 transitions, 13577 flow, removed 56 selfloop flow, removed 4 redundant places. [2024-06-27 22:49:07,685 INFO L231 Difference]: Finished difference. Result has 404 places, 673 transitions, 12512 flow [2024-06-27 22:49:07,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=12147, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12512, PETRI_PLACES=404, PETRI_TRANSITIONS=673} [2024-06-27 22:49:07,686 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 352 predicate places. [2024-06-27 22:49:07,686 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 673 transitions, 12512 flow [2024-06-27 22:49:07,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:07,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:07,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:49:07,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-27 22:49:07,687 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:49:07,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:07,687 INFO L85 PathProgramCache]: Analyzing trace with hash -717708982, now seen corresponding path program 1 times [2024-06-27 22:49:07,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:07,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398043979] [2024-06-27 22:49:07,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:07,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:08,236 INFO 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:49:08,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:08,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398043979] [2024-06-27 22:49:08,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398043979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:08,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:08,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:49:08,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652875415] [2024-06-27 22:49:08,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:08,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:49:08,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:08,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:49:08,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:49:08,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:49:08,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 673 transitions, 12512 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:08,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:08,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:49:08,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:10,387 INFO L124 PetriNetUnfolderBase]: 4979/8774 cut-off events. [2024-06-27 22:49:10,387 INFO L125 PetriNetUnfolderBase]: For 291513/291550 co-relation queries the response was YES. [2024-06-27 22:49:10,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64981 conditions, 8774 events. 4979/8774 cut-off events. For 291513/291550 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 68893 event pairs, 843 based on Foata normal form. 12/8685 useless extension candidates. Maximal degree in co-relation 64807. Up to 6172 conditions per place. [2024-06-27 22:49:10,498 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 510 selfloop transitions, 177 changer transitions 0/703 dead transitions. [2024-06-27 22:49:10,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 703 transitions, 14276 flow [2024-06-27 22:49:10,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:49:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:49:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2024-06-27 22:49:10,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2024-06-27 22:49:10,499 INFO L175 Difference]: Start difference. First operand has 404 places, 673 transitions, 12512 flow. Second operand 7 states and 196 transitions. [2024-06-27 22:49:10,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 703 transitions, 14276 flow [2024-06-27 22:49:12,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 703 transitions, 13843 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-27 22:49:12,358 INFO L231 Difference]: Finished difference. Result has 403 places, 679 transitions, 12666 flow [2024-06-27 22:49:12,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=12079, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12666, PETRI_PLACES=403, PETRI_TRANSITIONS=679} [2024-06-27 22:49:12,359 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 351 predicate places. [2024-06-27 22:49:12,359 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 679 transitions, 12666 flow [2024-06-27 22:49:12,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:12,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:12,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:49:12,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-27 22:49:12,360 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:49:12,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:12,360 INFO L85 PathProgramCache]: Analyzing trace with hash -717714779, now seen corresponding path program 3 times [2024-06-27 22:49:12,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:12,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493313394] [2024-06-27 22:49:12,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:12,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:49:12,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:12,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493313394] [2024-06-27 22:49:12,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493313394] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:12,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:12,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:49:12,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65093649] [2024-06-27 22:49:12,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:12,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:49:12,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:12,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:49:12,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:49:12,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:49:12,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 679 transitions, 12666 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:12,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:12,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:49:12,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:14,855 INFO L124 PetriNetUnfolderBase]: 4970/8757 cut-off events. [2024-06-27 22:49:14,855 INFO L125 PetriNetUnfolderBase]: For 295650/295731 co-relation queries the response was YES. [2024-06-27 22:49:14,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65214 conditions, 8757 events. 4970/8757 cut-off events. For 295650/295731 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 68804 event pairs, 1247 based on Foata normal form. 15/8625 useless extension candidates. Maximal degree in co-relation 65039. Up to 7066 conditions per place. [2024-06-27 22:49:14,989 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 579 selfloop transitions, 104 changer transitions 0/699 dead transitions. [2024-06-27 22:49:14,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 699 transitions, 14082 flow [2024-06-27 22:49:14,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:49:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:49:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions. [2024-06-27 22:49:14,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5896739130434783 [2024-06-27 22:49:14,991 INFO L175 Difference]: Start difference. First operand has 403 places, 679 transitions, 12666 flow. Second operand 8 states and 217 transitions. [2024-06-27 22:49:14,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 699 transitions, 14082 flow [2024-06-27 22:49:16,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 699 transitions, 13869 flow, removed 51 selfloop flow, removed 3 redundant places. [2024-06-27 22:49:16,804 INFO L231 Difference]: Finished difference. Result has 408 places, 679 transitions, 12673 flow [2024-06-27 22:49:16,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=12453, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12673, PETRI_PLACES=408, PETRI_TRANSITIONS=679} [2024-06-27 22:49:16,805 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 356 predicate places. [2024-06-27 22:49:16,805 INFO L495 AbstractCegarLoop]: Abstraction has has 408 places, 679 transitions, 12673 flow [2024-06-27 22:49:16,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:16,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:16,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:49:16,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-27 22:49:16,806 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:49:16,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:16,806 INFO L85 PathProgramCache]: Analyzing trace with hash -346451506, now seen corresponding path program 4 times [2024-06-27 22:49:16,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:16,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407779462] [2024-06-27 22:49:16,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:16,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:17,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:49:17,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:17,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407779462] [2024-06-27 22:49:17,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407779462] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:17,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:17,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:49:17,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650573765] [2024-06-27 22:49:17,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:17,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:49:17,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:17,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:49:17,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:49:17,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:49:17,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 679 transitions, 12673 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:17,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:17,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:49:17,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:19,367 INFO L124 PetriNetUnfolderBase]: 5011/8805 cut-off events. [2024-06-27 22:49:19,368 INFO L125 PetriNetUnfolderBase]: For 301554/301623 co-relation queries the response was YES. [2024-06-27 22:49:19,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65331 conditions, 8805 events. 5011/8805 cut-off events. For 301554/301623 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 68939 event pairs, 824 based on Foata normal form. 8/8714 useless extension candidates. Maximal degree in co-relation 65154. Up to 6261 conditions per place. [2024-06-27 22:49:19,512 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 506 selfloop transitions, 191 changer transitions 0/713 dead transitions. [2024-06-27 22:49:19,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 713 transitions, 14511 flow [2024-06-27 22:49:19,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:49:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:49:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 218 transitions. [2024-06-27 22:49:19,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.592391304347826 [2024-06-27 22:49:19,513 INFO L175 Difference]: Start difference. First operand has 408 places, 679 transitions, 12673 flow. Second operand 8 states and 218 transitions. [2024-06-27 22:49:19,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 713 transitions, 14511 flow [2024-06-27 22:49:21,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 713 transitions, 14344 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 22:49:21,677 INFO L231 Difference]: Finished difference. Result has 411 places, 686 transitions, 13037 flow [2024-06-27 22:49:21,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=12506, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13037, PETRI_PLACES=411, PETRI_TRANSITIONS=686} [2024-06-27 22:49:21,678 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 359 predicate places. [2024-06-27 22:49:21,678 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 686 transitions, 13037 flow [2024-06-27 22:49:21,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:21,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:21,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:49:21,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-27 22:49:21,679 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:49:21,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:21,679 INFO L85 PathProgramCache]: Analyzing trace with hash -346463596, now seen corresponding path program 5 times [2024-06-27 22:49:21,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:21,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649538230] [2024-06-27 22:49:21,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:21,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:22,256 INFO 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:49:22,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:22,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649538230] [2024-06-27 22:49:22,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649538230] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:22,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:22,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:49:22,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634598413] [2024-06-27 22:49:22,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:22,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:49:22,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:22,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:49:22,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:49:22,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:49:22,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 686 transitions, 13037 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:22,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:22,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:49:22,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:24,453 INFO L124 PetriNetUnfolderBase]: 5005/8791 cut-off events. [2024-06-27 22:49:24,454 INFO L125 PetriNetUnfolderBase]: For 306034/306103 co-relation queries the response was YES. [2024-06-27 22:49:24,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66017 conditions, 8791 events. 5005/8791 cut-off events. For 306034/306103 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 68737 event pairs, 825 based on Foata normal form. 8/8700 useless extension candidates. Maximal degree in co-relation 65838. Up to 6257 conditions per place. [2024-06-27 22:49:24,588 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 512 selfloop transitions, 184 changer transitions 0/712 dead transitions. [2024-06-27 22:49:24,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 712 transitions, 14630 flow [2024-06-27 22:49:24,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:49:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:49:24,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions. [2024-06-27 22:49:24,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5896739130434783 [2024-06-27 22:49:24,590 INFO L175 Difference]: Start difference. First operand has 411 places, 686 transitions, 13037 flow. Second operand 8 states and 217 transitions. [2024-06-27 22:49:24,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 712 transitions, 14630 flow [2024-06-27 22:49:26,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 712 transitions, 14338 flow, removed 36 selfloop flow, removed 3 redundant places. [2024-06-27 22:49:26,839 INFO L231 Difference]: Finished difference. Result has 416 places, 686 transitions, 13119 flow [2024-06-27 22:49:26,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=12745, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13119, PETRI_PLACES=416, PETRI_TRANSITIONS=686} [2024-06-27 22:49:26,840 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 364 predicate places. [2024-06-27 22:49:26,840 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 686 transitions, 13119 flow [2024-06-27 22:49:26,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:26,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:26,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:49:26,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-27 22:49:26,841 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:49:26,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:26,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1760700480, now seen corresponding path program 10 times [2024-06-27 22:49:26,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:26,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194589888] [2024-06-27 22:49:26,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:26,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:27,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:49:27,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:27,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194589888] [2024-06-27 22:49:27,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194589888] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:27,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:27,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:49:27,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574412824] [2024-06-27 22:49:27,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:27,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:49:27,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:27,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:49:27,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:49:27,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-06-27 22:49:27,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 686 transitions, 13119 flow. Second operand has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:27,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:27,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-06-27 22:49:27,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:29,551 INFO L124 PetriNetUnfolderBase]: 4989/8774 cut-off events. [2024-06-27 22:49:29,551 INFO L125 PetriNetUnfolderBase]: For 301534/301615 co-relation queries the response was YES. [2024-06-27 22:49:29,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65776 conditions, 8774 events. 4989/8774 cut-off events. For 301534/301615 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 68608 event pairs, 1132 based on Foata normal form. 18/8683 useless extension candidates. Maximal degree in co-relation 65595. Up to 6601 conditions per place. [2024-06-27 22:49:29,659 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 592 selfloop transitions, 104 changer transitions 0/711 dead transitions. [2024-06-27 22:49:29,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 711 transitions, 14579 flow [2024-06-27 22:49:29,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:49:29,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:49:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2024-06-27 22:49:29,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6014492753623188 [2024-06-27 22:49:29,660 INFO L175 Difference]: Start difference. First operand has 416 places, 686 transitions, 13119 flow. Second operand 6 states and 166 transitions. [2024-06-27 22:49:29,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 711 transitions, 14579 flow [2024-06-27 22:49:31,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 711 transitions, 14133 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-27 22:49:31,940 INFO L231 Difference]: Finished difference. Result has 416 places, 686 transitions, 12910 flow [2024-06-27 22:49:31,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=12673, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12910, PETRI_PLACES=416, PETRI_TRANSITIONS=686} [2024-06-27 22:49:31,941 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 364 predicate places. [2024-06-27 22:49:31,941 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 686 transitions, 12910 flow [2024-06-27 22:49:31,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:31,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:31,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:49:31,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-27 22:49:31,942 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:49:31,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:31,942 INFO L85 PathProgramCache]: Analyzing trace with hash -2119944960, now seen corresponding path program 2 times [2024-06-27 22:49:31,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:31,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633089478] [2024-06-27 22:49:31,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:31,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:32,422 INFO 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:49:32,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:32,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633089478] [2024-06-27 22:49:32,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633089478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:32,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:32,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:49:32,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035978343] [2024-06-27 22:49:32,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:32,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:49:32,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:32,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:49:32,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:49:32,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-06-27 22:49:32,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 686 transitions, 12910 flow. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:32,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:32,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-06-27 22:49:32,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:34,941 INFO L124 PetriNetUnfolderBase]: 5788/9996 cut-off events. [2024-06-27 22:49:34,942 INFO L125 PetriNetUnfolderBase]: For 312062/312105 co-relation queries the response was YES. [2024-06-27 22:49:35,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74025 conditions, 9996 events. 5788/9996 cut-off events. For 312062/312105 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 77519 event pairs, 1298 based on Foata normal form. 12/9890 useless extension candidates. Maximal degree in co-relation 73842. Up to 8234 conditions per place. [2024-06-27 22:49:35,091 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 667 selfloop transitions, 66 changer transitions 0/746 dead transitions. [2024-06-27 22:49:35,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 746 transitions, 15031 flow [2024-06-27 22:49:35,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:49:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:49:35,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 300 transitions. [2024-06-27 22:49:35,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5016722408026756 [2024-06-27 22:49:35,102 INFO L175 Difference]: Start difference. First operand has 416 places, 686 transitions, 12910 flow. Second operand 13 states and 300 transitions. [2024-06-27 22:49:35,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 746 transitions, 15031 flow [2024-06-27 22:49:37,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 746 transitions, 14899 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-06-27 22:49:37,705 INFO L231 Difference]: Finished difference. Result has 429 places, 704 transitions, 13319 flow [2024-06-27 22:49:37,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=12781, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=13319, PETRI_PLACES=429, PETRI_TRANSITIONS=704} [2024-06-27 22:49:37,705 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 377 predicate places. [2024-06-27 22:49:37,705 INFO L495 AbstractCegarLoop]: Abstraction has has 429 places, 704 transitions, 13319 flow [2024-06-27 22:49:37,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:37,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:37,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:49:37,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-27 22:49:37,706 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:49:37,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:37,707 INFO L85 PathProgramCache]: Analyzing trace with hash 955161458, now seen corresponding path program 6 times [2024-06-27 22:49:37,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:37,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640693340] [2024-06-27 22:49:37,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:37,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:38,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:49:38,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:38,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640693340] [2024-06-27 22:49:38,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640693340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:38,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:38,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:49:38,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722569088] [2024-06-27 22:49:38,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:38,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:49:38,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:38,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:49:38,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:49:38,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-06-27 22:49:38,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 704 transitions, 13319 flow. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:38,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:38,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-06-27 22:49:38,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:40,835 INFO L124 PetriNetUnfolderBase]: 5860/10087 cut-off events. [2024-06-27 22:49:40,835 INFO L125 PetriNetUnfolderBase]: For 320920/320963 co-relation queries the response was YES. [2024-06-27 22:49:40,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75583 conditions, 10087 events. 5860/10087 cut-off events. For 320920/320963 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 78056 event pairs, 1318 based on Foata normal form. 12/9975 useless extension candidates. Maximal degree in co-relation 75396. Up to 8334 conditions per place. [2024-06-27 22:49:40,985 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 688 selfloop transitions, 58 changer transitions 0/759 dead transitions. [2024-06-27 22:49:40,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 759 transitions, 15327 flow [2024-06-27 22:49:40,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:49:40,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:49:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 280 transitions. [2024-06-27 22:49:40,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2024-06-27 22:49:40,987 INFO L175 Difference]: Start difference. First operand has 429 places, 704 transitions, 13319 flow. Second operand 12 states and 280 transitions. [2024-06-27 22:49:40,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 759 transitions, 15327 flow [2024-06-27 22:49:43,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 759 transitions, 15128 flow, removed 64 selfloop flow, removed 6 redundant places. [2024-06-27 22:49:43,459 INFO L231 Difference]: Finished difference. Result has 437 places, 722 transitions, 13706 flow [2024-06-27 22:49:43,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=13120, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=648, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=13706, PETRI_PLACES=437, PETRI_TRANSITIONS=722} [2024-06-27 22:49:43,460 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 385 predicate places. [2024-06-27 22:49:43,460 INFO L495 AbstractCegarLoop]: Abstraction has has 437 places, 722 transitions, 13706 flow [2024-06-27 22:49:43,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:43,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:43,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:49:43,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-27 22:49:43,461 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:49:43,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:43,461 INFO L85 PathProgramCache]: Analyzing trace with hash 156760158, now seen corresponding path program 3 times [2024-06-27 22:49:43,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:43,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636542959] [2024-06-27 22:49:43,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:43,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:43,943 INFO 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:49:43,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:43,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636542959] [2024-06-27 22:49:43,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636542959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:43,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:43,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:49:43,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344931698] [2024-06-27 22:49:43,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:43,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:49:43,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:43,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:49:43,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:49:43,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:49:43,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 722 transitions, 13706 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:43,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:43,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:49:43,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:46,056 INFO L124 PetriNetUnfolderBase]: 5151/9048 cut-off events. [2024-06-27 22:49:46,056 INFO L125 PetriNetUnfolderBase]: For 322753/322790 co-relation queries the response was YES. [2024-06-27 22:49:46,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68404 conditions, 9048 events. 5151/9048 cut-off events. For 322753/322790 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 71219 event pairs, 865 based on Foata normal form. 12/8943 useless extension candidates. Maximal degree in co-relation 68214. Up to 6985 conditions per place. [2024-06-27 22:49:46,194 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 622 selfloop transitions, 100 changer transitions 0/738 dead transitions. [2024-06-27 22:49:46,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 738 transitions, 15282 flow [2024-06-27 22:49:46,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:49:46,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:49:46,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2024-06-27 22:49:46,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6043478260869565 [2024-06-27 22:49:46,196 INFO L175 Difference]: Start difference. First operand has 437 places, 722 transitions, 13706 flow. Second operand 5 states and 139 transitions. [2024-06-27 22:49:46,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 738 transitions, 15282 flow [2024-06-27 22:49:48,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 738 transitions, 15086 flow, removed 58 selfloop flow, removed 6 redundant places. [2024-06-27 22:49:48,363 INFO L231 Difference]: Finished difference. Result has 436 places, 725 transitions, 13849 flow [2024-06-27 22:49:48,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=13510, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=13849, PETRI_PLACES=436, PETRI_TRANSITIONS=725} [2024-06-27 22:49:48,364 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 384 predicate places. [2024-06-27 22:49:48,364 INFO L495 AbstractCegarLoop]: Abstraction has has 436 places, 725 transitions, 13849 flow [2024-06-27 22:49:48,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:48,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:48,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:49:48,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-27 22:49:48,365 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:49:48,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:48,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1748694924, now seen corresponding path program 7 times [2024-06-27 22:49:48,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:48,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756826434] [2024-06-27 22:49:48,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:48,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:48,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:49:48,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:48,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756826434] [2024-06-27 22:49:48,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756826434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:48,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:48,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:49:48,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780515264] [2024-06-27 22:49:48,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:48,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:49:48,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:48,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:49:48,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:49:48,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:49:48,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 725 transitions, 13849 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:48,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:48,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:49:48,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:51,061 INFO L124 PetriNetUnfolderBase]: 5156/9043 cut-off events. [2024-06-27 22:49:51,061 INFO L125 PetriNetUnfolderBase]: For 319751/319788 co-relation queries the response was YES. [2024-06-27 22:49:51,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68661 conditions, 9043 events. 5156/9043 cut-off events. For 319751/319788 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 71101 event pairs, 857 based on Foata normal form. 8/8933 useless extension candidates. Maximal degree in co-relation 68471. Up to 7053 conditions per place. [2024-06-27 22:49:51,198 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 624 selfloop transitions, 103 changer transitions 0/743 dead transitions. [2024-06-27 22:49:51,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 743 transitions, 15391 flow [2024-06-27 22:49:51,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:49:51,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:49:51,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-06-27 22:49:51,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-06-27 22:49:51,199 INFO L175 Difference]: Start difference. First operand has 436 places, 725 transitions, 13849 flow. Second operand 6 states and 161 transitions. [2024-06-27 22:49:51,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 743 transitions, 15391 flow [2024-06-27 22:49:53,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 743 transitions, 15159 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-27 22:49:53,374 INFO L231 Difference]: Finished difference. Result has 438 places, 728 transitions, 13890 flow [2024-06-27 22:49:53,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=13617, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13890, PETRI_PLACES=438, PETRI_TRANSITIONS=728} [2024-06-27 22:49:53,376 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 386 predicate places. [2024-06-27 22:49:53,376 INFO L495 AbstractCegarLoop]: Abstraction has has 438 places, 728 transitions, 13890 flow [2024-06-27 22:49:53,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:53,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:53,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:49:53,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-27 22:49:53,376 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:49:53,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:53,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1323185081, now seen corresponding path program 4 times [2024-06-27 22:49:53,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:53,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784038256] [2024-06-27 22:49:53,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:53,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:49:53,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:53,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784038256] [2024-06-27 22:49:53,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784038256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:53,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:53,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:49:53,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529355893] [2024-06-27 22:49:53,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:53,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:49:53,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:53,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:49:53,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:49:53,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:49:53,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 728 transitions, 13890 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:53,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:53,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:49:53,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:49:56,040 INFO L124 PetriNetUnfolderBase]: 5174/9062 cut-off events. [2024-06-27 22:49:56,040 INFO L125 PetriNetUnfolderBase]: For 324994/325040 co-relation queries the response was YES. [2024-06-27 22:49:56,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68581 conditions, 9062 events. 5174/9062 cut-off events. For 324994/325040 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 71057 event pairs, 1642 based on Foata normal form. 13/8935 useless extension candidates. Maximal degree in co-relation 68391. Up to 7443 conditions per place. [2024-06-27 22:49:56,181 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 668 selfloop transitions, 61 changer transitions 0/745 dead transitions. [2024-06-27 22:49:56,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 745 transitions, 15480 flow [2024-06-27 22:49:56,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:49:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:49:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2024-06-27 22:49:56,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5869565217391305 [2024-06-27 22:49:56,182 INFO L175 Difference]: Start difference. First operand has 438 places, 728 transitions, 13890 flow. Second operand 6 states and 162 transitions. [2024-06-27 22:49:56,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 745 transitions, 15480 flow [2024-06-27 22:49:58,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 745 transitions, 15243 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-27 22:49:58,142 INFO L231 Difference]: Finished difference. Result has 440 places, 732 transitions, 13896 flow [2024-06-27 22:49:58,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=13653, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13896, PETRI_PLACES=440, PETRI_TRANSITIONS=732} [2024-06-27 22:49:58,143 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 388 predicate places. [2024-06-27 22:49:58,143 INFO L495 AbstractCegarLoop]: Abstraction has has 440 places, 732 transitions, 13896 flow [2024-06-27 22:49:58,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:58,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:49:58,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:49:58,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-27 22:49:58,144 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:49:58,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:49:58,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1109791404, now seen corresponding path program 11 times [2024-06-27 22:49:58,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:49:58,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207962974] [2024-06-27 22:49:58,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:49:58,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:49:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:49:58,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:49:58,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:49:58,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207962974] [2024-06-27 22:49:58,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207962974] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:49:58,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:49:58,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:49:58,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70168111] [2024-06-27 22:49:58,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:49:58,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:49:58,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:49:58,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:49:58,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:49:58,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:49:58,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 732 transitions, 13896 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:49:58,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:49:58,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:49:58,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:01,140 INFO L124 PetriNetUnfolderBase]: 5171/9060 cut-off events. [2024-06-27 22:50:01,141 INFO L125 PetriNetUnfolderBase]: For 313942/314011 co-relation queries the response was YES. [2024-06-27 22:50:01,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68190 conditions, 9060 events. 5171/9060 cut-off events. For 313942/314011 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 71141 event pairs, 793 based on Foata normal form. 8/8966 useless extension candidates. Maximal degree in co-relation 67999. Up to 6537 conditions per place. [2024-06-27 22:50:01,266 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 566 selfloop transitions, 175 changer transitions 0/757 dead transitions. [2024-06-27 22:50:01,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 757 transitions, 15590 flow [2024-06-27 22:50:01,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:50:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:50:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2024-06-27 22:50:01,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6304347826086957 [2024-06-27 22:50:01,268 INFO L175 Difference]: Start difference. First operand has 440 places, 732 transitions, 13896 flow. Second operand 6 states and 174 transitions. [2024-06-27 22:50:01,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 757 transitions, 15590 flow [2024-06-27 22:50:03,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 757 transitions, 15383 flow, removed 48 selfloop flow, removed 4 redundant places. [2024-06-27 22:50:03,451 INFO L231 Difference]: Finished difference. Result has 442 places, 732 transitions, 14054 flow [2024-06-27 22:50:03,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=13689, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=14054, PETRI_PLACES=442, PETRI_TRANSITIONS=732} [2024-06-27 22:50:03,452 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 390 predicate places. [2024-06-27 22:50:03,452 INFO L495 AbstractCegarLoop]: Abstraction has has 442 places, 732 transitions, 14054 flow [2024-06-27 22:50:03,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:03,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:03,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:50:03,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-27 22:50:03,452 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:50:03,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:03,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1756945667, now seen corresponding path program 5 times [2024-06-27 22:50:03,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:03,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322453339] [2024-06-27 22:50:03,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:03,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:03,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:50:03,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:03,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322453339] [2024-06-27 22:50:03,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322453339] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:03,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:03,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:50:03,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123854014] [2024-06-27 22:50:03,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:03,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:50:03,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:03,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:50:03,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:50:03,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:50:03,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 732 transitions, 14054 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:03,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:03,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:50:03,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:06,193 INFO L124 PetriNetUnfolderBase]: 5176/9090 cut-off events. [2024-06-27 22:50:06,193 INFO L125 PetriNetUnfolderBase]: For 322696/322742 co-relation queries the response was YES. [2024-06-27 22:50:06,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69031 conditions, 9090 events. 5176/9090 cut-off events. For 322696/322742 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 71678 event pairs, 1284 based on Foata normal form. 13/8956 useless extension candidates. Maximal degree in co-relation 68839. Up to 7337 conditions per place. [2024-06-27 22:50:06,333 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 628 selfloop transitions, 115 changer transitions 0/759 dead transitions. [2024-06-27 22:50:06,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 759 transitions, 15870 flow [2024-06-27 22:50:06,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:50:06,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:50:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2024-06-27 22:50:06,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6118012422360248 [2024-06-27 22:50:06,334 INFO L175 Difference]: Start difference. First operand has 442 places, 732 transitions, 14054 flow. Second operand 7 states and 197 transitions. [2024-06-27 22:50:06,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 759 transitions, 15870 flow [2024-06-27 22:50:08,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 759 transitions, 15406 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-27 22:50:08,293 INFO L231 Difference]: Finished difference. Result has 443 places, 737 transitions, 14001 flow [2024-06-27 22:50:08,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=13594, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=14001, PETRI_PLACES=443, PETRI_TRANSITIONS=737} [2024-06-27 22:50:08,294 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 391 predicate places. [2024-06-27 22:50:08,294 INFO L495 AbstractCegarLoop]: Abstraction has has 443 places, 737 transitions, 14001 flow [2024-06-27 22:50:08,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:08,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:08,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:50:08,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-27 22:50:08,295 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:50:08,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:08,295 INFO L85 PathProgramCache]: Analyzing trace with hash -365880386, now seen corresponding path program 8 times [2024-06-27 22:50:08,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:08,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536483193] [2024-06-27 22:50:08,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:08,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:50:08,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:08,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536483193] [2024-06-27 22:50:08,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536483193] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:08,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:08,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:50:08,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913181505] [2024-06-27 22:50:08,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:08,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:50:08,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:08,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:50:08,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:50:08,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:50:08,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 737 transitions, 14001 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:08,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:08,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:50:08,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:11,296 INFO L124 PetriNetUnfolderBase]: 5183/9071 cut-off events. [2024-06-27 22:50:11,296 INFO L125 PetriNetUnfolderBase]: For 332000/332069 co-relation queries the response was YES. [2024-06-27 22:50:11,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68437 conditions, 9071 events. 5183/9071 cut-off events. For 332000/332069 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 71188 event pairs, 860 based on Foata normal form. 8/8977 useless extension candidates. Maximal degree in co-relation 68245. Up to 6446 conditions per place. [2024-06-27 22:50:11,418 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 538 selfloop transitions, 213 changer transitions 0/767 dead transitions. [2024-06-27 22:50:11,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 767 transitions, 15930 flow [2024-06-27 22:50:11,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:50:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:50:11,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2024-06-27 22:50:11,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2024-06-27 22:50:11,419 INFO L175 Difference]: Start difference. First operand has 443 places, 737 transitions, 14001 flow. Second operand 7 states and 196 transitions. [2024-06-27 22:50:11,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 767 transitions, 15930 flow [2024-06-27 22:50:13,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 767 transitions, 15506 flow, removed 41 selfloop flow, removed 6 redundant places. [2024-06-27 22:50:13,717 INFO L231 Difference]: Finished difference. Result has 445 places, 741 transitions, 14113 flow [2024-06-27 22:50:13,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=13577, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=737, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=14113, PETRI_PLACES=445, PETRI_TRANSITIONS=741} [2024-06-27 22:50:13,718 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 393 predicate places. [2024-06-27 22:50:13,718 INFO L495 AbstractCegarLoop]: Abstraction has has 445 places, 741 transitions, 14113 flow [2024-06-27 22:50:13,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:13,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:13,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:50:13,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-27 22:50:13,719 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:50:13,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:13,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1756940304, now seen corresponding path program 9 times [2024-06-27 22:50:13,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:13,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581992006] [2024-06-27 22:50:13,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:13,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:14,217 INFO 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:50:14,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:14,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581992006] [2024-06-27 22:50:14,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581992006] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:14,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:14,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:50:14,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902237610] [2024-06-27 22:50:14,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:14,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:50:14,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:14,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:50:14,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:50:14,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:50:14,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 741 transitions, 14113 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:14,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:14,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:50:14,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:16,479 INFO L124 PetriNetUnfolderBase]: 5178/9061 cut-off events. [2024-06-27 22:50:16,479 INFO L125 PetriNetUnfolderBase]: For 333880/333949 co-relation queries the response was YES. [2024-06-27 22:50:16,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68720 conditions, 9061 events. 5178/9061 cut-off events. For 333880/333949 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 71044 event pairs, 834 based on Foata normal form. 8/8971 useless extension candidates. Maximal degree in co-relation 68527. Up to 6442 conditions per place. [2024-06-27 22:50:16,618 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 521 selfloop transitions, 226 changer transitions 0/763 dead transitions. [2024-06-27 22:50:16,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 763 transitions, 15809 flow [2024-06-27 22:50:16,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:50:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:50:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2024-06-27 22:50:16,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5962732919254659 [2024-06-27 22:50:16,620 INFO L175 Difference]: Start difference. First operand has 445 places, 741 transitions, 14113 flow. Second operand 7 states and 192 transitions. [2024-06-27 22:50:16,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 763 transitions, 15809 flow [2024-06-27 22:50:19,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 763 transitions, 15338 flow, removed 38 selfloop flow, removed 6 redundant places. [2024-06-27 22:50:19,015 INFO L231 Difference]: Finished difference. Result has 446 places, 741 transitions, 14108 flow [2024-06-27 22:50:19,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=13646, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=14108, PETRI_PLACES=446, PETRI_TRANSITIONS=741} [2024-06-27 22:50:19,016 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 394 predicate places. [2024-06-27 22:50:19,016 INFO L495 AbstractCegarLoop]: Abstraction has has 446 places, 741 transitions, 14108 flow [2024-06-27 22:50:19,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:19,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:19,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:50:19,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-27 22:50:19,017 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:50:19,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:19,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1756940087, now seen corresponding path program 6 times [2024-06-27 22:50:19,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:19,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798230687] [2024-06-27 22:50:19,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:19,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:50:19,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:19,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798230687] [2024-06-27 22:50:19,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798230687] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:19,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:19,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:50:19,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876439332] [2024-06-27 22:50:19,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:19,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:50:19,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:19,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:50:19,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:50:19,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:50:19,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 741 transitions, 14108 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:19,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:19,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:50:19,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:21,806 INFO L124 PetriNetUnfolderBase]: 5183/9091 cut-off events. [2024-06-27 22:50:21,806 INFO L125 PetriNetUnfolderBase]: For 313334/313412 co-relation queries the response was YES. [2024-06-27 22:50:21,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68580 conditions, 9091 events. 5183/9091 cut-off events. For 313334/313412 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 71621 event pairs, 1286 based on Foata normal form. 13/8947 useless extension candidates. Maximal degree in co-relation 68388. Up to 7348 conditions per place. [2024-06-27 22:50:21,942 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 633 selfloop transitions, 110 changer transitions 0/759 dead transitions. [2024-06-27 22:50:21,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 759 transitions, 15640 flow [2024-06-27 22:50:21,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:50:21,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:50:21,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 193 transitions. [2024-06-27 22:50:21,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5993788819875776 [2024-06-27 22:50:21,944 INFO L175 Difference]: Start difference. First operand has 446 places, 741 transitions, 14108 flow. Second operand 7 states and 193 transitions. [2024-06-27 22:50:21,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 759 transitions, 15640 flow [2024-06-27 22:50:24,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 759 transitions, 15327 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-06-27 22:50:24,318 INFO L231 Difference]: Finished difference. Result has 449 places, 741 transitions, 14027 flow [2024-06-27 22:50:24,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=13795, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=14027, PETRI_PLACES=449, PETRI_TRANSITIONS=741} [2024-06-27 22:50:24,320 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 397 predicate places. [2024-06-27 22:50:24,320 INFO L495 AbstractCegarLoop]: Abstraction has has 449 places, 741 transitions, 14027 flow [2024-06-27 22:50:24,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:24,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:24,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:50:24,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-27 22:50:24,320 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:50:24,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:24,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1756939870, now seen corresponding path program 4 times [2024-06-27 22:50:24,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:24,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802246648] [2024-06-27 22:50:24,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:24,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:24,840 INFO 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:50:24,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:24,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802246648] [2024-06-27 22:50:24,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802246648] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:24,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:24,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:50:24,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003889492] [2024-06-27 22:50:24,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:24,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:50:24,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:24,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:50:24,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:50:24,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:50:24,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 741 transitions, 14027 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:24,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:24,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:50:24,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:27,294 INFO L124 PetriNetUnfolderBase]: 5169/9067 cut-off events. [2024-06-27 22:50:27,294 INFO L125 PetriNetUnfolderBase]: For 318373/318442 co-relation queries the response was YES. [2024-06-27 22:50:27,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67335 conditions, 9067 events. 5169/9067 cut-off events. For 318373/318442 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 71367 event pairs, 878 based on Foata normal form. 14/8962 useless extension candidates. Maximal degree in co-relation 67143. Up to 6354 conditions per place. [2024-06-27 22:50:27,412 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 539 selfloop transitions, 206 changer transitions 0/761 dead transitions. [2024-06-27 22:50:27,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 761 transitions, 15565 flow [2024-06-27 22:50:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:50:27,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:50:27,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-06-27 22:50:27,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6159420289855072 [2024-06-27 22:50:27,415 INFO L175 Difference]: Start difference. First operand has 449 places, 741 transitions, 14027 flow. Second operand 6 states and 170 transitions. [2024-06-27 22:50:27,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 761 transitions, 15565 flow [2024-06-27 22:50:29,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 761 transitions, 15343 flow, removed 44 selfloop flow, removed 3 redundant places. [2024-06-27 22:50:29,406 INFO L231 Difference]: Finished difference. Result has 452 places, 741 transitions, 14269 flow [2024-06-27 22:50:29,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=13805, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=14269, PETRI_PLACES=452, PETRI_TRANSITIONS=741} [2024-06-27 22:50:29,407 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 400 predicate places. [2024-06-27 22:50:29,407 INFO L495 AbstractCegarLoop]: Abstraction has has 452 places, 741 transitions, 14269 flow [2024-06-27 22:50:29,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:29,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:29,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:50:29,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-27 22:50:29,408 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:50:29,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:29,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1331442954, now seen corresponding path program 12 times [2024-06-27 22:50:29,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:29,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539176605] [2024-06-27 22:50:29,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:29,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:29,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:50:29,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:29,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539176605] [2024-06-27 22:50:29,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539176605] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:29,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:29,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:50:29,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684671766] [2024-06-27 22:50:29,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:29,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:50:29,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:29,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:50:29,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:50:29,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:50:29,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 741 transitions, 14269 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:29,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:29,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:50:29,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:32,127 INFO L124 PetriNetUnfolderBase]: 5153/9034 cut-off events. [2024-06-27 22:50:32,127 INFO L125 PetriNetUnfolderBase]: For 288592/288661 co-relation queries the response was YES. [2024-06-27 22:50:32,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67836 conditions, 9034 events. 5153/9034 cut-off events. For 288592/288661 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 70972 event pairs, 764 based on Foata normal form. 8/8938 useless extension candidates. Maximal degree in co-relation 67643. Up to 6513 conditions per place. [2024-06-27 22:50:32,269 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 588 selfloop transitions, 161 changer transitions 0/765 dead transitions. [2024-06-27 22:50:32,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 765 transitions, 15831 flow [2024-06-27 22:50:32,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:50:32,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:50:32,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2024-06-27 22:50:32,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6268115942028986 [2024-06-27 22:50:32,270 INFO L175 Difference]: Start difference. First operand has 452 places, 741 transitions, 14269 flow. Second operand 6 states and 173 transitions. [2024-06-27 22:50:32,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 765 transitions, 15831 flow [2024-06-27 22:50:34,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 765 transitions, 15304 flow, removed 48 selfloop flow, removed 8 redundant places. [2024-06-27 22:50:34,218 INFO L231 Difference]: Finished difference. Result has 450 places, 741 transitions, 14079 flow [2024-06-27 22:50:34,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=13742, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=14079, PETRI_PLACES=450, PETRI_TRANSITIONS=741} [2024-06-27 22:50:34,219 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 398 predicate places. [2024-06-27 22:50:34,219 INFO L495 AbstractCegarLoop]: Abstraction has has 450 places, 741 transitions, 14079 flow [2024-06-27 22:50:34,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:34,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:34,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:50:34,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-27 22:50:34,219 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:50:34,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:34,220 INFO L85 PathProgramCache]: Analyzing trace with hash -786279936, now seen corresponding path program 10 times [2024-06-27 22:50:34,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:34,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432064988] [2024-06-27 22:50:34,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:34,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:50:34,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:34,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432064988] [2024-06-27 22:50:34,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432064988] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:34,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:34,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:50:34,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355948871] [2024-06-27 22:50:34,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:34,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:50:34,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:34,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:50:34,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:50:34,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:50:34,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 741 transitions, 14079 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:34,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:34,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:50:34,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:37,247 INFO L124 PetriNetUnfolderBase]: 5187/9079 cut-off events. [2024-06-27 22:50:37,247 INFO L125 PetriNetUnfolderBase]: For 275511/275580 co-relation queries the response was YES. [2024-06-27 22:50:37,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67698 conditions, 9079 events. 5187/9079 cut-off events. For 275511/275580 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 71337 event pairs, 797 based on Foata normal form. 8/8977 useless extension candidates. Maximal degree in co-relation 67508. Up to 6728 conditions per place. [2024-06-27 22:50:37,378 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 585 selfloop transitions, 181 changer transitions 0/782 dead transitions. [2024-06-27 22:50:37,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 782 transitions, 16061 flow [2024-06-27 22:50:37,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:50:37,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:50:37,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 264 transitions. [2024-06-27 22:50:37,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5739130434782609 [2024-06-27 22:50:37,379 INFO L175 Difference]: Start difference. First operand has 450 places, 741 transitions, 14079 flow. Second operand 10 states and 264 transitions. [2024-06-27 22:50:37,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 782 transitions, 16061 flow [2024-06-27 22:50:38,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 782 transitions, 15676 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-27 22:50:38,998 INFO L231 Difference]: Finished difference. Result has 454 places, 747 transitions, 14294 flow [2024-06-27 22:50:38,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=13696, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14294, PETRI_PLACES=454, PETRI_TRANSITIONS=747} [2024-06-27 22:50:38,999 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 402 predicate places. [2024-06-27 22:50:38,999 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 747 transitions, 14294 flow [2024-06-27 22:50:38,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:38,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:38,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:50:38,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-27 22:50:38,999 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:50:39,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:39,000 INFO L85 PathProgramCache]: Analyzing trace with hash -659802777, now seen corresponding path program 7 times [2024-06-27 22:50:39,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:39,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523519304] [2024-06-27 22:50:39,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:39,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:39,390 INFO 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:50:39,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:39,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523519304] [2024-06-27 22:50:39,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523519304] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:39,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:39,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:50:39,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422086313] [2024-06-27 22:50:39,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:39,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:50:39,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:39,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:50:39,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:50:39,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:50:39,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 747 transitions, 14294 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:39,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:39,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:50:39,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:41,702 INFO L124 PetriNetUnfolderBase]: 5249/9174 cut-off events. [2024-06-27 22:50:41,703 INFO L125 PetriNetUnfolderBase]: For 287312/287390 co-relation queries the response was YES. [2024-06-27 22:50:41,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69008 conditions, 9174 events. 5249/9174 cut-off events. For 287312/287390 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 71923 event pairs, 1274 based on Foata normal form. 13/9025 useless extension candidates. Maximal degree in co-relation 68818. Up to 7383 conditions per place. [2024-06-27 22:50:41,846 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 656 selfloop transitions, 132 changer transitions 0/804 dead transitions. [2024-06-27 22:50:41,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 804 transitions, 16682 flow [2024-06-27 22:50:41,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:50:41,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:50:41,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 243 transitions. [2024-06-27 22:50:41,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5869565217391305 [2024-06-27 22:50:41,848 INFO L175 Difference]: Start difference. First operand has 454 places, 747 transitions, 14294 flow. Second operand 9 states and 243 transitions. [2024-06-27 22:50:41,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 804 transitions, 16682 flow [2024-06-27 22:50:43,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 804 transitions, 16164 flow, removed 99 selfloop flow, removed 9 redundant places. [2024-06-27 22:50:43,710 INFO L231 Difference]: Finished difference. Result has 455 places, 775 transitions, 14673 flow [2024-06-27 22:50:43,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=13776, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=747, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14673, PETRI_PLACES=455, PETRI_TRANSITIONS=775} [2024-06-27 22:50:43,710 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 403 predicate places. [2024-06-27 22:50:43,710 INFO L495 AbstractCegarLoop]: Abstraction has has 455 places, 775 transitions, 14673 flow [2024-06-27 22:50:43,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:43,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:43,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:50:43,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-27 22:50:43,711 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:50:43,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:43,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1034436091, now seen corresponding path program 8 times [2024-06-27 22:50:43,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:43,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516668348] [2024-06-27 22:50:43,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:43,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:50:44,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:44,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516668348] [2024-06-27 22:50:44,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516668348] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:44,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:44,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:50:44,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568697153] [2024-06-27 22:50:44,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:44,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:50:44,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:44,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:50:44,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:50:44,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:50:44,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 775 transitions, 14673 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:44,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:44,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:50:44,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:46,446 INFO L124 PetriNetUnfolderBase]: 5302/9253 cut-off events. [2024-06-27 22:50:46,447 INFO L125 PetriNetUnfolderBase]: For 299514/299592 co-relation queries the response was YES. [2024-06-27 22:50:46,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69929 conditions, 9253 events. 5302/9253 cut-off events. For 299514/299592 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 72633 event pairs, 1272 based on Foata normal form. 13/9100 useless extension candidates. Maximal degree in co-relation 69740. Up to 7237 conditions per place. [2024-06-27 22:50:46,588 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 557 selfloop transitions, 243 changer transitions 0/816 dead transitions. [2024-06-27 22:50:46,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 816 transitions, 17181 flow [2024-06-27 22:50:46,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:50:46,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:50:46,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 222 transitions. [2024-06-27 22:50:46,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6032608695652174 [2024-06-27 22:50:46,590 INFO L175 Difference]: Start difference. First operand has 455 places, 775 transitions, 14673 flow. Second operand 8 states and 222 transitions. [2024-06-27 22:50:46,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 816 transitions, 17181 flow [2024-06-27 22:50:48,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 816 transitions, 16775 flow, removed 170 selfloop flow, removed 2 redundant places. [2024-06-27 22:50:48,564 INFO L231 Difference]: Finished difference. Result has 461 places, 791 transitions, 15328 flow [2024-06-27 22:50:48,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=14357, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=775, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15328, PETRI_PLACES=461, PETRI_TRANSITIONS=791} [2024-06-27 22:50:48,565 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 409 predicate places. [2024-06-27 22:50:48,565 INFO L495 AbstractCegarLoop]: Abstraction has has 461 places, 791 transitions, 15328 flow [2024-06-27 22:50:48,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:48,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:48,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:50:48,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-27 22:50:48,566 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:50:48,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:48,566 INFO L85 PathProgramCache]: Analyzing trace with hash -21383995, now seen corresponding path program 9 times [2024-06-27 22:50:48,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:48,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729198704] [2024-06-27 22:50:48,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:48,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:48,967 INFO 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:50:48,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:48,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729198704] [2024-06-27 22:50:48,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729198704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:48,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:48,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:50:48,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125245331] [2024-06-27 22:50:48,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:48,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:50:48,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:48,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:50:48,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:50:49,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:50:49,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 791 transitions, 15328 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:49,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:49,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:50:49,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:51,335 INFO L124 PetriNetUnfolderBase]: 5291/9230 cut-off events. [2024-06-27 22:50:51,335 INFO L125 PetriNetUnfolderBase]: For 308576/308654 co-relation queries the response was YES. [2024-06-27 22:50:51,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70790 conditions, 9230 events. 5291/9230 cut-off events. For 308576/308654 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 72472 event pairs, 1274 based on Foata normal form. 13/9081 useless extension candidates. Maximal degree in co-relation 70599. Up to 7398 conditions per place. [2024-06-27 22:50:51,487 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 658 selfloop transitions, 153 changer transitions 0/827 dead transitions. [2024-06-27 22:50:51,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 827 transitions, 17468 flow [2024-06-27 22:50:51,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:50:51,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:50:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 269 transitions. [2024-06-27 22:50:51,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5847826086956521 [2024-06-27 22:50:51,489 INFO L175 Difference]: Start difference. First operand has 461 places, 791 transitions, 15328 flow. Second operand 10 states and 269 transitions. [2024-06-27 22:50:51,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 827 transitions, 17468 flow [2024-06-27 22:50:53,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 827 transitions, 17016 flow, removed 146 selfloop flow, removed 4 redundant places. [2024-06-27 22:50:53,669 INFO L231 Difference]: Finished difference. Result has 468 places, 795 transitions, 15358 flow [2024-06-27 22:50:53,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=14920, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=791, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15358, PETRI_PLACES=468, PETRI_TRANSITIONS=795} [2024-06-27 22:50:53,670 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 416 predicate places. [2024-06-27 22:50:53,670 INFO L495 AbstractCegarLoop]: Abstraction has has 468 places, 795 transitions, 15358 flow [2024-06-27 22:50:53,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:53,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:53,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:50:53,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-27 22:50:53,671 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:50:53,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:53,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1404737090, now seen corresponding path program 11 times [2024-06-27 22:50:53,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:53,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383793617] [2024-06-27 22:50:53,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:53,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:54,291 INFO 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:50:54,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:54,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383793617] [2024-06-27 22:50:54,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383793617] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:54,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:54,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:50:54,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851448057] [2024-06-27 22:50:54,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:54,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:50:54,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:54,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:50:54,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:50:54,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:50:54,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 795 transitions, 15358 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:54,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:54,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:50:54,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:50:56,882 INFO L124 PetriNetUnfolderBase]: 5351/9317 cut-off events. [2024-06-27 22:50:56,883 INFO L125 PetriNetUnfolderBase]: For 315824/315893 co-relation queries the response was YES. [2024-06-27 22:50:56,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70958 conditions, 9317 events. 5351/9317 cut-off events. For 315824/315893 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 72820 event pairs, 815 based on Foata normal form. 8/9214 useless extension candidates. Maximal degree in co-relation 70765. Up to 6921 conditions per place. [2024-06-27 22:50:57,024 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 640 selfloop transitions, 186 changer transitions 0/842 dead transitions. [2024-06-27 22:50:57,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 842 transitions, 17502 flow [2024-06-27 22:50:57,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:50:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:50:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 288 transitions. [2024-06-27 22:50:57,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5691699604743083 [2024-06-27 22:50:57,026 INFO L175 Difference]: Start difference. First operand has 468 places, 795 transitions, 15358 flow. Second operand 11 states and 288 transitions. [2024-06-27 22:50:57,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 842 transitions, 17502 flow [2024-06-27 22:50:58,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 842 transitions, 16978 flow, removed 76 selfloop flow, removed 9 redundant places. [2024-06-27 22:50:58,973 INFO L231 Difference]: Finished difference. Result has 470 places, 804 transitions, 15328 flow [2024-06-27 22:50:58,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=14834, PETRI_DIFFERENCE_MINUEND_PLACES=459, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=618, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15328, PETRI_PLACES=470, PETRI_TRANSITIONS=804} [2024-06-27 22:50:58,989 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 418 predicate places. [2024-06-27 22:50:58,989 INFO L495 AbstractCegarLoop]: Abstraction has has 470 places, 804 transitions, 15328 flow [2024-06-27 22:50:58,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:58,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:50:58,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:50:58,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-27 22:50:58,990 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:50:58,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:50:58,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2131811002, now seen corresponding path program 12 times [2024-06-27 22:50:58,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:50:58,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484480140] [2024-06-27 22:50:58,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:50:58,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:50:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:50:59,528 INFO 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:50:59,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:50:59,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484480140] [2024-06-27 22:50:59,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484480140] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:50:59,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:50:59,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:50:59,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983297841] [2024-06-27 22:50:59,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:50:59,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:50:59,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:50:59,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:50:59,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:50:59,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:50:59,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 804 transitions, 15328 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:50:59,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:50:59,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:50:59,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:02,077 INFO L124 PetriNetUnfolderBase]: 5358/9338 cut-off events. [2024-06-27 22:51:02,077 INFO L125 PetriNetUnfolderBase]: For 304327/304396 co-relation queries the response was YES. [2024-06-27 22:51:02,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70854 conditions, 9338 events. 5358/9338 cut-off events. For 304327/304396 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 73081 event pairs, 793 based on Foata normal form. 8/9229 useless extension candidates. Maximal degree in co-relation 70665. Up to 6935 conditions per place. [2024-06-27 22:51:02,203 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 634 selfloop transitions, 185 changer transitions 0/835 dead transitions. [2024-06-27 22:51:02,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 835 transitions, 17186 flow [2024-06-27 22:51:02,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:51:02,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:51:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 241 transitions. [2024-06-27 22:51:02,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5821256038647343 [2024-06-27 22:51:02,205 INFO L175 Difference]: Start difference. First operand has 470 places, 804 transitions, 15328 flow. Second operand 9 states and 241 transitions. [2024-06-27 22:51:02,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 835 transitions, 17186 flow [2024-06-27 22:51:04,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 835 transitions, 16796 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-06-27 22:51:04,293 INFO L231 Difference]: Finished difference. Result has 474 places, 804 transitions, 15314 flow [2024-06-27 22:51:04,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=14938, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15314, PETRI_PLACES=474, PETRI_TRANSITIONS=804} [2024-06-27 22:51:04,293 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 422 predicate places. [2024-06-27 22:51:04,294 INFO L495 AbstractCegarLoop]: Abstraction has has 474 places, 804 transitions, 15314 flow [2024-06-27 22:51:04,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:04,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:04,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:04,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-27 22:51:04,294 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:51:04,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:04,295 INFO L85 PathProgramCache]: Analyzing trace with hash -17659345, now seen corresponding path program 10 times [2024-06-27 22:51:04,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:04,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686043694] [2024-06-27 22:51:04,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:04,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:04,739 INFO 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:51:04,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:04,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686043694] [2024-06-27 22:51:04,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686043694] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:04,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:04,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:51:04,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920631971] [2024-06-27 22:51:04,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:04,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:51:04,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:04,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:51:04,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:51:04,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:51:04,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 804 transitions, 15314 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:04,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:04,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:51:04,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:07,226 INFO L124 PetriNetUnfolderBase]: 5366/9348 cut-off events. [2024-06-27 22:51:07,226 INFO L125 PetriNetUnfolderBase]: For 311640/311718 co-relation queries the response was YES. [2024-06-27 22:51:07,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71022 conditions, 9348 events. 5366/9348 cut-off events. For 311640/311718 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 73342 event pairs, 1274 based on Foata normal form. 13/9196 useless extension candidates. Maximal degree in co-relation 70832. Up to 7640 conditions per place. [2024-06-27 22:51:07,389 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 743 selfloop transitions, 87 changer transitions 0/846 dead transitions. [2024-06-27 22:51:07,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 846 transitions, 17387 flow [2024-06-27 22:51:07,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:51:07,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:51:07,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 284 transitions. [2024-06-27 22:51:07,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5612648221343873 [2024-06-27 22:51:07,390 INFO L175 Difference]: Start difference. First operand has 474 places, 804 transitions, 15314 flow. Second operand 11 states and 284 transitions. [2024-06-27 22:51:07,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 846 transitions, 17387 flow [2024-06-27 22:51:09,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 846 transitions, 17017 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:51:09,578 INFO L231 Difference]: Finished difference. Result has 478 places, 816 transitions, 15337 flow [2024-06-27 22:51:09,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=14944, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=721, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15337, PETRI_PLACES=478, PETRI_TRANSITIONS=816} [2024-06-27 22:51:09,579 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 426 predicate places. [2024-06-27 22:51:09,579 INFO L495 AbstractCegarLoop]: Abstraction has has 478 places, 816 transitions, 15337 flow [2024-06-27 22:51:09,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:09,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:09,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:09,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-27 22:51:09,580 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:51:09,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:09,580 INFO L85 PathProgramCache]: Analyzing trace with hash -776090422, now seen corresponding path program 5 times [2024-06-27 22:51:09,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:09,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176607119] [2024-06-27 22:51:09,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:09,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:10,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:10,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:10,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176607119] [2024-06-27 22:51:10,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176607119] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:10,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:10,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:51:10,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480284227] [2024-06-27 22:51:10,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:10,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:51:10,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:10,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:51:10,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:51:10,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:51:10,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 816 transitions, 15337 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:10,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:10,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:51:10,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:12,609 INFO L124 PetriNetUnfolderBase]: 5423/9430 cut-off events. [2024-06-27 22:51:12,609 INFO L125 PetriNetUnfolderBase]: For 321348/321417 co-relation queries the response was YES. [2024-06-27 22:51:12,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71482 conditions, 9430 events. 5423/9430 cut-off events. For 321348/321417 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 73889 event pairs, 859 based on Foata normal form. 8/9297 useless extension candidates. Maximal degree in co-relation 71290. Up to 7182 conditions per place. [2024-06-27 22:51:12,764 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 673 selfloop transitions, 159 changer transitions 0/848 dead transitions. [2024-06-27 22:51:12,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 848 transitions, 17451 flow [2024-06-27 22:51:12,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:51:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:51:12,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 216 transitions. [2024-06-27 22:51:12,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5869565217391305 [2024-06-27 22:51:12,775 INFO L175 Difference]: Start difference. First operand has 478 places, 816 transitions, 15337 flow. Second operand 8 states and 216 transitions. [2024-06-27 22:51:12,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 848 transitions, 17451 flow [2024-06-27 22:51:14,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 848 transitions, 17328 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-27 22:51:14,872 INFO L231 Difference]: Finished difference. Result has 480 places, 822 transitions, 15783 flow [2024-06-27 22:51:14,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=15214, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=816, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=660, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15783, PETRI_PLACES=480, PETRI_TRANSITIONS=822} [2024-06-27 22:51:14,873 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 428 predicate places. [2024-06-27 22:51:14,873 INFO L495 AbstractCegarLoop]: Abstraction has has 480 places, 822 transitions, 15783 flow [2024-06-27 22:51:14,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:14,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:14,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:14,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-27 22:51:14,874 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:51:14,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:14,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1034449111, now seen corresponding path program 11 times [2024-06-27 22:51:14,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:14,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649642351] [2024-06-27 22:51:14,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:14,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:15,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:15,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:15,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649642351] [2024-06-27 22:51:15,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649642351] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:15,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:15,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:51:15,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473604143] [2024-06-27 22:51:15,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:15,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:51:15,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:15,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:51:15,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:51:15,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:51:15,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 822 transitions, 15783 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:15,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:15,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:51:15,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:17,571 INFO L124 PetriNetUnfolderBase]: 5398/9402 cut-off events. [2024-06-27 22:51:17,571 INFO L125 PetriNetUnfolderBase]: For 337456/337534 co-relation queries the response was YES. [2024-06-27 22:51:17,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72251 conditions, 9402 events. 5398/9402 cut-off events. For 337456/337534 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 73808 event pairs, 1281 based on Foata normal form. 13/9252 useless extension candidates. Maximal degree in co-relation 72057. Up to 7597 conditions per place. [2024-06-27 22:51:17,723 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 697 selfloop transitions, 132 changer transitions 0/845 dead transitions. [2024-06-27 22:51:17,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 845 transitions, 17501 flow [2024-06-27 22:51:17,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:51:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:51:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 216 transitions. [2024-06-27 22:51:17,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5869565217391305 [2024-06-27 22:51:17,725 INFO L175 Difference]: Start difference. First operand has 480 places, 822 transitions, 15783 flow. Second operand 8 states and 216 transitions. [2024-06-27 22:51:17,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 845 transitions, 17501 flow [2024-06-27 22:51:20,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 845 transitions, 17132 flow, removed 100 selfloop flow, removed 4 redundant places. [2024-06-27 22:51:20,331 INFO L231 Difference]: Finished difference. Result has 484 places, 822 transitions, 15685 flow [2024-06-27 22:51:20,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=15414, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=822, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=690, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15685, PETRI_PLACES=484, PETRI_TRANSITIONS=822} [2024-06-27 22:51:20,340 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 432 predicate places. [2024-06-27 22:51:20,340 INFO L495 AbstractCegarLoop]: Abstraction has has 484 places, 822 transitions, 15685 flow [2024-06-27 22:51:20,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:20,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:20,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:20,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-27 22:51:20,341 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:51:20,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:20,341 INFO L85 PathProgramCache]: Analyzing trace with hash -776096219, now seen corresponding path program 12 times [2024-06-27 22:51:20,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:20,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832930878] [2024-06-27 22:51:20,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:20,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:20,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:20,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:20,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832930878] [2024-06-27 22:51:20,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832930878] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:20,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:20,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:51:20,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878521037] [2024-06-27 22:51:20,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:20,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:51:20,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:20,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:51:20,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:51:20,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:51:20,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 822 transitions, 15685 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:20,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:20,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:51:20,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:23,281 INFO L124 PetriNetUnfolderBase]: 5415/9430 cut-off events. [2024-06-27 22:51:23,281 INFO L125 PetriNetUnfolderBase]: For 332015/332093 co-relation queries the response was YES. [2024-06-27 22:51:23,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72169 conditions, 9430 events. 5415/9430 cut-off events. For 332015/332093 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 74035 event pairs, 1274 based on Foata normal form. 13/9277 useless extension candidates. Maximal degree in co-relation 71973. Up to 7712 conditions per place. [2024-06-27 22:51:23,431 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 746 selfloop transitions, 87 changer transitions 0/849 dead transitions. [2024-06-27 22:51:23,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 849 transitions, 17419 flow [2024-06-27 22:51:23,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:51:23,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:51:23,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 261 transitions. [2024-06-27 22:51:23,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5673913043478261 [2024-06-27 22:51:23,432 INFO L175 Difference]: Start difference. First operand has 484 places, 822 transitions, 15685 flow. Second operand 10 states and 261 transitions. [2024-06-27 22:51:23,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 849 transitions, 17419 flow [2024-06-27 22:51:25,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 849 transitions, 17083 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-27 22:51:25,858 INFO L231 Difference]: Finished difference. Result has 487 places, 822 transitions, 15530 flow [2024-06-27 22:51:25,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=15349, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=822, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=735, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15530, PETRI_PLACES=487, PETRI_TRANSITIONS=822} [2024-06-27 22:51:25,859 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 435 predicate places. [2024-06-27 22:51:25,859 INFO L495 AbstractCegarLoop]: Abstraction has has 487 places, 822 transitions, 15530 flow [2024-06-27 22:51:25,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:25,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:25,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:25,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-27 22:51:25,860 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:51:25,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:25,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1749582287, now seen corresponding path program 13 times [2024-06-27 22:51:25,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:25,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554981576] [2024-06-27 22:51:25,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:25,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:26,321 INFO 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:51:26,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:26,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554981576] [2024-06-27 22:51:26,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554981576] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:26,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:26,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:51:26,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557238814] [2024-06-27 22:51:26,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:26,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:51:26,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:26,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:51:26,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:51:26,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:51:26,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 822 transitions, 15530 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:26,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:26,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:51:26,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:28,956 INFO L124 PetriNetUnfolderBase]: 5482/9520 cut-off events. [2024-06-27 22:51:28,956 INFO L125 PetriNetUnfolderBase]: For 354619/354697 co-relation queries the response was YES. [2024-06-27 22:51:29,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73285 conditions, 9520 events. 5482/9520 cut-off events. For 354619/354697 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 74603 event pairs, 1291 based on Foata normal form. 13/9366 useless extension candidates. Maximal degree in co-relation 73088. Up to 7642 conditions per place. [2024-06-27 22:51:29,085 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 663 selfloop transitions, 193 changer transitions 0/872 dead transitions. [2024-06-27 22:51:29,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 872 transitions, 18154 flow [2024-06-27 22:51:29,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:51:29,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:51:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 265 transitions. [2024-06-27 22:51:29,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5760869565217391 [2024-06-27 22:51:29,087 INFO L175 Difference]: Start difference. First operand has 487 places, 822 transitions, 15530 flow. Second operand 10 states and 265 transitions. [2024-06-27 22:51:29,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 872 transitions, 18154 flow [2024-06-27 22:51:31,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 872 transitions, 17980 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:51:31,603 INFO L231 Difference]: Finished difference. Result has 489 places, 846 transitions, 16339 flow [2024-06-27 22:51:31,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=15356, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=822, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=641, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16339, PETRI_PLACES=489, PETRI_TRANSITIONS=846} [2024-06-27 22:51:31,604 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 437 predicate places. [2024-06-27 22:51:31,604 INFO L495 AbstractCegarLoop]: Abstraction has has 489 places, 846 transitions, 16339 flow [2024-06-27 22:51:31,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:31,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:31,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:31,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-27 22:51:31,605 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:51:31,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:31,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1749373750, now seen corresponding path program 6 times [2024-06-27 22:51:31,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:31,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210421421] [2024-06-27 22:51:31,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:31,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:32,197 INFO 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:51:32,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:32,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210421421] [2024-06-27 22:51:32,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210421421] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:32,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:32,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:51:32,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357763925] [2024-06-27 22:51:32,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:32,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:51:32,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:32,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:51:32,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:51:32,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:51:32,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 846 transitions, 16339 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:32,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:32,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:51:32,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:34,979 INFO L124 PetriNetUnfolderBase]: 5583/9702 cut-off events. [2024-06-27 22:51:34,980 INFO L125 PetriNetUnfolderBase]: For 408144/408180 co-relation queries the response was YES. [2024-06-27 22:51:35,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76166 conditions, 9702 events. 5583/9702 cut-off events. For 408144/408180 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 76209 event pairs, 924 based on Foata normal form. 8/9601 useless extension candidates. Maximal degree in co-relation 75967. Up to 6709 conditions per place. [2024-06-27 22:51:35,110 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 634 selfloop transitions, 234 changer transitions 0/884 dead transitions. [2024-06-27 22:51:35,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 884 transitions, 18881 flow [2024-06-27 22:51:35,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:51:35,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:51:35,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2024-06-27 22:51:35,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6118012422360248 [2024-06-27 22:51:35,112 INFO L175 Difference]: Start difference. First operand has 489 places, 846 transitions, 16339 flow. Second operand 7 states and 197 transitions. [2024-06-27 22:51:35,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 884 transitions, 18881 flow [2024-06-27 22:51:37,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 884 transitions, 18544 flow, removed 84 selfloop flow, removed 5 redundant places. [2024-06-27 22:51:37,703 INFO L231 Difference]: Finished difference. Result has 492 places, 858 transitions, 16965 flow [2024-06-27 22:51:37,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=16002, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=846, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=16965, PETRI_PLACES=492, PETRI_TRANSITIONS=858} [2024-06-27 22:51:37,704 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 440 predicate places. [2024-06-27 22:51:37,704 INFO L495 AbstractCegarLoop]: Abstraction has has 492 places, 858 transitions, 16965 flow [2024-06-27 22:51:37,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:37,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:37,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:37,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-27 22:51:37,705 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:51:37,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:37,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1749849414, now seen corresponding path program 13 times [2024-06-27 22:51:37,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:37,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149661935] [2024-06-27 22:51:37,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:37,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:38,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:38,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:38,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149661935] [2024-06-27 22:51:38,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149661935] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:38,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:38,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:51:38,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574733067] [2024-06-27 22:51:38,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:38,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:51:38,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:38,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:51:38,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:51:38,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:51:38,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 858 transitions, 16965 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:38,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:38,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:51:38,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:40,866 INFO L124 PetriNetUnfolderBase]: 5609/9734 cut-off events. [2024-06-27 22:51:40,866 INFO L125 PetriNetUnfolderBase]: For 433465/433501 co-relation queries the response was YES. [2024-06-27 22:51:40,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78359 conditions, 9734 events. 5609/9734 cut-off events. For 433465/433501 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 76372 event pairs, 865 based on Foata normal form. 8/9654 useless extension candidates. Maximal degree in co-relation 78157. Up to 6770 conditions per place. [2024-06-27 22:51:41,046 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 605 selfloop transitions, 273 changer transitions 0/894 dead transitions. [2024-06-27 22:51:41,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 894 transitions, 19512 flow [2024-06-27 22:51:41,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:51:41,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:51:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions. [2024-06-27 22:51:41,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5896739130434783 [2024-06-27 22:51:41,047 INFO L175 Difference]: Start difference. First operand has 492 places, 858 transitions, 16965 flow. Second operand 8 states and 217 transitions. [2024-06-27 22:51:41,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 894 transitions, 19512 flow [2024-06-27 22:51:44,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 498 places, 894 transitions, 19320 flow, removed 79 selfloop flow, removed 1 redundant places. [2024-06-27 22:51:44,392 INFO L231 Difference]: Finished difference. Result has 500 places, 869 transitions, 17895 flow [2024-06-27 22:51:44,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=16783, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=858, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=265, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=17895, PETRI_PLACES=500, PETRI_TRANSITIONS=869} [2024-06-27 22:51:44,392 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 448 predicate places. [2024-06-27 22:51:44,392 INFO L495 AbstractCegarLoop]: Abstraction has has 500 places, 869 transitions, 17895 flow [2024-06-27 22:51:44,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:44,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:44,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:44,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-27 22:51:44,394 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:51:44,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:44,394 INFO L85 PathProgramCache]: Analyzing trace with hash -432016896, now seen corresponding path program 14 times [2024-06-27 22:51:44,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:44,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512196850] [2024-06-27 22:51:44,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:44,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:45,008 INFO 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:51:45,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:45,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512196850] [2024-06-27 22:51:45,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512196850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:45,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:45,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:51:45,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876045612] [2024-06-27 22:51:45,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:45,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:51:45,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:45,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:51:45,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:51:45,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:51:45,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 869 transitions, 17895 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:45,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:45,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:51:45,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:47,896 INFO L124 PetriNetUnfolderBase]: 5622/9753 cut-off events. [2024-06-27 22:51:47,897 INFO L125 PetriNetUnfolderBase]: For 430079/430099 co-relation queries the response was YES. [2024-06-27 22:51:48,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80034 conditions, 9753 events. 5622/9753 cut-off events. For 430079/430099 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 76582 event pairs, 800 based on Foata normal form. 8/9676 useless extension candidates. Maximal degree in co-relation 79828. Up to 7345 conditions per place. [2024-06-27 22:51:48,075 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 709 selfloop transitions, 176 changer transitions 0/901 dead transitions. [2024-06-27 22:51:48,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 901 transitions, 19946 flow [2024-06-27 22:51:48,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:51:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:51:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 258 transitions. [2024-06-27 22:51:48,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5608695652173913 [2024-06-27 22:51:48,076 INFO L175 Difference]: Start difference. First operand has 500 places, 869 transitions, 17895 flow. Second operand 10 states and 258 transitions. [2024-06-27 22:51:48,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 901 transitions, 19946 flow [2024-06-27 22:51:51,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 506 places, 901 transitions, 19690 flow, removed 66 selfloop flow, removed 3 redundant places. [2024-06-27 22:51:51,590 INFO L231 Difference]: Finished difference. Result has 507 places, 872 transitions, 18050 flow [2024-06-27 22:51:51,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=17639, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=869, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=18050, PETRI_PLACES=507, PETRI_TRANSITIONS=872} [2024-06-27 22:51:51,591 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 455 predicate places. [2024-06-27 22:51:51,591 INFO L495 AbstractCegarLoop]: Abstraction has has 507 places, 872 transitions, 18050 flow [2024-06-27 22:51:51,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:51,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:51,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:51,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-27 22:51:51,591 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:51:51,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:51,592 INFO L85 PathProgramCache]: Analyzing trace with hash -991417903, now seen corresponding path program 14 times [2024-06-27 22:51:51,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:51,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141193663] [2024-06-27 22:51:51,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:51,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:52,061 INFO 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:51:52,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:52,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141193663] [2024-06-27 22:51:52,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141193663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:52,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:52,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:51:52,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343803748] [2024-06-27 22:51:52,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:52,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:51:52,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:52,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:51:52,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:51:52,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:51:52,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 872 transitions, 18050 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:52,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:52,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:51:52,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:54,902 INFO L124 PetriNetUnfolderBase]: 5598/9720 cut-off events. [2024-06-27 22:51:54,902 INFO L125 PetriNetUnfolderBase]: For 438969/439014 co-relation queries the response was YES. [2024-06-27 22:51:55,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80270 conditions, 9720 events. 5598/9720 cut-off events. For 438969/439014 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 76514 event pairs, 1319 based on Foata normal form. 13/9580 useless extension candidates. Maximal degree in co-relation 80062. Up to 7804 conditions per place. [2024-06-27 22:51:55,055 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 689 selfloop transitions, 195 changer transitions 0/900 dead transitions. [2024-06-27 22:51:55,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 900 transitions, 20212 flow [2024-06-27 22:51:55,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:51:55,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:51:55,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 287 transitions. [2024-06-27 22:51:55,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.567193675889328 [2024-06-27 22:51:55,056 INFO L175 Difference]: Start difference. First operand has 507 places, 872 transitions, 18050 flow. Second operand 11 states and 287 transitions. [2024-06-27 22:51:55,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 900 transitions, 20212 flow [2024-06-27 22:51:58,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 509 places, 900 transitions, 19739 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-27 22:51:58,580 INFO L231 Difference]: Finished difference. Result has 510 places, 872 transitions, 17974 flow [2024-06-27 22:51:58,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=17577, PETRI_DIFFERENCE_MINUEND_PLACES=499, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=872, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=677, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17974, PETRI_PLACES=510, PETRI_TRANSITIONS=872} [2024-06-27 22:51:58,581 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 458 predicate places. [2024-06-27 22:51:58,581 INFO L495 AbstractCegarLoop]: Abstraction has has 510 places, 872 transitions, 17974 flow [2024-06-27 22:51:58,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:58,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:58,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:58,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-27 22:51:58,582 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:51:58,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:58,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1005227690, now seen corresponding path program 15 times [2024-06-27 22:51:58,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:58,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152318319] [2024-06-27 22:51:58,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:58,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:59,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:59,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:59,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152318319] [2024-06-27 22:51:59,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152318319] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:59,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:59,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:51:59,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923609302] [2024-06-27 22:51:59,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:59,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:51:59,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:59,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:51:59,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:51:59,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:51:59,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 872 transitions, 17974 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:59,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:59,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:51:59,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:01,971 INFO L124 PetriNetUnfolderBase]: 5614/9751 cut-off events. [2024-06-27 22:52:01,972 INFO L125 PetriNetUnfolderBase]: For 426301/426321 co-relation queries the response was YES. [2024-06-27 22:52:02,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79902 conditions, 9751 events. 5614/9751 cut-off events. For 426301/426321 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 76681 event pairs, 816 based on Foata normal form. 8/9677 useless extension candidates. Maximal degree in co-relation 79693. Up to 7337 conditions per place. [2024-06-27 22:52:02,135 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 705 selfloop transitions, 175 changer transitions 0/896 dead transitions. [2024-06-27 22:52:02,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 896 transitions, 19790 flow [2024-06-27 22:52:02,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:52:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:52:02,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 213 transitions. [2024-06-27 22:52:02,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5788043478260869 [2024-06-27 22:52:02,136 INFO L175 Difference]: Start difference. First operand has 510 places, 872 transitions, 17974 flow. Second operand 8 states and 213 transitions. [2024-06-27 22:52:02,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 896 transitions, 19790 flow [2024-06-27 22:52:05,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 510 places, 896 transitions, 19322 flow, removed 69 selfloop flow, removed 7 redundant places. [2024-06-27 22:52:05,604 INFO L231 Difference]: Finished difference. Result has 511 places, 872 transitions, 17862 flow [2024-06-27 22:52:05,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=17506, PETRI_DIFFERENCE_MINUEND_PLACES=503, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=872, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=17862, PETRI_PLACES=511, PETRI_TRANSITIONS=872} [2024-06-27 22:52:05,605 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 459 predicate places. [2024-06-27 22:52:05,605 INFO L495 AbstractCegarLoop]: Abstraction has has 511 places, 872 transitions, 17862 flow [2024-06-27 22:52:05,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:05,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:05,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] [2024-06-27 22:52:05,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-27 22:52:05,606 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:52:05,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:05,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1763664347, now seen corresponding path program 15 times [2024-06-27 22:52:05,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:05,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917634805] [2024-06-27 22:52:05,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:05,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:06,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:52:06,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:06,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917634805] [2024-06-27 22:52:06,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917634805] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:06,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:06,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:52:06,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800193854] [2024-06-27 22:52:06,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:06,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:52:06,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:06,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:52:06,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:52:06,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:52:06,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 872 transitions, 17862 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:06,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:06,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:52:06,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:09,006 INFO L124 PetriNetUnfolderBase]: 5590/9727 cut-off events. [2024-06-27 22:52:09,007 INFO L125 PetriNetUnfolderBase]: For 436424/436453 co-relation queries the response was YES. [2024-06-27 22:52:09,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79813 conditions, 9727 events. 5590/9727 cut-off events. For 436424/436453 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 76626 event pairs, 1300 based on Foata normal form. 13/9601 useless extension candidates. Maximal degree in co-relation 79603. Up to 7933 conditions per place. [2024-06-27 22:52:09,156 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 787 selfloop transitions, 99 changer transitions 0/902 dead transitions. [2024-06-27 22:52:09,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 902 transitions, 20040 flow [2024-06-27 22:52:09,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:52:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:52:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 307 transitions. [2024-06-27 22:52:09,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5561594202898551 [2024-06-27 22:52:09,158 INFO L175 Difference]: Start difference. First operand has 511 places, 872 transitions, 17862 flow. Second operand 12 states and 307 transitions. [2024-06-27 22:52:09,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 902 transitions, 20040 flow [2024-06-27 22:52:12,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 902 transitions, 19690 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 22:52:12,318 INFO L231 Difference]: Finished difference. Result has 516 places, 872 transitions, 17717 flow [2024-06-27 22:52:12,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=17512, PETRI_DIFFERENCE_MINUEND_PLACES=504, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=872, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=773, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=17717, PETRI_PLACES=516, PETRI_TRANSITIONS=872} [2024-06-27 22:52:12,319 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 464 predicate places. [2024-06-27 22:52:12,319 INFO L495 AbstractCegarLoop]: Abstraction has has 516 places, 872 transitions, 17717 flow [2024-06-27 22:52:12,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:12,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:12,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:12,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-27 22:52:12,320 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:52:12,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:12,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1755390137, now seen corresponding path program 16 times [2024-06-27 22:52:12,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:12,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467823539] [2024-06-27 22:52:12,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:12,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:12,811 INFO 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:52:12,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:12,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467823539] [2024-06-27 22:52:12,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467823539] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:12,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:12,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:52:12,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122082387] [2024-06-27 22:52:12,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:12,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:52:12,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:12,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:52:12,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:52:12,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:52:12,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 872 transitions, 17717 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:12,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:12,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:52:12,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:15,808 INFO L124 PetriNetUnfolderBase]: 5587/9723 cut-off events. [2024-06-27 22:52:15,808 INFO L125 PetriNetUnfolderBase]: For 434971/435000 co-relation queries the response was YES. [2024-06-27 22:52:15,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79233 conditions, 9723 events. 5587/9723 cut-off events. For 434971/435000 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 76586 event pairs, 1300 based on Foata normal form. 13/9597 useless extension candidates. Maximal degree in co-relation 79022. Up to 7946 conditions per place. [2024-06-27 22:52:15,966 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 790 selfloop transitions, 86 changer transitions 0/892 dead transitions. [2024-06-27 22:52:15,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 892 transitions, 19519 flow [2024-06-27 22:52:15,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:52:15,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:52:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2024-06-27 22:52:15,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5760869565217391 [2024-06-27 22:52:15,967 INFO L175 Difference]: Start difference. First operand has 516 places, 872 transitions, 17717 flow. Second operand 8 states and 212 transitions. [2024-06-27 22:52:15,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 892 transitions, 19519 flow [2024-06-27 22:52:19,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 892 transitions, 19136 flow, removed 46 selfloop flow, removed 10 redundant places. [2024-06-27 22:52:19,167 INFO L231 Difference]: Finished difference. Result has 514 places, 872 transitions, 17513 flow [2024-06-27 22:52:19,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=17334, PETRI_DIFFERENCE_MINUEND_PLACES=506, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=872, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=786, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=17513, PETRI_PLACES=514, PETRI_TRANSITIONS=872} [2024-06-27 22:52:19,168 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 462 predicate places. [2024-06-27 22:52:19,168 INFO L495 AbstractCegarLoop]: Abstraction has has 514 places, 872 transitions, 17513 flow [2024-06-27 22:52:19,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:19,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:19,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:19,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-27 22:52:19,169 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:52:19,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:19,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1825135287, now seen corresponding path program 17 times [2024-06-27 22:52:19,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:19,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168457251] [2024-06-27 22:52:19,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:19,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:19,601 INFO 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:52:19,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:19,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168457251] [2024-06-27 22:52:19,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168457251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:19,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:19,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:52:19,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028832946] [2024-06-27 22:52:19,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:19,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:52:19,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:19,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:52:19,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:52:19,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:52:19,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 872 transitions, 17513 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:19,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:19,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:52:19,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:22,291 INFO L124 PetriNetUnfolderBase]: 5586/9721 cut-off events. [2024-06-27 22:52:22,291 INFO L125 PetriNetUnfolderBase]: For 436697/436726 co-relation queries the response was YES. [2024-06-27 22:52:22,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78860 conditions, 9721 events. 5586/9721 cut-off events. For 436697/436726 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 76604 event pairs, 1298 based on Foata normal form. 13/9593 useless extension candidates. Maximal degree in co-relation 78650. Up to 7931 conditions per place. [2024-06-27 22:52:22,477 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 781 selfloop transitions, 99 changer transitions 0/896 dead transitions. [2024-06-27 22:52:22,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 896 transitions, 19331 flow [2024-06-27 22:52:22,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:52:22,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:52:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 259 transitions. [2024-06-27 22:52:22,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5630434782608695 [2024-06-27 22:52:22,479 INFO L175 Difference]: Start difference. First operand has 514 places, 872 transitions, 17513 flow. Second operand 10 states and 259 transitions. [2024-06-27 22:52:22,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 896 transitions, 19331 flow [2024-06-27 22:52:25,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 896 transitions, 19075 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-27 22:52:25,616 INFO L231 Difference]: Finished difference. Result has 516 places, 872 transitions, 17462 flow [2024-06-27 22:52:25,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=17257, PETRI_DIFFERENCE_MINUEND_PLACES=506, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=872, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=773, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17462, PETRI_PLACES=516, PETRI_TRANSITIONS=872} [2024-06-27 22:52:25,617 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 464 predicate places. [2024-06-27 22:52:25,617 INFO L495 AbstractCegarLoop]: Abstraction has has 516 places, 872 transitions, 17462 flow [2024-06-27 22:52:25,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:25,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:25,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:25,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-27 22:52:25,618 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:52:25,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:25,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1005227256, now seen corresponding path program 7 times [2024-06-27 22:52:25,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:25,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143330503] [2024-06-27 22:52:25,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:25,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:26,196 INFO 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:52:26,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:26,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143330503] [2024-06-27 22:52:26,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143330503] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:26,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:26,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:52:26,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690008364] [2024-06-27 22:52:26,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:26,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:52:26,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:26,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:52:26,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:52:26,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:52:26,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 872 transitions, 17462 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:26,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:26,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:52:26,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:28,834 INFO L124 PetriNetUnfolderBase]: 5603/9752 cut-off events. [2024-06-27 22:52:28,835 INFO L125 PetriNetUnfolderBase]: For 445556/445576 co-relation queries the response was YES. [2024-06-27 22:52:28,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79107 conditions, 9752 events. 5603/9752 cut-off events. For 445556/445576 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 76806 event pairs, 880 based on Foata normal form. 8/9653 useless extension candidates. Maximal degree in co-relation 78896. Up to 7446 conditions per place. [2024-06-27 22:52:29,018 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 728 selfloop transitions, 153 changer transitions 0/897 dead transitions. [2024-06-27 22:52:29,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 897 transitions, 19376 flow [2024-06-27 22:52:29,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:52:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:52:29,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 211 transitions. [2024-06-27 22:52:29,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5733695652173914 [2024-06-27 22:52:29,019 INFO L175 Difference]: Start difference. First operand has 516 places, 872 transitions, 17462 flow. Second operand 8 states and 211 transitions. [2024-06-27 22:52:29,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 897 transitions, 19376 flow [2024-06-27 22:52:32,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 897 transitions, 19150 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-27 22:52:32,542 INFO L231 Difference]: Finished difference. Result has 516 places, 874 transitions, 17625 flow [2024-06-27 22:52:32,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=17236, PETRI_DIFFERENCE_MINUEND_PLACES=507, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=872, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=17625, PETRI_PLACES=516, PETRI_TRANSITIONS=874} [2024-06-27 22:52:32,543 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 464 predicate places. [2024-06-27 22:52:32,543 INFO L495 AbstractCegarLoop]: Abstraction has has 516 places, 874 transitions, 17625 flow [2024-06-27 22:52:32,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:32,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:32,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:32,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-27 22:52:32,544 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:52:32,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:32,544 INFO L85 PathProgramCache]: Analyzing trace with hash -996513373, now seen corresponding path program 18 times [2024-06-27 22:52:32,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:32,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655532250] [2024-06-27 22:52:32,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:32,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:32,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:52:32,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:32,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655532250] [2024-06-27 22:52:33,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655532250] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:33,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:33,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:52:33,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702585502] [2024-06-27 22:52:33,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:33,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:52:33,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:33,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:52:33,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:52:33,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:52:33,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 874 transitions, 17625 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:33,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:33,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:52:33,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:35,781 INFO L124 PetriNetUnfolderBase]: 5589/9733 cut-off events. [2024-06-27 22:52:35,782 INFO L125 PetriNetUnfolderBase]: For 438281/438310 co-relation queries the response was YES. [2024-06-27 22:52:35,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79511 conditions, 9733 events. 5589/9733 cut-off events. For 438281/438310 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 76781 event pairs, 1312 based on Foata normal form. 13/9602 useless extension candidates. Maximal degree in co-relation 79298. Up to 7797 conditions per place. [2024-06-27 22:52:35,957 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 689 selfloop transitions, 189 changer transitions 0/894 dead transitions. [2024-06-27 22:52:35,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 894 transitions, 19431 flow [2024-06-27 22:52:35,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:52:35,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:52:35,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions. [2024-06-27 22:52:35,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5896739130434783 [2024-06-27 22:52:35,959 INFO L175 Difference]: Start difference. First operand has 516 places, 874 transitions, 17625 flow. Second operand 8 states and 217 transitions. [2024-06-27 22:52:35,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 894 transitions, 19431 flow [2024-06-27 22:52:39,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 894 transitions, 19027 flow, removed 37 selfloop flow, removed 6 redundant places. [2024-06-27 22:52:39,381 INFO L231 Difference]: Finished difference. Result has 518 places, 874 transitions, 17606 flow [2024-06-27 22:52:39,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=17221, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=874, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=189, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=685, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=17606, PETRI_PLACES=518, PETRI_TRANSITIONS=874} [2024-06-27 22:52:39,382 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 466 predicate places. [2024-06-27 22:52:39,382 INFO L495 AbstractCegarLoop]: Abstraction has has 518 places, 874 transitions, 17606 flow [2024-06-27 22:52:39,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:39,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:39,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:39,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-27 22:52:39,383 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:52:39,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:39,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1249895956, now seen corresponding path program 8 times [2024-06-27 22:52:39,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:39,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259705209] [2024-06-27 22:52:39,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:39,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:39,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:52:39,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:39,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259705209] [2024-06-27 22:52:39,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259705209] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:39,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:39,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:52:39,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684211305] [2024-06-27 22:52:39,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:39,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:52:39,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:39,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:52:39,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:52:39,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-06-27 22:52:39,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 874 transitions, 17606 flow. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:39,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:39,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-06-27 22:52:39,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:43,146 INFO L124 PetriNetUnfolderBase]: 6557/11172 cut-off events. [2024-06-27 22:52:43,146 INFO L125 PetriNetUnfolderBase]: For 461989/462018 co-relation queries the response was YES. [2024-06-27 22:52:43,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90086 conditions, 11172 events. 6557/11172 cut-off events. For 461989/462018 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 86597 event pairs, 1371 based on Foata normal form. 14/11060 useless extension candidates. Maximal degree in co-relation 89871. Up to 9373 conditions per place. [2024-06-27 22:52:43,356 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 848 selfloop transitions, 45 changer transitions 0/906 dead transitions. [2024-06-27 22:52:43,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 906 transitions, 19808 flow [2024-06-27 22:52:43,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:52:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:52:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-06-27 22:52:43,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5271739130434783 [2024-06-27 22:52:43,357 INFO L175 Difference]: Start difference. First operand has 518 places, 874 transitions, 17606 flow. Second operand 8 states and 194 transitions. [2024-06-27 22:52:43,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 906 transitions, 19808 flow [2024-06-27 22:52:47,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 906 transitions, 19389 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 22:52:47,613 INFO L231 Difference]: Finished difference. Result has 519 places, 884 transitions, 17669 flow [2024-06-27 22:52:47,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=17195, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=874, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=830, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=17669, PETRI_PLACES=519, PETRI_TRANSITIONS=884} [2024-06-27 22:52:47,614 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 467 predicate places. [2024-06-27 22:52:47,614 INFO L495 AbstractCegarLoop]: Abstraction has has 519 places, 884 transitions, 17669 flow [2024-06-27 22:52:47,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:47,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:47,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:47,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-27 22:52:47,615 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:52:47,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:47,615 INFO L85 PathProgramCache]: Analyzing trace with hash 950010291, now seen corresponding path program 19 times [2024-06-27 22:52:47,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:47,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501907796] [2024-06-27 22:52:47,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:47,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:48,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:48,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501907796] [2024-06-27 22:52:48,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501907796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:48,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:48,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:52:48,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503484552] [2024-06-27 22:52:48,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:48,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:52:48,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:48,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:52:48,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:52:48,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:52:48,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 884 transitions, 17669 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:48,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:48,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:52:48,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:50,922 INFO L124 PetriNetUnfolderBase]: 5758/9970 cut-off events. [2024-06-27 22:52:50,922 INFO L125 PetriNetUnfolderBase]: For 512497/512533 co-relation queries the response was YES. [2024-06-27 22:52:51,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82721 conditions, 9970 events. 5758/9970 cut-off events. For 512497/512533 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 78484 event pairs, 925 based on Foata normal form. 7/9867 useless extension candidates. Maximal degree in co-relation 82504. Up to 6985 conditions per place. [2024-06-27 22:52:51,109 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 653 selfloop transitions, 264 changer transitions 0/933 dead transitions. [2024-06-27 22:52:51,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 933 transitions, 20942 flow [2024-06-27 22:52:51,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:52:51,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:52:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2024-06-27 22:52:51,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6118012422360248 [2024-06-27 22:52:51,110 INFO L175 Difference]: Start difference. First operand has 519 places, 884 transitions, 17669 flow. Second operand 7 states and 197 transitions. [2024-06-27 22:52:51,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 933 transitions, 20942 flow [2024-06-27 22:52:55,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 933 transitions, 20753 flow, removed 86 selfloop flow, removed 2 redundant places. [2024-06-27 22:52:55,083 INFO L231 Difference]: Finished difference. Result has 525 places, 910 transitions, 19023 flow [2024-06-27 22:52:55,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=17480, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=884, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=241, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=642, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=19023, PETRI_PLACES=525, PETRI_TRANSITIONS=910} [2024-06-27 22:52:55,083 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 473 predicate places. [2024-06-27 22:52:55,084 INFO L495 AbstractCegarLoop]: Abstraction has has 525 places, 910 transitions, 19023 flow [2024-06-27 22:52:55,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:55,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:55,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:55,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-27 22:52:55,084 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:52:55,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:55,085 INFO L85 PathProgramCache]: Analyzing trace with hash -864604340, now seen corresponding path program 9 times [2024-06-27 22:52:55,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:55,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176667045] [2024-06-27 22:52:55,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:55,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:55,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:52:55,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:55,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176667045] [2024-06-27 22:52:55,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176667045] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:55,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:55,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:52:55,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644291195] [2024-06-27 22:52:55,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:55,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:52:55,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:55,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:52:55,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:52:55,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:52:55,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 910 transitions, 19023 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:55,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:55,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:52:55,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:58,458 INFO L124 PetriNetUnfolderBase]: 5768/9972 cut-off events. [2024-06-27 22:52:58,458 INFO L125 PetriNetUnfolderBase]: For 536450/536479 co-relation queries the response was YES. [2024-06-27 22:52:58,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84713 conditions, 9972 events. 5768/9972 cut-off events. For 536450/536479 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 78241 event pairs, 1673 based on Foata normal form. 14/9858 useless extension candidates. Maximal degree in co-relation 84494. Up to 8210 conditions per place. [2024-06-27 22:52:58,627 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 860 selfloop transitions, 61 changer transitions 0/937 dead transitions. [2024-06-27 22:52:58,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 937 transitions, 21286 flow [2024-06-27 22:52:58,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:52:58,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:52:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2024-06-27 22:52:58,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5905797101449275 [2024-06-27 22:52:58,628 INFO L175 Difference]: Start difference. First operand has 525 places, 910 transitions, 19023 flow. Second operand 6 states and 163 transitions. [2024-06-27 22:52:58,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 937 transitions, 21286 flow [2024-06-27 22:53:03,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 937 transitions, 20956 flow, removed 151 selfloop flow, removed 1 redundant places. [2024-06-27 22:53:03,227 INFO L231 Difference]: Finished difference. Result has 532 places, 921 transitions, 19258 flow [2024-06-27 22:53:03,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=18693, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=910, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=853, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=19258, PETRI_PLACES=532, PETRI_TRANSITIONS=921} [2024-06-27 22:53:03,228 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 480 predicate places. [2024-06-27 22:53:03,228 INFO L495 AbstractCegarLoop]: Abstraction has has 532 places, 921 transitions, 19258 flow [2024-06-27 22:53:03,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:03,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:03,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:03,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-27 22:53:03,229 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:53:03,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:03,229 INFO L85 PathProgramCache]: Analyzing trace with hash -401361364, now seen corresponding path program 10 times [2024-06-27 22:53:03,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:03,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264699777] [2024-06-27 22:53:03,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:03,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:03,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:03,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:03,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264699777] [2024-06-27 22:53:03,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264699777] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:03,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:03,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:53:03,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183971637] [2024-06-27 22:53:03,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:03,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:53:03,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:03,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:53:03,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:53:03,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:53:03,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 532 places, 921 transitions, 19258 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:03,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:03,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:53:03,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:06,555 INFO L124 PetriNetUnfolderBase]: 5763/9967 cut-off events. [2024-06-27 22:53:06,556 INFO L125 PetriNetUnfolderBase]: For 536547/536592 co-relation queries the response was YES. [2024-06-27 22:53:06,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85041 conditions, 9967 events. 5763/9967 cut-off events. For 536547/536592 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 78311 event pairs, 1258 based on Foata normal form. 14/9831 useless extension candidates. Maximal degree in co-relation 84818. Up to 8108 conditions per place. [2024-06-27 22:53:06,729 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 836 selfloop transitions, 94 changer transitions 0/946 dead transitions. [2024-06-27 22:53:06,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 946 transitions, 21658 flow [2024-06-27 22:53:06,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:53:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:53:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-06-27 22:53:06,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5978260869565217 [2024-06-27 22:53:06,730 INFO L175 Difference]: Start difference. First operand has 532 places, 921 transitions, 19258 flow. Second operand 6 states and 165 transitions. [2024-06-27 22:53:06,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 946 transitions, 21658 flow [2024-06-27 22:53:11,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 946 transitions, 21374 flow, removed 127 selfloop flow, removed 2 redundant places. [2024-06-27 22:53:11,168 INFO L231 Difference]: Finished difference. Result has 537 places, 929 transitions, 19546 flow [2024-06-27 22:53:11,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=18976, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=921, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=830, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=19546, PETRI_PLACES=537, PETRI_TRANSITIONS=929} [2024-06-27 22:53:11,169 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 485 predicate places. [2024-06-27 22:53:11,169 INFO L495 AbstractCegarLoop]: Abstraction has has 537 places, 929 transitions, 19546 flow [2024-06-27 22:53:11,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:11,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:11,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:11,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-27 22:53:11,170 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:53:11,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:11,170 INFO L85 PathProgramCache]: Analyzing trace with hash -25014009, now seen corresponding path program 20 times [2024-06-27 22:53:11,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:11,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188889993] [2024-06-27 22:53:11,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:11,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:11,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:11,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188889993] [2024-06-27 22:53:11,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188889993] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:11,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:11,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:53:11,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310877895] [2024-06-27 22:53:11,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:11,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:53:11,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:11,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:53:11,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:53:11,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:53:11,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 929 transitions, 19546 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:11,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:11,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:53:11,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:15,188 INFO L124 PetriNetUnfolderBase]: 5770/9959 cut-off events. [2024-06-27 22:53:15,189 INFO L125 PetriNetUnfolderBase]: For 524737/524773 co-relation queries the response was YES. [2024-06-27 22:53:15,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85314 conditions, 9959 events. 5770/9959 cut-off events. For 524737/524773 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 78080 event pairs, 901 based on Foata normal form. 7/9852 useless extension candidates. Maximal degree in co-relation 85089. Up to 7010 conditions per place. [2024-06-27 22:53:15,346 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 657 selfloop transitions, 282 changer transitions 0/955 dead transitions. [2024-06-27 22:53:15,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 955 transitions, 22040 flow [2024-06-27 22:53:15,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:53:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:53:15,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 200 transitions. [2024-06-27 22:53:15,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6211180124223602 [2024-06-27 22:53:15,347 INFO L175 Difference]: Start difference. First operand has 537 places, 929 transitions, 19546 flow. Second operand 7 states and 200 transitions. [2024-06-27 22:53:15,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 955 transitions, 22040 flow [2024-06-27 22:53:18,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 955 transitions, 21801 flow, removed 89 selfloop flow, removed 3 redundant places. [2024-06-27 22:53:18,916 INFO L231 Difference]: Finished difference. Result has 541 places, 929 transitions, 19884 flow [2024-06-27 22:53:18,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=19313, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=929, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=282, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=647, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=19884, PETRI_PLACES=541, PETRI_TRANSITIONS=929} [2024-06-27 22:53:18,917 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 489 predicate places. [2024-06-27 22:53:18,917 INFO L495 AbstractCegarLoop]: Abstraction has has 541 places, 929 transitions, 19884 flow [2024-06-27 22:53:18,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:18,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:18,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:18,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-27 22:53:18,920 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:53:18,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:18,921 INFO L85 PathProgramCache]: Analyzing trace with hash -686042734, now seen corresponding path program 11 times [2024-06-27 22:53:18,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:18,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912097966] [2024-06-27 22:53:18,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:18,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:19,591 INFO 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:53:19,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:19,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912097966] [2024-06-27 22:53:19,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912097966] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:19,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:19,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:53:19,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439650530] [2024-06-27 22:53:19,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:19,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:53:19,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:19,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:53:19,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:53:19,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:53:19,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 929 transitions, 19884 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:19,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:19,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:53:19,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:22,970 INFO L124 PetriNetUnfolderBase]: 5817/10056 cut-off events. [2024-06-27 22:53:22,971 INFO L125 PetriNetUnfolderBase]: For 537182/537202 co-relation queries the response was YES. [2024-06-27 22:53:23,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86827 conditions, 10056 events. 5817/10056 cut-off events. For 537182/537202 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 78985 event pairs, 870 based on Foata normal form. 8/9957 useless extension candidates. Maximal degree in co-relation 86601. Up to 7788 conditions per place. [2024-06-27 22:53:23,139 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 814 selfloop transitions, 122 changer transitions 0/952 dead transitions. [2024-06-27 22:53:23,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 952 transitions, 22238 flow [2024-06-27 22:53:23,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:53:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:53:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions. [2024-06-27 22:53:23,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5942028985507246 [2024-06-27 22:53:23,143 INFO L175 Difference]: Start difference. First operand has 541 places, 929 transitions, 19884 flow. Second operand 6 states and 164 transitions. [2024-06-27 22:53:23,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 952 transitions, 22238 flow [2024-06-27 22:53:28,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 952 transitions, 21630 flow, removed 84 selfloop flow, removed 3 redundant places. [2024-06-27 22:53:28,248 INFO L231 Difference]: Finished difference. Result has 544 places, 935 transitions, 19796 flow [2024-06-27 22:53:28,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=19276, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=929, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=810, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=19796, PETRI_PLACES=544, PETRI_TRANSITIONS=935} [2024-06-27 22:53:28,249 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 492 predicate places. [2024-06-27 22:53:28,250 INFO L495 AbstractCegarLoop]: Abstraction has has 544 places, 935 transitions, 19796 flow [2024-06-27 22:53:28,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:28,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:28,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:28,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-27 22:53:28,252 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:53:28,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:28,252 INFO L85 PathProgramCache]: Analyzing trace with hash -864096814, now seen corresponding path program 12 times [2024-06-27 22:53:28,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:28,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199917979] [2024-06-27 22:53:28,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:28,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:28,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:28,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199917979] [2024-06-27 22:53:28,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199917979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:28,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:28,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:53:28,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989646146] [2024-06-27 22:53:28,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:28,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:53:28,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:28,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:53:28,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:53:28,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:53:28,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 935 transitions, 19796 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:28,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:28,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:53:28,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:32,175 INFO L124 PetriNetUnfolderBase]: 5798/9998 cut-off events. [2024-06-27 22:53:32,175 INFO L125 PetriNetUnfolderBase]: For 555486/555522 co-relation queries the response was YES. [2024-06-27 22:53:32,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85028 conditions, 9998 events. 5798/9998 cut-off events. For 555486/555522 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 78234 event pairs, 1275 based on Foata normal form. 14/9896 useless extension candidates. Maximal degree in co-relation 84802. Up to 7949 conditions per place. [2024-06-27 22:53:32,336 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 842 selfloop transitions, 93 changer transitions 0/951 dead transitions. [2024-06-27 22:53:32,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 951 transitions, 21702 flow [2024-06-27 22:53:32,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:53:32,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:53:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2024-06-27 22:53:32,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5869565217391305 [2024-06-27 22:53:32,338 INFO L175 Difference]: Start difference. First operand has 544 places, 935 transitions, 19796 flow. Second operand 6 states and 162 transitions. [2024-06-27 22:53:32,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 951 transitions, 21702 flow [2024-06-27 22:53:36,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 951 transitions, 21278 flow, removed 114 selfloop flow, removed 3 redundant places. [2024-06-27 22:53:36,754 INFO L231 Difference]: Finished difference. Result has 547 places, 935 transitions, 19570 flow [2024-06-27 22:53:36,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=19372, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=935, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=842, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=19570, PETRI_PLACES=547, PETRI_TRANSITIONS=935} [2024-06-27 22:53:36,756 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 495 predicate places. [2024-06-27 22:53:36,756 INFO L495 AbstractCegarLoop]: Abstraction has has 547 places, 935 transitions, 19570 flow [2024-06-27 22:53:36,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:36,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:36,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:36,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-27 22:53:36,757 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:53:36,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:36,757 INFO L85 PathProgramCache]: Analyzing trace with hash -864097031, now seen corresponding path program 21 times [2024-06-27 22:53:36,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:36,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400991388] [2024-06-27 22:53:36,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:36,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:37,057 INFO 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:53:37,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:37,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400991388] [2024-06-27 22:53:37,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400991388] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:37,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:37,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:53:37,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002095740] [2024-06-27 22:53:37,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:37,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:53:37,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:37,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:53:37,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:53:37,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:53:37,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 935 transitions, 19570 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:37,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:37,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:53:37,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:40,650 INFO L124 PetriNetUnfolderBase]: 5806/10045 cut-off events. [2024-06-27 22:53:40,650 INFO L125 PetriNetUnfolderBase]: For 497300/497345 co-relation queries the response was YES. [2024-06-27 22:53:40,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84971 conditions, 10045 events. 5806/10045 cut-off events. For 497300/497345 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 79244 event pairs, 1306 based on Foata normal form. 13/9908 useless extension candidates. Maximal degree in co-relation 84745. Up to 8326 conditions per place. [2024-06-27 22:53:40,811 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 885 selfloop transitions, 53 changer transitions 0/954 dead transitions. [2024-06-27 22:53:40,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 954 transitions, 21606 flow [2024-06-27 22:53:40,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:53:40,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:53:40,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions. [2024-06-27 22:53:40,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5683229813664596 [2024-06-27 22:53:40,813 INFO L175 Difference]: Start difference. First operand has 547 places, 935 transitions, 19570 flow. Second operand 7 states and 183 transitions. [2024-06-27 22:53:40,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 954 transitions, 21606 flow [2024-06-27 22:53:44,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 954 transitions, 21294 flow, removed 29 selfloop flow, removed 5 redundant places. [2024-06-27 22:53:44,935 INFO L231 Difference]: Finished difference. Result has 549 places, 939 transitions, 19503 flow [2024-06-27 22:53:44,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=19258, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=935, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=882, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=19503, PETRI_PLACES=549, PETRI_TRANSITIONS=939} [2024-06-27 22:53:44,936 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 497 predicate places. [2024-06-27 22:53:44,936 INFO L495 AbstractCegarLoop]: Abstraction has has 549 places, 939 transitions, 19503 flow [2024-06-27 22:53:44,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:44,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:44,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:44,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-27 22:53:44,937 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:53:44,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:44,937 INFO L85 PathProgramCache]: Analyzing trace with hash -33740416, now seen corresponding path program 16 times [2024-06-27 22:53:44,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:44,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962621704] [2024-06-27 22:53:44,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:44,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:45,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:53:45,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:45,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962621704] [2024-06-27 22:53:45,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962621704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:45,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:45,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:53:45,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347794000] [2024-06-27 22:53:45,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:45,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:53:45,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:45,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:53:45,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:53:45,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:53:45,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 939 transitions, 19503 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:45,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:45,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:53:45,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:49,084 INFO L124 PetriNetUnfolderBase]: 5812/10046 cut-off events. [2024-06-27 22:53:49,084 INFO L125 PetriNetUnfolderBase]: For 498978/498998 co-relation queries the response was YES. [2024-06-27 22:53:49,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84665 conditions, 10046 events. 5812/10046 cut-off events. For 498978/498998 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 78916 event pairs, 820 based on Foata normal form. 8/9967 useless extension candidates. Maximal degree in co-relation 84438. Up to 7539 conditions per place. [2024-06-27 22:53:49,245 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 760 selfloop transitions, 198 changer transitions 0/974 dead transitions. [2024-06-27 22:53:49,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 974 transitions, 21745 flow [2024-06-27 22:53:49,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:53:49,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:53:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 241 transitions. [2024-06-27 22:53:49,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5821256038647343 [2024-06-27 22:53:49,246 INFO L175 Difference]: Start difference. First operand has 549 places, 939 transitions, 19503 flow. Second operand 9 states and 241 transitions. [2024-06-27 22:53:49,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 974 transitions, 21745 flow [2024-06-27 22:53:53,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 974 transitions, 21572 flow, removed 46 selfloop flow, removed 4 redundant places. [2024-06-27 22:53:53,593 INFO L231 Difference]: Finished difference. Result has 554 places, 942 transitions, 19800 flow [2024-06-27 22:53:53,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=19330, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=939, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=744, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=19800, PETRI_PLACES=554, PETRI_TRANSITIONS=942} [2024-06-27 22:53:53,594 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 502 predicate places. [2024-06-27 22:53:53,594 INFO L495 AbstractCegarLoop]: Abstraction has has 554 places, 942 transitions, 19800 flow [2024-06-27 22:53:53,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:53,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:53:53,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:53:53,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-06-27 22:53:53,594 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:53:53,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:53:53,595 INFO L85 PathProgramCache]: Analyzing trace with hash -33728326, now seen corresponding path program 17 times [2024-06-27 22:53:53,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:53:53,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754649658] [2024-06-27 22:53:53,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:53:53,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:53:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:53:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:53:54,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:53:54,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754649658] [2024-06-27 22:53:54,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754649658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:53:54,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:53:54,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:53:54,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187600064] [2024-06-27 22:53:54,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:53:54,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:53:54,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:53:54,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:53:54,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:53:54,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-06-27 22:53:54,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 942 transitions, 19800 flow. Second operand has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:53:54,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:53:54,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-06-27 22:53:54,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:53:57,784 INFO L124 PetriNetUnfolderBase]: 5816/10041 cut-off events. [2024-06-27 22:53:57,784 INFO L125 PetriNetUnfolderBase]: For 498229/498249 co-relation queries the response was YES. [2024-06-27 22:53:57,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85189 conditions, 10041 events. 5816/10041 cut-off events. For 498229/498249 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 78674 event pairs, 845 based on Foata normal form. 8/9934 useless extension candidates. Maximal degree in co-relation 84960. Up to 7985 conditions per place. [2024-06-27 22:53:57,937 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 835 selfloop transitions, 113 changer transitions 0/963 dead transitions. [2024-06-27 22:53:57,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 963 transitions, 21742 flow [2024-06-27 22:53:57,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:53:57,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:53:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 217 transitions. [2024-06-27 22:53:57,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5241545893719807 [2024-06-27 22:53:57,938 INFO L175 Difference]: Start difference. First operand has 554 places, 942 transitions, 19800 flow. Second operand 9 states and 217 transitions. [2024-06-27 22:53:57,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 963 transitions, 21742 flow [2024-06-27 22:54:02,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 963 transitions, 21292 flow, removed 35 selfloop flow, removed 9 redundant places. [2024-06-27 22:54:02,088 INFO L231 Difference]: Finished difference. Result has 554 places, 942 transitions, 19582 flow [2024-06-27 22:54:02,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=19350, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=942, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=829, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=19582, PETRI_PLACES=554, PETRI_TRANSITIONS=942} [2024-06-27 22:54:02,088 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 502 predicate places. [2024-06-27 22:54:02,088 INFO L495 AbstractCegarLoop]: Abstraction has has 554 places, 942 transitions, 19582 flow [2024-06-27 22:54:02,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:02,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:02,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:02,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-06-27 22:54:02,089 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:02,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:02,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1739059062, now seen corresponding path program 13 times [2024-06-27 22:54:02,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:02,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461798410] [2024-06-27 22:54:02,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:02,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:02,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:54:02,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:02,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461798410] [2024-06-27 22:54:02,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461798410] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:02,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:02,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:54:02,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39497104] [2024-06-27 22:54:02,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:02,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:54:02,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:02,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:54:02,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:54:02,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:54:02,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 942 transitions, 19582 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:02,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:02,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:54:02,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:06,263 INFO L124 PetriNetUnfolderBase]: 5823/10052 cut-off events. [2024-06-27 22:54:06,263 INFO L125 PetriNetUnfolderBase]: For 499023/499059 co-relation queries the response was YES. [2024-06-27 22:54:06,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84596 conditions, 10052 events. 5823/10052 cut-off events. For 499023/499059 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 78876 event pairs, 921 based on Foata normal form. 8/9947 useless extension candidates. Maximal degree in co-relation 84369. Up to 7042 conditions per place. [2024-06-27 22:54:06,428 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 692 selfloop transitions, 255 changer transitions 0/963 dead transitions. [2024-06-27 22:54:06,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 963 transitions, 21714 flow [2024-06-27 22:54:06,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:54:06,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:54:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2024-06-27 22:54:06,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6195652173913043 [2024-06-27 22:54:06,430 INFO L175 Difference]: Start difference. First operand has 554 places, 942 transitions, 19582 flow. Second operand 6 states and 171 transitions. [2024-06-27 22:54:06,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 963 transitions, 21714 flow [2024-06-27 22:54:10,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 963 transitions, 21393 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-27 22:54:10,240 INFO L231 Difference]: Finished difference. Result has 552 places, 942 transitions, 19789 flow [2024-06-27 22:54:10,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=19261, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=942, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=255, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=19789, PETRI_PLACES=552, PETRI_TRANSITIONS=942} [2024-06-27 22:54:10,240 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 500 predicate places. [2024-06-27 22:54:10,241 INFO L495 AbstractCegarLoop]: Abstraction has has 552 places, 942 transitions, 19789 flow [2024-06-27 22:54:10,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:10,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:10,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:10,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-06-27 22:54:10,241 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:10,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:10,242 INFO L85 PathProgramCache]: Analyzing trace with hash -25459479, now seen corresponding path program 22 times [2024-06-27 22:54:10,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:10,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910522954] [2024-06-27 22:54:10,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:10,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:54:10,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:10,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910522954] [2024-06-27 22:54:10,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910522954] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:10,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:10,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:54:10,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179491415] [2024-06-27 22:54:10,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:10,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:54:10,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:10,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:54:10,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:54:10,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:54:10,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 942 transitions, 19789 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:10,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:10,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:54:10,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:14,583 INFO L124 PetriNetUnfolderBase]: 5810/10049 cut-off events. [2024-06-27 22:54:14,583 INFO L125 PetriNetUnfolderBase]: For 473306/473326 co-relation queries the response was YES. [2024-06-27 22:54:14,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84695 conditions, 10049 events. 5810/10049 cut-off events. For 473306/473326 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 78925 event pairs, 891 based on Foata normal form. 7/9946 useless extension candidates. Maximal degree in co-relation 84469. Up to 7601 conditions per place. [2024-06-27 22:54:14,738 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 786 selfloop transitions, 165 changer transitions 0/967 dead transitions. [2024-06-27 22:54:14,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 967 transitions, 21757 flow [2024-06-27 22:54:14,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:54:14,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:54:14,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2024-06-27 22:54:14,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2024-06-27 22:54:14,740 INFO L175 Difference]: Start difference. First operand has 552 places, 942 transitions, 19789 flow. Second operand 7 states and 196 transitions. [2024-06-27 22:54:14,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 967 transitions, 21757 flow [2024-06-27 22:54:18,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 967 transitions, 20866 flow, removed 74 selfloop flow, removed 8 redundant places. [2024-06-27 22:54:18,757 INFO L231 Difference]: Finished difference. Result has 551 places, 942 transitions, 19235 flow [2024-06-27 22:54:18,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=18898, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=942, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=777, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=19235, PETRI_PLACES=551, PETRI_TRANSITIONS=942} [2024-06-27 22:54:18,758 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 499 predicate places. [2024-06-27 22:54:18,758 INFO L495 AbstractCegarLoop]: Abstraction has has 551 places, 942 transitions, 19235 flow [2024-06-27 22:54:18,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:18,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:18,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:18,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-06-27 22:54:18,759 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 22:54:18,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:18,759 INFO L85 PathProgramCache]: Analyzing trace with hash -686042951, now seen corresponding path program 23 times [2024-06-27 22:54:18,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:18,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697179548] [2024-06-27 22:54:18,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:18,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:19,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:54:19,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:19,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697179548] [2024-06-27 22:54:19,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697179548] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:19,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:19,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:54:19,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976543151] [2024-06-27 22:54:19,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:19,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:54:19,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:19,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:54:19,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:54:19,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-06-27 22:54:19,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 942 transitions, 19235 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:19,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:19,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-06-27 22:54:19,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand